- Nordic Journal of Computing MENDLER-STYLE INDUCTIVE TYPES,
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Under consideration for publication in Math. Struct. in Comp. Science Type-based termination of recursive
- Program and Proof Optimizations with Type Ando Saabas and Tarmo Uustalu
- The Essence of Dataflow Programming Tarmo Uustalu1
- Build, Augment and Destroy, Universally Neil Ghani1
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Functional Programming with Apomorphisms / Corecursion
- CPS Translating Inductive and Coinductive Types [Extended Abstract]
- Nordic Journal of Computing 8(2001), 366{390. RECURSION SCHEMES FROM COMONADS
- INFORMATICA, 1999, Vol. 10, No. 1, 526 5 1999 Institute of Mathematics and Informatics, Vilnius
- A Compositional Natural Semantics and Hoare Logic for Low-Level Languages 1
- A CATEGORICAL OUTLOOK ON CELLULAR AUTOMATA SILVIO CAPOBIANCO AND TARMO UUSTALU
- Monads Need Not Be Endofunctors Thorsten Altenkirch1
- Steffen van Bakel, Stefano Berardi, Ulrich Berger (Eds.): Classical Logic and Computation 2010 (Cl&C'10)
- Comonadic functional attribute evaluation
- Multi(Co)Iteration, Categorically Tarmo Uustalu
- Program Repair as Sound Optimization of Broken Programs Bernd Fischer
- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
- Proc. Estonian Acad. Sci. Phys. Math., 1998, 47, 3, 147--16 1 FUNCTIONAL PROGRAMMING WITH
- Generalizing the AUGMENT Neil Ghani1, Tarmo Uustalu2, and Varmo Vene3
- Monad Translating Inductive and Coinductive Types
- This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicatevalued operators on predicate transformers that
- Generalizing Substitution (Extended Abstract)
- Bidirectional Data-Flow Analyses, Type-Systematically Maria Jo~ao Frade
- The Essence of Dataflow Programming (Short Version)
- Nordic Journal of Computing 6(1999), 343 361. MENDLER-STYLE INDUCTIVE TYPES,
- Type Systems Equivalent to Data-Flow Analyses for Imperative Languages
- Signals and Comonads Tarmo Uustalu
- A note on strong dinaturality, initial algebras and uniform parameterized fixpoint operators
- L. Aceto, P. Sobocinski (Eds.): Seventh Workshop on Structural Operational Semantics 2010 (SOS '10)
- Trace-Based Coinductive Operational Semantics Big-Step and Small-Step, Relational and Functional Styles
- The Recursion Scheme from the Cofree Recursive Comonad
- Proof Optimization for Partial Redundancy Elimination Ando Saabas Tarmo Uustalu
- Categorical Views on Computations on Trees (Extended Abstract)
- ByteCode 2007 Type Systems for Optimizing Stack-based
- Representing Cyclic Structures as Nested Datatypes Neil Ghani1, Makoto Hamana2, Tarmo Uustalu3, and Varmo Vene4
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Compositional Type Systems for Stack-Based Low-Level Languages Ando Saabas Tarmo Uustalu
- Comonadic functional attribute evaluation Tarmo Uustalu1 and Varmo Vene2
- SOS 2005 Preliminary Version A Compositional Natural Semantics and Hoare
- Monad Combinators, Non-Determinism and Probabilistic [Extended abstract]
- Recursive Coalgebras from Comonads Venanzio Capretta 1
- CMCS'04 Preliminary Version Recursive Coalgebras from Comonads
- Normalization by Evaluation for 2 Thorsten Altenkirch1
- Explicit Substitutions and Higher-Order Syntax [Extended Abstract]
- RAIRO-Inf. Theor. Appl. 38 (2004) 321-342 DOI: 10.1051/ita:2004016
- Substitution in Non-wellfounded Syntax with Variable Binding
- CPS Translating Inductive and Coinductive Types [Extended Abstract]
- The Dual of Substitution is Redecoration
- A Cube of Proof Systems for the Intuitionistic Predicate , -Logic
- Proof Optimization for Partial Redundancy Elimination$
- Explicit Substitutions and Higher-Order Syntax School of Computer Science and IT, University of Nottingham,
- Monadic Augment and Generalised Short Cut Fusion University of Leicester
- Theoretical Informatics and Applications Theoret. Informatics Appl. 37 (2003) 315336
- Math. Struct. in Comp. Science (2004), vol. 14, pp. 97141. c 2004 Cambridge University Press DOI: 10.1017/S0960129503004122 Printed in the United Kingdom
- Iteration and Coiteration Schemes for Higher-Order and Nested Datatypes
- Comonadic Notions of Computation Tarmo Uustalu1
- Foundational certification of data-flow analyses Maria Jo~ao Frade
- A Proof Pearl with the Fan Theorem and Bar Induction
