| 2009 |
|---|
| 40 | EE | Maria João Frade,
Ando Saabas,
Tarmo Uustalu:
Bidirectional data-flow analyses, type-systematically.
PEPM 2009: 141-150 |
| 2008 |
|---|
| 39 | EE | Ando Saabas,
Tarmo Uustalu:
Proof optimization for partial redundancy elimination.
PEPM 2008: 91-101 |
| 38 | EE | Tarmo Uustalu,
Varmo Vene:
Comonadic Notions of Computation.
Electr. Notes Theor. Comput. Sci. 203(5): 263-284 (2008) |
| 37 | EE | Ando Saabas,
Tarmo Uustalu:
Program and proof optimizations with type systems.
J. Log. Algebr. Program. 77(1-2): 131-154 (2008) |
| 2007 |
|---|
| 36 | EE | Ichiro Hasuo,
Bart Jacobs,
Tarmo Uustalu:
Categorical Views on Computations on Trees (Extended Abstract).
ICALP 2007: 619-630 |
| 35 | EE | Maria João Frade,
Ando Saabas,
Tarmo Uustalu:
Foundational certification of data-flow analyses.
TASE 2007: 107-116 |
| 34 | EE | Ando Saabas,
Tarmo Uustalu:
Type Systems for Optimizing Stack-based Code.
Electr. Notes Theor. Comput. Sci. 190(1): 103-119 (2007) |
| 33 | EE | Ando Saabas,
Tarmo Uustalu:
A compositional natural semantics and Hoare logic for low-level languages.
Theor. Comput. Sci. 373(3): 273-302 (2007) |
| 2006 |
|---|
| 32 | | Tarmo Uustalu:
Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings
Springer 2006 |
| 31 | EE | Ando Saabas,
Tarmo Uustalu:
Compositional Type Systems for Stack-Based Low-Level Languages.
CATS 2006: 27-39 |
| 30 | EE | Ando Saabas,
Tarmo Uustalu:
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages.
Electr. Notes Theor. Comput. Sci. 156(1): 151-168 (2006) |
| 29 | EE | Neil Ghani,
Tarmo Uustalu,
Makoto Hamana:
Explicit substitutions and higher-order syntax.
Higher-Order and Symbolic Computation 19(2-3): 263-282 (2006) |
| 28 | EE | Venanzio Capretta,
Tarmo Uustalu,
Varmo Vene:
Recursive coalgebras from comonads.
Inf. Comput. 204(4): 437-468 (2006) |
| 27 | 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 |
|---|
| 26 | | Varmo Vene,
Tarmo Uustalu:
Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures
Springer 2005 |
| 25 | EE | Tarmo Uustalu,
Varmo Vene:
The Essence of Dataflow Programming.
APLAS 2005: 2-18 |
| 24 | EE | Tarmo Uustalu,
Varmo Vene:
The Essence of Dataflow Programming.
CEFP 2005: 135-167 |
| 23 | EE | Neil Ghani,
Patricia Johann,
Tarmo Uustalu,
Varmo Vene:
Monadic augment and generalised short cut fusion.
ICFP 2005: 294-305 |
| 22 | | Tarmo Uustalu,
Varmo Vene:
Comonadic functional attribute evaluation.
Trends in Functional Programming 2005: 145-162 |
| 21 | EE | Tarmo Uustalu,
Varmo Vene:
Signals and Comonads.
J. UCS 11(7): 1310-1326 (2005) |
| 20 | EE | Andreas Abel,
Ralph Matthes,
Tarmo Uustalu:
Iteration and coiteration schemes for higher-order and nested datatypes.
Theor. Comput. Sci. 333(1-2): 3-66 (2005) |
| 2004 |
|---|
| 19 | EE | Neil Ghani,
Tarmo Uustalu,
Varmo Vene:
Build, Augment and Destroy, Universally.
APLAS 2004: 327-347 |
| 18 | EE | Thorsten Altenkirch,
Tarmo Uustalu:
Normalization by Evaluation for lambda-2.
FLOPS 2004: 260-275 |
| 17 | | Neil Ghani,
Tarmo Uustalu,
Varmo Vene:
Generalizing the AUGMENT combinator.
Trends in Functional Programming 2004: 65-78 |
| 16 | EE | Venanzio Capretta,
Tarmo Uustalu,
Varmo Vene:
Recursive Coalgebras from Comonads.
Electr. Notes Theor. Comput. Sci. 106: 43-61 (2004) |
| 15 | EE | Gilles Barthe,
Maria João Frade,
E. Giménez,
Luis Pinto,
Tarmo Uustalu:
Type-based termination of recursive definitions.
Mathematical Structures in Computer Science 14(1): 97-141 (2004) |
| 14 | EE | Ralph Matthes,
Tarmo Uustalu:
Substitution in non-wellfounded syntax with variable binding.
Theor. Comput. Sci. 327(1-2): 155-174 (2004) |
| 2003 |
|---|
| 13 | EE | Andreas Abel,
Ralph Matthes,
Tarmo Uustalu:
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.
FoSSaCS 2003: 54-69 |
| 12 | EE | Neil Ghani,
Tarmo Uustalu:
Explicit substitutions and higher-order syntax.
MERLIN 2003 |
| 11 | EE | Ralph Matthes,
Tarmo Uustalu:
Substitution in Non-wellfounded Syntax with Variable Binding.
Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 10 | EE | Tarmo Uustalu:
Generalizing Substitution.
ITA 37(4): 315-336 (2003) |
| 2002 |
|---|
| 9 | | Tarmo Uustalu:
Generalizing substitution.
FICS 2002: 9-11 |
| 8 | EE | Gilles Barthe,
Tarmo Uustalu:
CPS translating inductive and coinductive types.
PEPM 2002: 131-142 |
| 7 | EE | Tarmo Uustalu:
Monad Translating Inductive and Coinductive Types.
TYPES 2002: 299-315 |
| 6 | EE | Tarmo Uustalu,
Varmo Vene:
Least and greatest fixed points in intuitionistic natural deduction.
Theor. Comput. Sci. 272(1-2): 315-339 (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) |
| 1992 |
|---|
| 1 | EE | Tarmo Uustalu:
Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach.
ECOOP 1992: 98-113 |
