Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach. - Tarmo Uustalu (ECOOP, 1992)

Constraint Satisfaction and Constraint Programming: A Brief Lead-In. - Brian H. Mayoh; Enn Tyugu; Tarmo Uustalu (NATO ASI CP, 1993)

Higher-Order Functional Constraint Networks. - Enn Tyugu; Tarmo Uustalu (NATO ASI CP, 1993)

Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically. - Tarmo Uustalu; Varmo Vene (Informatica, 1999)

Mendler-Style Inductive Types, Categorically. - Tarmo Uustalu; Varmo Vene (Nord. J. Comput., 1999)

(Co)monads from inductive and coinductive types (Extended Abstract). - Tarmo Uustalu (APPIA-GULP-PRODE, 2001)

The Dual of Substitution is Redecoration. - Tarmo Uustalu; Varmo Vene (Scottish Functional Programming Workshop, 2001)

Recursion Schemes from Comonads. - Tarmo Uustalu; Varmo Vene; Alberto Pardo (Nord. J. Comput., 2001)

CPS translating inductive and coinductive types. - Gilles Barthe; Tarmo Uustalu (PEPM, 2002)

Monad Translating Inductive and Coinductive Types. - Tarmo Uustalu (TYPES, 2002)

Least and greatest fixed points in intuitionistic natural deduction. - Tarmo Uustalu; Varmo Vene (Theor. Comput. Sci., 2002)

Coproducts of Ideal Monads (Extended Abstract). - Neil Ghani; Tarmo Uustalu (FICS, 2003)

An Alternative Characterization of Complete Iterativeness (Extended Abstract). - Tarmo Uustalu; Varmo Vene (FICS, 2003)

Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. - Andreas Abel 001; Ralph Matthes; Tarmo Uustalu (FoSSaCS, 2003)

Explicit substitutions and higher-order syntax. - Neil Ghani; Tarmo Uustalu (MERLIN, 2003)

Generalizing Substitution. - Tarmo Uustalu (RAIRO Theor. Informatics Appl., 2003)

Build, Augment and Destroy, Universally. - Neil Ghani; Tarmo Uustalu; Varmo Vene (APLAS, 2004)

Normalization by Evaluation for lambda-2. - Thorsten Altenkirch; Tarmo Uustalu (FLOPS, 2004)

Generalizing the AUGMENT combinator. - Neil Ghani; Tarmo Uustalu; Varmo Vene (Trends in Functional Programming, 2004)

Recursive Coalgebras from Comonads. - Venanzio Capretta; Tarmo Uustalu; Varmo Vene (CMCS, 2004)

Coproducts of Ideal Monads. - Neil Ghani; Tarmo Uustalu (RAIRO Theor. Informatics Appl., 2004)

Type-based termination of recursive definitions. - Gilles Barthe; Maria João Frade; Eduardo Giménez 001; Luís Pinto 001; Tarmo Uustalu (Math. Struct. Comput. Sci., 2004)

Substitution in non-wellfounded syntax with variable binding. - Ralph Matthes; Tarmo Uustalu (Theor. Comput. Sci., 2004)

The Essence of Dataflow Programming. - Tarmo Uustalu; Varmo Vene (APLAS, 2005)

Monadic augment and generalised short cut fusion. - Neil Ghani; Patricia Johann; Tarmo Uustalu; Varmo Vene (ICFP, 2005)

Comonadic functional attribute evaluation. - Tarmo Uustalu; Varmo Vene (Trends in Functional Programming, 2005)

Signals and Comonads. - Tarmo Uustalu; Varmo Vene (J. Univers. Comput. Sci., 2005)

Iteration and coiteration schemes for higher-order and nested datatypes. - Andreas Abel 001; Ralph Matthes; Tarmo Uustalu (Theor. Comput. Sci., 2005)

Compositional Type Systems for Stack-Based Low-Level Languages. - Ando Saabas; Tarmo Uustalu (CATS, 2006)

Explicit substitutions and higher-order syntax. - Neil Ghani; Tarmo Uustalu; Makoto Hamana (High. Order Symb. Comput., 2006)

Type systems equivalent to data-flow analyses for imperative languages. - Peeter Laud; Tarmo Uustalu; Varmo Vene (Theor. Comput. Sci., 2006)

Categorical Views on Computations on Trees (Extended Abstract). - Ichiro Hasuo; Bart Jacobs 001; Tarmo Uustalu (ICALP, 2007)

Foundational certification of data-flow analyses. - Maria João Frade; Ando Saabas; Tarmo Uustalu (TASE, 2007)

Type Systems for Optimizing Stack-based Code. - Ando Saabas; Tarmo Uustalu (Bytecode@ETAPS, 2007)

A compositional natural semantics and Hoare logic for low-level languages. - Ando Saabas; Tarmo Uustalu (Theor. Comput. Sci., 2007)

Comonadic Notions of Computation. - Tarmo Uustalu; Varmo Vene (CMCS, 2008)

The Recursion Scheme from the Cofree Recursive Comonad. - Tarmo Uustalu; Varmo Vene (MSFP@ICALP, 2008)

Program and proof optimizations with type systems. - Ando Saabas; Tarmo Uustalu (J. Log. Algebraic Methods Program., 2008)

Bidirectional data-flow analyses, type-systematically. - Maria João Frade; Ando Saabas; Tarmo Uustalu (PEPM, 2009)

Corecursive Algebras: A Study of General Structured Corecursion. - Venanzio Capretta; Tarmo Uustalu; Varmo Vene (SBMF, 2009)

Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. - Luís Pinto 001; Tarmo Uustalu (TABLEAUX, 2009)

Program Repair as Sound Optimization of Broken Programs. - Bernd Fischer 002; Ando Saabas; Tarmo Uustalu (TASE, 2009)

Trace-Based Coinductive Operational Semantics for While. - Keiko Nakata 001; Tarmo Uustalu (TPHOLs, 2009)

Preface. - Conor McBride; Tarmo Uustalu (J. Funct. Program., 2009)

Proof optimization for partial redundancy elimination. - Ando Saabas; Tarmo Uustalu (J. Log. Algebraic Methods Program., 2009)

Preface. - Tarmo Uustalu (Sci. Comput. Program., 2009)

A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators. - Tarmo Uustalu (FICS, 2010)

Antifounded Coinduction in Type Theory. - Tarmo Uustalu (PAR@ITP, 2010)

A Categorical Outlook on Cellular Automata. - Silvio Capobianco; Tarmo Uustalu (JAC, 2010)

Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction - Keiko Nakata 001; Tarmo Uustalu (SOS, 2010)

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic - Luís Pinto 001; Tarmo Uustalu (CL&C, 2010)

Preface. - Thorsten Altenkirch; Tarmo Uustalu (Fundam. Informaticae, 2010)

A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. - Keiko Nakata 001; Tarmo Uustalu; Marc Bezem (APLAS, 2011)

Explicit Binds: Effortless Efficiency with and without Trees. - Tarmo Uustalu (FLOPS, 2012)

Structured general corecursion and coinductive graphs [extended abstract] - Tarmo Uustalu (FICS, 2012)

On streams that are finitely red - Marc Bezem; Keiko Nakata 001; Tarmo Uustalu (Log. Methods Comput. Sci., 2012)

Certified Parsing of Regular Languages. - Denis Firsov; Tarmo Uustalu (CPP, 2013)

Update Monads: Cointerpreting Directed Containers. - Danel Ahman; Tarmo Uustalu (TYPES, 2013)

Coinductive Big-Step Semantics for Concurrency. - Tarmo Uustalu (PLACES, 2013)

Preface. - Ralph Matthes; Tarmo Uustalu (RAIRO Theor. Informatics Appl., 2013)

Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11). - Ichiro Hasuo; Keiko Nakata 001; Tarmo Uustalu (NII Shonan Meet. Rep., 2013)

When is a container a comonad? - Danel Ahman; James Chapman 001; Tarmo Uustalu (Log. Methods Comput. Sci., 2014)

Coherence for Skew-Monoidal Categories. - Tarmo Uustalu (MSFP, 2014)

Coalgebraic Update Lenses. - Danel Ahman; Tarmo Uustalu (MFPS, 2014)

Relative Monads Formalised. - Thorsten Altenkirch; James Chapman 001; Tarmo Uustalu (J. Formaliz. Reason., 2014)

Certified CYK parsing of context-free languages. - Denis Firsov; Tarmo Uustalu (J. Log. Algebraic Methods Program., 2014)

Certified Normalization of Context-Free Grammars. - Denis Firsov; Tarmo Uustalu (CPP, 2015)

Dependently typed programming with finite sets. - Denis Firsov; Tarmo Uustalu (WGP@ICFP, 2015)

Monads need not be endofunctors. - Thorsten Altenkirch; James Chapman 001; Tarmo Uustalu (Log. Methods Comput. Sci., 2015)

A Hoare logic for the coinductive trace-based big-step semantics of While. - Keiko Nakata 001; Tarmo Uustalu (Log. Methods Comput. Sci., 2015)

Stateful Runners of Effectful Computations. - Tarmo Uustalu (MFPS, 2015)

A Coalgebraic View of Bar Recursion and Bar Induction. - Venanzio Capretta; Tarmo Uustalu (FoSSaCS, 2016)

Combining effects and coeffects via grading. - Marco Gaboardi; Shin-ya Katsumata; Dominic A. Orchard; Flavien Breuvart; Tarmo Uustalu (ICFP, 2016)

Directed Containers as Categories. - Danel Ahman; Tarmo Uustalu (MSFP, 2016)

Variations on Noetherianness. - Denis Firsov; Tarmo Uustalu; Niccolò Veltri (MSFP, 2016)

A divertimento on MonadPlus and nondeterminism. - Tarmo Uustalu (J. Log. Algebraic Methods Program., 2016)

Guest editors' foreword. - Tarmo Uustalu; Jüri Vain (J. Log. Algebraic Methods Program., 2016)

Partiality and Container Monads. - Tarmo Uustalu; Niccolò Veltri (APLAS, 2017)

Taking Updates Seriously. - Danel Ahman; Tarmo Uustalu (BX@ETAPS, 2017)

The Delay Monad and Restriction Categories. - Tarmo Uustalu; Niccolò Veltri (ICTAC, 2017)

Container Combinatorics: Monads and Lax Monoidal Functors. - Tarmo Uustalu (TTCS, 2017)

Generating Representative Executions [Extended Abstract]. - Hendrik Maarand; Tarmo Uustalu (PLACES@ETAPS, 2017)

Finiteness and rational sequences, constructively. - Tarmo Uustalu; Niccolò Veltri (J. Funct. Program., 2017)

Formalizing Restriction Categories. - James Chapman 001; Tarmo Uustalu; Niccolò Veltri (J. Formaliz. Reason., 2017)

Certified Foata Normalization for Generalized Traces. - Hendrik Maarand; Tarmo Uustalu (NFM, 2018)

The Sequent Calculus of Skew Monoidal Categories. - Tarmo Uustalu; Niccolò Veltri; Noam Zeilberger (MFPS, 2018)

Codensity Lifting of Monads and its Dual. - Shin-ya Katsumata; Tetsuya Sato 001; Tarmo Uustalu (Log. Methods Comput. Sci., 2018)

A proof-theoretic study of bi-intuitionistic propositional sequent calculus. - Luís Pinto 001; Tarmo Uustalu (J. Log. Comput., 2018)

Decomposing Comonad Morphisms. - Danel Ahman; Tarmo Uustalu (CALCO, 2019)

Reordering Derivatives of Trace Closures of Regular Languages. - Hendrik Maarand; Tarmo Uustalu (CONCUR, 2019)

Modal Embeddings and Calling Paradigms. - José Espírito Santo; Luís Pinto 001; Tarmo Uustalu (FSCD, 2019)

Reordering Derivatives of Trace Closures of Regular Languages (Full Version). - Hendrik Maarand; Tarmo Uustalu (CoRR, 2019)

Certified normalization of generalized traces. - Hendrik Maarand; Tarmo Uustalu (Innov. Syst. Softw. Eng., 2019)

Quotienting the delay monad by weak bisimilarity. - James Chapman 001; Tarmo Uustalu; Niccolò Veltri (Math. Struct. Comput. Sci., 2019)

Algebraic and Coalgebraic Perspectives on Interaction Laws. - Tarmo Uustalu; Niels F. W. Voorneveld (APLAS, 2020)

Interaction Laws of Monads and Comonads. - Shin-ya Katsumata; Exequiel Rivas; Tarmo Uustalu (LICS, 2020)

Eilenberg-Kelly Reloaded. - Tarmo Uustalu; Niccolò Veltri; Noam Zeilberger (MFPS, 2020)

Degrading Lists. - Dylan McDermott; Maciej Piróg; Tarmo Uustalu (PPDP, 2020)

Deductive Systems and Coherence for Skew Prounital Closed Categories. - Tarmo Uustalu; Niccolò Veltri; Noam Zeilberger (LFMTP, 2020)

Proof Theory of Partially Normal Skew Monoidal Categories. - Tarmo Uustalu; Niccolò Veltri; Noam Zeilberger (ACT, 2020)

Operational semantics with semicommutations. - Hendrik Maarand; Tarmo Uustalu (J. Log. Algebraic Methods Program., 2021)

Sweedler Theory of Monads. - Dylan McDermott; Exequiel Rivas; Tarmo Uustalu (FoSSaCS, 2022)

A Type System with Subtyping for WebAssembly's Stack Polymorphism. - Dylan McDermott; Yasuaki Morita; Tarmo Uustalu (ICTAC, 2022)

Flexibly Graded Monads and Graded Algebras. - Dylan McDermott; Tarmo Uustalu (MPC, 2022)

Proof Theory of Skew Non-Commutative MILL. - Tarmo Uustalu; Niccolò Veltri; Cheng-Syuan Wan (NCL, 2022)

What Makes a Strong Monad? - Dylan McDermott; Tarmo Uustalu (MSFP@ETAPS, 2022)

Canonical Gradings of Monads. - Flavien Breuvart; Dylan McDermott; Tarmo Uustalu (ACT, 2022)

Plotkin's call-by-value λ-calculus as a modal calculus. - José Espírito Santo; Luís Pinto 001; Tarmo Uustalu (J. Log. Algebraic Methods Program., 2022)

Flexible presentations of graded monads. - Shin-ya Katsumata; Dylan McDermott; Tarmo Uustalu; Nicolas Wu (Proc. ACM Program. Lang., 2022)

Additive Cellular Automata Graded-Monadically. - Silvio Capobianco; Tarmo Uustalu (PPDP, 2023)

A Unifying Categorical View of Nondeterministic Iteration and Tests. - Sergey Goncharov 001; Tarmo Uustalu (CONCUR, 2024)

Concurrent monads for shared state. - Exequiel Rivas; Tarmo Uustalu (PPDP, 2024)