Tarmo Uustalu

发表

Corecursive Algebras: A Study of General Structured Corecursion

Venanzio Capretta, Tarmo Uustalu, Varmo Vene, 2009, SBMF.

A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While

Tarmo Uustalu, Keiko Nakata, 2010, ESOP.

Normalization by Evaluation for lambda-2

Thorsten Altenkirch, Tarmo Uustalu, 2004, FLOPS.

A divertimento on MonadPlus and nondeterminism

Tarmo Uustalu, 2016, J. Log. Algebraic Methods Program..

Categorical Views on Computations on Trees (Extended Abstract)

Bart Jacobs, Tarmo Uustalu, Ichiro Hasuo, 2007, ICALP.

Program and proof optimizations with type systems

Tarmo Uustalu, Ando Saabas, 2008, J. Log. Algebraic Methods Program..

Comonadic Notions of Computation

Tarmo Uustalu, Varmo Vene, V. Vene, 2008, CMCS.

The Dual of Substitution is Redecoration

Tarmo Uustalu, Varmo Vene, 2001, Scottish Functional Programming Workshop.

Certification of Context-Free Grammar Algorithms

Tarmo Uustalu, Denis Firsov, Denis Firsov, 2016 .

(Co)monads from inductive and coinductive types (Extended Abstract)

Tarmo Uustalu, 2001, APPIA-GULP-PRODE.

Distributive laws of directed containers

Tarmo Uustalu, Danel Ahman, Tarmo Uustalu, 2013 .

Finiteness and rational sequences, constructively

Tarmo Uustalu, Niccolò Veltri, 2017, J. Funct. Program..

Categorical views on computations on trees

Bart Jacobs, Tarmo Uustalu, Ichiro Hasuo, 2007 .

Explicit substitutions and higher-order syntax

Tarmo Uustalu, Neil Ghani, 2003, MERLIN '03.

Combining effects and coeffects via grading

Marco Gaboardi, Tarmo Uustalu, Flavien Breuvart, 2016, ICFP.

The Sequent Calculus of Skew Monoidal Categories pdf

Tarmo Uustalu, Noam Zeilberger, Niccolò Veltri, 2018, MFPS.

Comonadic functional attribute evaluation

Tarmo Uustalu, Varmo Vene, 2005, Trends in Functional Programming.

Constraint Satisfaction and Constraint Programming: A Brief Lead-In

Enn Tyugu, Tarmo Uustalu, Brian H. Mayoh, 1993, NATO ASI CP.

On streams that are finitely red

Tarmo Uustalu, Marc Bezem, Keiko Nakata, 2012, Log. Methods Comput. Sci..

Certified normalization of generalized traces

Tarmo Uustalu, Hendrik Maarand, 2019, Innovations in Systems and Software Engineering.

Semantics of Grammars and Attributes via Initiality

Bart Jacobs, Tarmo Uustalu, 2007 .

Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically

Tarmo Uustalu, Varmo Vene, 1999, Informatica.

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Tarmo Uustalu, Greg Morrisett, 2013, ICFP 2013.

Structured general corecursion and coinductive graphs [extended abstract]

Tarmo Uustalu, 2012, FICS.

Proof optimization for partial redundancy elimination

Tarmo Uustalu, Ando Saabas, Tarmo Uustalu, 2008, PEPM '08.

Dependently typed programming with finite sets

Tarmo Uustalu, Denis Firsov, Denis Firsov, 2015, WGP@ICFP.

A Categorical Outlook on Cellular Automata

Tarmo Uustalu, Silvio Capobianco, 2010, JAC.

21st International Conference on Types for Proofs and Programs, TYPES 2015, May 18-21, 2015, Tallinn, Estonia

Tarmo Uustalu, 2018, TYPES.

A proof-theoretic study of bi-intuitionistic propositional sequent calculus

Luís Pinto, Tarmo Uustalu, 2018, J. Log. Comput..

Type-based termination of recursive definitions

Luís Pinto, Gilles Barthe, Tarmo Uustalu, 2004, Mathematical Structures in Computer Science.

Substitution in Non-wellfounded Syntax with Variable Binding

Ralph Matthes, Tarmo Uustalu, R. Matthes, 2003, CMCS.

Build, Augment and Destroy, Universally

Tarmo Uustalu, Varmo Vene, Neil Ghani, 2004, APLAS.

A Coalgebraic View of Bar Recursion and Bar Induction

Venanzio Capretta, Tarmo Uustalu, 2016, FoSSaCS.

Logics for Low-Level Code and Proof-Preserving Program Transformations. Loogikad madala taseme koodile ja tõestusi säilitavad programmiteisendused

Tarmo Uustalu, Enn Tõugu, 2008 .

Coalgebraic Update Lenses

Tarmo Uustalu, Danel Ahman, 2014, MFPS.

When Is a Container a Comonad?

Tarmo Uustalu, James Chapman, Danel Ahman, 2012, FoSSaCS.

Reordering Derivatives of Trace Closures of Regular Languages (Full Version) pdf

Tarmo Uustalu, Hendrik Maarand, 2019, CONCUR.

Monadic augment and generalised short cut fusion

Tarmo Uustalu, Varmo Vene, Patricia Johann, 2005, ICFP '05.

Generalized Iteration and Coiteration for Higher-Order Nested Datatypes

Ralph Matthes, Tarmo Uustalu, Andreas Abel, 2003, FoSSaCS.

Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach

Tarmo Uustalu, Tarmo Uustalu, 1992, ECOOP.

Generalizing the AUGMENT combinator

Tarmo Uustalu, Varmo Vene, Neil Ghani, 2004, Trends in Functional Programming.

A compositional natural semantics and Hoare logic for low-level languages

Tarmo Uustalu, Ando Saabas, 2007, Theor. Comput. Sci..

Explicit Binds: Effortless Efficiency with and without Trees

Tarmo Uustalu, 2012, FLOPS.

Coherence for Skew-Monoidal Categories

Tarmo Uustalu, 2014, MSFP.

Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents

Luís Pinto, Tarmo Uustalu, L. Pinto, 2009, TABLEAUX.

A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction

Tarmo Uustalu, Marc Bezem, Keiko Nakata, 2011, APLAS.

Certified Parsing of Regular Languages

Tarmo Uustalu, Denis Firsov, Denis Firsov, 2013, CPP.

A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators

Tarmo Uustalu, 2010, FICS.

The Essence of Dataflow Programming

Tarmo Uustalu, Varmo Vene, V. Vene, 2005, APLAS.

Interaction Laws of Monads and Comonads

Tarmo Uustalu, Exequiel Rivas, Shin-ya Katsumata, 2019, LICS.

Monads Need Not Be Endofunctors

Thorsten Altenkirch, Tarmo Uustalu, James Chapman, 2010, FoSSaCS.

Preface

Thorsten Altenkirch, Tarmo Uustalu, 2010, Fundam. Informaticae.

Variations on Noetherianness

Tarmo Uustalu, Denis Firsov, Niccolò Veltri, 2016, MSFP.

Modal Embeddings and Calling Paradigms

José Espírito Santo, Luís Pinto, Tarmo Uustalu, 2019, FSCD.

Compositional Type Systems for Stack-Based Low-Level Languages

Tarmo Uustalu, Ando Saabas, Tarmo Uustalu, 2006, CATS.

Partiality and Container Monads

Tarmo Uustalu, Niccolò Veltri, 2017, APLAS.

Recursive Coalgebras from Comonads

Venanzio Capretta, Tarmo Uustalu, Varmo Vene, 2004, CMCS.

Certification of Context-Free Grammar Algorithms. Kontekstivabade grammatikate algoritmide sertifitseerimine

Tarmo Uustalu, 2016 .

Iteration and coiteration schemes for higher-order and nested datatypes

Ralph Matthes, Tarmo Uustalu, Andreas Abel, 2005, Theor. Comput. Sci..

Proceedings of the 2006 international conference on Mathematically Structured Functional Programming

Tarmo Uustalu, Conor McBride, 2006 .

Program Repair as Sound Optimization of Broken Programs

Tarmo Uustalu, Ando Saabas, Bernd Fischer, 2009, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering.

Antifounded Coinduction in Type Theory

Tarmo Uustalu, 2010, PAR@ITP.

Formalizing Restriction Categories

Tarmo Uustalu, James Chapman, Niccolò Veltri, 2017, J. Formaliz. Reason..

The Essence of Dataflow Programming

Tarmo Uustalu, Varmo Vene, 2005, CEFP.

Proof optimization for partial redundancy elimination

Tarmo Uustalu, Ando Saabas, 2009, J. Log. Algebraic Methods Program..

Distributive laws of directed containers (Special issue : Advanced Programming Techniques for Construction of Robust, Generic and Evolutionary Programs)

Tarmo Uustalu, Danel Ahman, 2013 .

Certified CYK parsing of context-free languages

Tarmo Uustalu, Denis Firsov, 2014, J. Log. Algebraic Methods Program..

A Compositional Natural Semantics and Hoare Logic for Low-Level Languages

Tarmo Uustalu, Ando Saabas, 2006, Electron. Notes Theor. Comput. Sci..

Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11)

Tarmo Uustalu, Ichiro Hasuo, Keiko Nakata, 2013, NII Shonan Meet. Rep..

Certified Normalization of Context-Free Grammars

Tarmo Uustalu, Denis Firsov, 2015, CPP.

Taking Updates Seriously

Tarmo Uustalu, Danel Ahman, Tarmo Uustalu, 2017, BX@ETAPS.

Recursive Coalgebras from Comonads

Venanzio Capretta, Tarmo Uustalu, Varmo Vene, 2004, CMCS.

The Essence of Dataflow Programming (Short Version)

Tarmo Uustalu, Varmo Vene, 2005 .

Substitution in Non-wellfounded Syntax with Variable Binding

Ralph Matthes, Tarmo Uustalu, 2003, CMCS.

Directed Containers as Categories

Tarmo Uustalu, Danel Ahman, Tarmo Uustalu, 2016, MSFP.

Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings

Tarmo Uustalu, 2006, MPC.

Container Combinatorics: Monads and Lax Monoidal Functors

Tarmo Uustalu, 2017, TTCS.

Type Systems for Optimizing Stack-based Code

Tarmo Uustalu, Ando Saabas, 2007, Electron. Notes Theor. Comput. Sci..

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic

Luís Pinto, Tarmo Uustalu, 2010, CL&C.

Codensity Lifting of Monads and its Dual

Tarmo Uustalu, Tetsuya Sato, Shin-ya Katsumata, 2018, Log. Methods Comput. Sci..

Monad Translating Inductive and Coinductive Types

Tarmo Uustalu, 2002, TYPES.

Least and greatest fixed points in intuitionistic natural deduction

Tarmo Uustalu, Varmo Vene, 2002, Theor. Comput. Sci..

A Hoare logic for the coinductive trace-based big-step semantics of While

Tarmo Uustalu, Keiko Nakata, Keiko Nakata, 2010, Log. Methods Comput. Sci..

Preface

Ralph Matthes, Tarmo Uustalu, 2013, RAIRO Theor. Informatics Appl..

Type systems equivalent to data-flow analyses for imperative languages

Tarmo Uustalu, Varmo Vene, Peeter Laud, 2006, Theor. Comput. Sci..

Relative Monads Formalised

Thorsten Altenkirch, Tarmo Uustalu, James Chapman, 2014, J. Formaliz. Reason..

Recursion Schemes from Comonads

Tarmo Uustalu, Varmo Vene, Alberto Pardo, 2001, Nord. J. Comput..

Efektianalüüsidel põhinevate programmiteisenduste sertifitseerimine. Certification of effect-analysis based program transformations

Tarmo Uustalu, 2017 .

Foundational certification of data-flow analyses

Tarmo Uustalu, Ando Saabas, Maria João Frade, 2007, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07).

Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures

Tarmo Uustalu, Varmo Vene, 2005, Advanced Functional Programming.

Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction

Tarmo Uustalu, Keiko Nakata, 2010, SOS.

Generating Representative Executions [Extended Abstract]

Tarmo Uustalu, Hendrik Maarand, 2017, PLACES@ETAPS.

The Delay Monad and Restriction Categories

Tarmo Uustalu, Niccolò Veltri, 2017, ICTAC.

Certified Foata Normalization for Generalized Traces

Tarmo Uustalu, Hendrik Maarand, 2018, NFM.

Coproducts of Ideal Monads

Tarmo Uustalu, Neil Ghani, 2004, RAIRO Theor. Informatics Appl..

Proceedings of the 5th international conference on Advanced Functional Programming

Tarmo Uustalu, Varmo Vene, 2004 .

Quotienting the delay monad by weak bisimilarity

Tarmo Uustalu, James Chapman, Niccolò Veltri, 2019, Math. Struct. Comput. Sci..

Monads need not be endofunctors

Thorsten Altenkirch, Tarmo Uustalu, James Chapman, 2010, Log. Methods Comput. Sci..

Stateful Runners of Effectful Computations

Tarmo Uustalu, Tarmo Uustalu, 2015, MFPS.

CPS translating inductive and coinductive types

Gilles Barthe, Tarmo Uustalu, 2002, PEPM '02.

Normalization by evaluation for λ→2

Thorsten Altenkirch, Tarmo Uustalu, Thorsten Altenkirch, 2004 .

Higher-Order Functional Constraint Networks

Enn Tyugu, Tarmo Uustalu, 1993, NATO ASI CP.

Coinductive Big-Step Semantics for Concurrency

Tarmo Uustalu, 2013, PLACES.

Algebraic and Coalgebraic Perspectives on Interaction Laws

Tarmo Uustalu, Niels F. W. Voorneveld, Tarmo Uustalu, 2020, APLAS.

The Recursion Scheme from the Cofree Recursive Comonad

Tarmo Uustalu, Varmo Vene, 2011, Electron. Notes Theor. Comput. Sci..

When is a container a comonad?

Tarmo Uustalu, James Chapman, Danel Ahman, 2012, Log. Methods Comput. Sci..

Signals and Comonads

Tarmo Uustalu, Varmo Vene, 2005, J. Univers. Comput. Sci..

Quotienting the delay monad by weak bisimilarity

Tarmo Uustalu, James Chapman, Niccolò Veltri, 2015, Mathematical Structures in Computer Science.

Bidirectional data-flow analyses, type-systematically

Tarmo Uustalu, Ando Saabas, Maria João Frade, 2009, PEPM '09.

Trace-Based Coinductive Operational Semantics for While

Tarmo Uustalu, Keiko Nakata, 2009, TPHOLs.

Workshop on Mathematically Structured Functional Programming (MSFP 2006) - Index

Tarmo Uustalu, Conor McBride, 2006 .

Guest Editors' Foreword

Tarmo Uustalu, Jüri Vain, 2010, J. Log. Algebraic Methods Program..

Mendler-Style Inductive Types, Categorically

Tarmo Uustalu, Varmo Vene, V. Vene, 1999, Nord. J. Comput..

Operational Semantics of Weak Sequential Composition

Tarmo Uustalu, Hendrik Maarand, 2020 .

Generalizing Substitution

Tarmo Uustalu, 2002, RAIRO Theor. Informatics Appl..

Update Monads: Cointerpreting Directed Containers

Tarmo Uustalu, Danel Ahman, Tarmo Uustalu, 2013, TYPES.

Explicit substitutions and higher-order syntax

Makoto Hamana, Tarmo Uustalu, Neil Ghani, 2006, High. Order Symb. Comput..

Operational semantics with semicommutations

Tarmo Uustalu, Hendrik Maarand, 2021, J. Log. Algebraic Methods Program..

Proceedings of the 8th international conference on Mathematics of Program Construction

Tarmo Uustalu, 2006 .

Trace-Based Coinductive Operational Semantics for While Big-Step and Small-Step, Relational and Functional Styles

Tarmo Uustalu, Keiko Nakata, 2009 .

Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction

Tarmo Uustalu, 1998 .

Technical report supporting "Combining Effects and Coeffects via Grading"

Marco Gaboardi, Tarmo Uustalu, Flavien Breuvart, 2016 .

A Type-Theoretical Study of Nontermination

Tarmo Uustalu, James Chapman, Niccolò Veltri, 2017 .