Varmo Vene's papers available on-line

• P. Laud, T. Uustalu, V. Vene. Type systems equivalent to dataflow analyses for imperative languages. Theoretical Computer Science, v. 364, n. 3, pp. 292-310, 2006. - .ps.gz, preprint version (© Elsevier Science) // Conf. version in M. Hofmann, H.-W. Loidl, eds., Proc. of 3rd APPSEM II Wksh., APPSEM '05 (Frauenchiemsee, Sept. 2005), 12 pp. Ludwig-Maximilians-Univ. München, 2005.

• J. Kabanov, V. Vene. Recursion Schemes for Dynamic Programming. In T. Uustalu, ed., Proc. of 8th Int. Conf. on Mathematics of Program Construction, MPC'06 (Kuressaare, July 2006), Lecture Notes in Computer Science (LNCS), v. 4014, pp. 235-252, Springer-Verlag, 2006. - .ps.gz (© Springer-Verlag)

• N. Ghani, M. Hamana, T. Uustalu, V. Vene. Representing cyclic structures as nested datatypes. In H. Nilsson, ed., Proc. of 7th Symp. on Trends in Functional Programming, TFP 2006 (Nottingham, Apr. 2006), pp. 173-188. Univ. of Nottingham, 2006. - .ps.gz

• T. Uustalu, V. Vene. The Essence of Dataflow Programming. In K. Yi, ed., Proc. of 3rd Asian Symp. on Programming Languages and Systems, APLAS'05 (Tsukuba, Nov. 2005), Lecture Notes in Computer Science (LNCS), v. 3780, pp. 2-18, Springer-Verlag, 2005. - .ps.gz (© Springer-Verlag)

• N. Ghani, P. Johann, T. Uustalu, V. Vene. Monadic augment and generalised short cut fusion. In Proc. of 10th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'05 (Tallinn, Sept. 2005), ACM SIGPLAN Notices, v. 40, n. 9, pp. 294-305. ACM Press, 2005. - .ps.gz (© ACM).

• P. Laud, V. Vene. A Type System for Computationally Secure Information Flow. In M. Liskiewicz, R. Reischuk, eds., Proc. of 15th Int. Symp. on Fundamentals of Computational Theory, FCT'05 (Lübeck, Aug. 2005), Lecture Notes in Computer Science (LNCS), v. 3623, pp. 365-377, Springer-Verlag, 2005. - .ps.gz (© Springer-Verlag). // Full version is available as Research Report IT-LU-O-043-050307 of Cybernetica AS.

• T. Uustalu, V. Vene. Signals and Comonads. Journal of Universal Computer Science, v. 11, n. 7, pp. 1310-1326, 2005. (© Springer-Verlag). // Conf. version in M. Musicante, R. Massa, eds., Proc. of 9th Brazilian Symp. on Programming Languages, SBLP'05 (Recife, PE, May 2005), pp. 215-228. Univ. de Pernambuco, Recife, 2005. - .ps.gz

• N. Ghani, T. Uustalu, V. Vene. Generalizing the augment combinator. In H.-W. Loidl, ed., Trends in Functional Programming 5, pp. 65-78. Intellect, Bristol / Portland, OR, 2006. - .ps.gz (© Intellect)

• N. Ghani, T. Uustalu, V. Vene. Build, augment and destroy, universally. In W.-N. Chin, ed., Proc. of 2nd Asian Symp. on Programming Languages and Systems, APLAS'04 (Taipei, Nov. 2004), Lecture Notes in Computer Science (LNCS), v. 3302, pp. 327-347, Springer-Verlag, 2004. - .ps.gz (© Springer-Verlag)

• V. Capretta, T. Uustalu, V. Vene. Recursive coalgebras from comonads. Information and Computation, v. 204, n. 4, pp. 437-468, 2006. - .ps.gz (© Elsevier Science) // Conf. version in J. Adámek, S. Milius, eds., Proc. of 7th Int. Wksh. on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, Apr. 2004), Electronic Notes in Theoretical Computer Science (ENTCS), v. 106, pp. 43-61, Elsevier, 2004. - .ps.gz (© Elsevier Science)

• H. Seidl, V. Vene, M. Müller-Olm. Global invariants for analysing multi-threaded applications. Proc. of Estonian Academy of Sciences: Phys., Math., v. 52, n. 4, pp. 413-436, 2003. - .ps.gz (© Estonian Academy Publishers)

• T. Uustalu, V. Vene. The dual of substitution is redecoration. In K. Hammond, S. Curtis, eds., Trends in Functional Programming 3, pp. 99-110. Intellect, Bristol / Portland, OR, 2002. - .ps.gz (© Intellect)

• T. Uustalu, V. Vene. Least and greatest fixed-points in intuitionistic natural deduction. Theoretical Computer Science, v. 272, n. 1-2, pp. 315-339, 2002. - .ps.gz, preprint version (© Elsevier Science)

• T. Uustalu, V. Vene, A. Pardo. Recursion schemes from comonads. Nordic J. of Computing, v. 8, n. 3, pp. 366-390, 2001. - .ps.gz (© Publ. Assoc. Nordic J. of Computing)

• V. Vene. Categorical programming with inductive and coinductive types. Diss. Math. Uni. Tartuensis, v. 23, Uni. of Tartu, Aug. 2000. - .ps.gz, .pdf.

• T. Uustalu, V. Vene. Coding recursion à la Mendler (extended abstract). In J. Jeuring, ed, Proc of 2nd Wksh on Generic Programming, WGP'2000 (Ponte de Lima, July 2000), Techn. Report UU-CS-2000-19, Dept. of Comp. Sci., Utrecht Univ., pp 69-85, 2000. - .ps.gz

• T. Uustalu, V. Vene. Mendler-style inductive types, categorically. Nordic J. of Computing, v. 6, n. 3, pp. 343-361, 1999. - .ps.gz (© Publ. Assoc. Nordic J. of Computing)

• T. Uustalu, V. Vene. Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica, v. 10, n. 1, pp. 5-26, 1999. - .ps.gz (© Inst. of Math. and Inform.)

• V. Vene, T. Uustalu. Functional programming with apomorphisms (corecursion). Proc. of Estonian Academy of Sciences: Phys., Math., v. 47, n. 3, pp. 147-161, 1998. - .ps.gz (© Estonian Academy Publishers)

• T. Uustalu, V. Vene. A cube of proof systems for the intuitionistic predicate mu-,nu-logic. In M. Haveraaen, O. Owe, eds, Selected Papers from 8th Nordic Wksh. on Programming Theory, NWPT'96 (Oslo, Dec. 1996), Research Report 248, Dept. of Informatics, Univ. of Oslo, pp. 237-246, 1997. - .ps.gz