Varmo Vene's papers available on-line

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

• V. Capretta, T. Uustalu, V. Vene. Recursive coalgebras from comonads. To appear in J. Adámek, ed., Proc. of 7th Int. Wksh. on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, Apr. 2004), Electr. Notes. in Theor. Comp. Sci., Elsevier, 2004. - .ps.gz

• 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