| 2008 |
| 22 | EE | Tarmo Uustalu,
Varmo Vene:
Comonadic Notions of Computation.
Electr. Notes Theor. Comput. Sci. 203(5): 263-284 (2008) |
| 2006 |
| 21 | | Michael Johnson,
Varmo Vene:
Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings
Springer 2006 |
| 20 | EE | Jevgeni Kabanov,
Varmo Vene:
Recursion Schemes for Dynamic Programming.
MPC 2006: 235-252 |
| 19 | EE | Venanzio Capretta,
Tarmo Uustalu,
Varmo Vene:
Recursive coalgebras from comonads.
Inf. Comput. 204(4): 437-468 (2006) |
| 18 | EE | Peeter Laud,
Tarmo Uustalu,
Varmo Vene:
Type systems equivalent to data-flow analyses for imperative languages.
Theor. Comput. Sci. 364(3): 292-310 (2006) |
| 2005 |
| 17 | | Varmo Vene,
Tarmo Uustalu:
Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures
Springer 2005 |
| 16 | EE | Tarmo Uustalu,
Varmo Vene:
The Essence of Dataflow Programming.
APLAS 2005: 2-18 |
| 15 | EE | Tarmo Uustalu,
Varmo Vene:
The Essence of Dataflow Programming.
CEFP 2005: 135-167 |
| 14 | EE | Peeter Laud,
Varmo Vene:
A Type System for Computationally Secure Information Flow.
FCT 2005: 365-377 |
| 13 | EE | Neil Ghani,
Patricia Johann,
Tarmo Uustalu,
Varmo Vene:
Monadic augment and generalised short cut fusion.
ICFP 2005: 294-305 |
| 12 | | Tarmo Uustalu,
Varmo Vene:
Comonadic functional attribute evaluation.
Trends in Functional Programming 2005: 145-162 |
| 11 | EE | Tarmo Uustalu,
Varmo Vene:
Signals and Comonads.
J. UCS 11(7): 1310-1326 (2005) |
| 2004 |
| 10 | EE | Neil Ghani,
Tarmo Uustalu,
Varmo Vene:
Build, Augment and Destroy, Universally.
APLAS 2004: 327-347 |
| 9 | | Neil Ghani,
Tarmo Uustalu,
Varmo Vene:
Generalizing the AUGMENT combinator.
Trends in Functional Programming 2004: 65-78 |
| 8 | EE | Venanzio Capretta,
Tarmo Uustalu,
Varmo Vene:
Recursive Coalgebras from Comonads.
Electr. Notes Theor. Comput. Sci. 106: 43-61 (2004) |
| 2002 |
| 7 | EE | Tarmo Uustalu,
Varmo Vene:
Least and greatest fixed points in intuitionistic natural deduction.
Theor. Comput. Sci. 272(1-2): 315-339 (2002) |
| 6 | | Helmut Seidl,
Varmo Vene,
Markus Müller-Olm:
Interprocedural Invariants
Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10: (2002) |
| 2001 |
| 5 | | Tarmo Uustalu,
Varmo Vene:
The Dual of Substitution is Redecoration.
Scottish Functional Programming Workshop 2001: 99-110 |
| 4 | EE | Tarmo Uustalu,
Varmo Vene,
Alberto Pardo:
Recursion Schemes from Comonads.
Nord. J. Comput. 8(3): 366-390 (2001) |
| 1999 |
| 3 | EE | Tarmo Uustalu,
Varmo Vene:
Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically.
Informatica, Lith. Acad. Sci. 10(1): 5-26 (1999) |
| 2 | | Tarmo Uustalu,
Varmo Vene:
Mendler-Style Inductive Types, Categorically.
Nord. J. Comput. 6(3): 343- (1999) |
| 1998 |
| 1 | EE | Merik Meriste,
Jaan Penjam,
Varmo Vene:
Models of Attributed Automata.
Informatica, Lith. Acad. Sci. 9(1): 85-105 (1998) |