Tarmo Uustalu

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 44

Top Venues

J. Log. Algebraic Methods Program.

CoRR

MFPS

Log. Methods Comput. Sci.

Publications

Sergey Goncharov, Tarmo Uustalu
A Unifying Categorical View of Nondeterministic Iteration and Tests. CONCUR (2024)
Sergey Goncharov, Tarmo Uustalu
A Unifying Categorical View of Nondeterministic Iteration and Tests. CoRR (2024)
Silvio Capobianco, Tarmo Uustalu
Additive Cellular Automata Graded-Monadically. PPDP (2023)
Flavien Breuvart, Dylan McDermott, Tarmo Uustalu
Canonical Gradings of Monads. ACT (2022)
Dylan McDermott, Exequiel Rivas, Tarmo Uustalu
Sweedler Theory of Monads. FoSSaCS (2022)
Dylan McDermott, Yasuaki Morita, Tarmo Uustalu
A Type System with Subtyping for WebAssembly's Stack Polymorphism. ICTAC (2022)
Shin-ya Katsumata, Dylan McDermott, Tarmo Uustalu, Nicolas Wu
Flexible presentations of graded monads. Proc. ACM Program. Lang. 6 (ICFP) (2022)
Tarmo Uustalu, Niccolò Veltri, Cheng-Syuan Wan
Proof Theory of Skew Non-Commutative MILL. NCL (2022)
Dylan McDermott, Tarmo Uustalu
Flexibly Graded Monads and Graded Algebras. MPC (2022)
Dylan McDermott, Tarmo Uustalu
What Makes a Strong Monad? MSFP@ETAPS (2022)
José Espírito Santo, Luís Pinto, Tarmo Uustalu
-calculus as a modal calculus. J. Log. Algebraic Methods Program. 127 (2022)
Hendrik Maarand, Tarmo Uustalu
Operational semantics with semicommutations. J. Log. Algebraic Methods Program. 121 (2021)
Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
Eilenberg-Kelly Reloaded. MFPS (2020)
Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
Proof Theory of Partially Normal Skew Monoidal Categories. ACT (2020)
Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
The Sequent Calculus of Skew Monoidal Categories. CoRR (2020)
Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu
Interaction Laws of Monads and Comonads. LICS (2020)
Tarmo Uustalu, Niels F. W. Voorneveld
Algebraic and Coalgebraic Perspectives on Interaction Laws. APLAS (2020)
Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
Deductive Systems and Coherence for Skew Prounital Closed Categories. LFMTP (2020)
Dylan McDermott, Maciej Piróg, Tarmo Uustalu
Degrading Lists. PPDP (2020)
Hendrik Maarand, Tarmo Uustalu
Reordering Derivatives of Trace Closures of Regular Languages (Full Version). CoRR (2019)
Danel Ahman, Tarmo Uustalu
Decomposing Comonad Morphisms. CALCO (2019)
José Espírito Santo, Luís Pinto, Tarmo Uustalu
Modal Embeddings and Calling Paradigms. FSCD (2019)
Hendrik Maarand, Tarmo Uustalu
Certified normalization of generalized traces. Innov. Syst. Softw. Eng. 15 (3-4) (2019)
James Chapman, Tarmo Uustalu, Niccolò Veltri
Quotienting the delay monad by weak bisimilarity. Math. Struct. Comput. Sci. 29 (1) (2019)
Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu
Interaction laws of monads and comonads. CoRR (2019)
Hendrik Maarand, Tarmo Uustalu
Reordering Derivatives of Trace Closures of Regular Languages. CONCUR (2019)
Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu
Codensity Lifting of Monads and its Dual. Log. Methods Comput. Sci. 14 (4) (2018)
Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
The Sequent Calculus of Skew Monoidal Categories. MFPS (2018)
Hendrik Maarand, Tarmo Uustalu
Certified Foata Normalization for Generalized Traces. NFM (2018)
Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu
Codensity Lifting of Monads and its Dual. CoRR (2018)
Luís Pinto, Tarmo Uustalu
A proof-theoretic study of bi-intuitionistic propositional sequent calculus. J. Log. Comput. 28 (1) (2018)
Hendrik Maarand, Tarmo Uustalu
Generating Representative Executions [Extended Abstract]. PLACES@ETAPS (2017)
James Chapman, Tarmo Uustalu, Niccolò Veltri
Formalizing Restriction Categories. J. Formaliz. Reason. 10 (1) (2017)
Tarmo Uustalu, Niccolò Veltri
Finiteness and rational sequences, constructively. J. Funct. Program. 27 (2017)
Danel Ahman, Tarmo Uustalu
Taking Updates Seriously. BX@ETAPS (2017)
Tarmo Uustalu
Container Combinatorics: Monads and Lax Monoidal Functors. TTCS (2017)
Tarmo Uustalu, Niccolò Veltri
Partiality and Container Monads. APLAS (2017)
Tarmo Uustalu, Niccolò Veltri
The Delay Monad and Restriction Categories. ICTAC (2017)
Danel Ahman, Tarmo Uustalu
Directed Containers as Categories. MSFP (2016)
Tarmo Uustalu, Jüri Vain
Guest editors' foreword. J. Log. Algebraic Methods Program. 85 (6) (2016)
Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu
Combining effects and coeffects via grading. ICFP (2016)
Denis Firsov, Tarmo Uustalu, Niccolò Veltri
Variations on Noetherianness. MSFP (2016)
Venanzio Capretta, Tarmo Uustalu
A Coalgebraic View of Bar Recursion and Bar Induction. FoSSaCS (2016)
Tarmo Uustalu
A divertimento on MonadPlus and nondeterminism. J. Log. Algebraic Methods Program. 85 (5) (2016)
Denis Firsov, Tarmo Uustalu
Certified Normalization of Context-Free Grammars. CPP (2015)
Tarmo Uustalu
Stateful Runners of Effectful Computations. MFPS (2015)
James Chapman, Tarmo Uustalu, Niccolò Veltri
Quotienting the Delay Monad by Weak Bisimilarity. ICTAC (2015)
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
Monads need not be endofunctors. Log. Methods Comput. Sci. 11 (1) (2015)
Denis Firsov, Tarmo Uustalu
Dependently typed programming with finite sets. WGP@ICFP (2015)
Keiko Nakata, Tarmo Uustalu
A Hoare logic for the coinductive trace-based big-step semantics of While. Log. Methods Comput. Sci. 11 (1) (2015)
Danel Ahman, Tarmo Uustalu
Coalgebraic Update Lenses. MFPS (2014)
Danel Ahman, James Chapman, Tarmo Uustalu
When is a container a comonad? Log. Methods Comput. Sci. 10 (3) (2014)
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
Relative Monads Formalised. J. Formaliz. Reason. 7 (1) (2014)
Tarmo Uustalu
Coherence for Skew-Monoidal Categories. MSFP (2014)
Denis Firsov, Tarmo Uustalu
Certified CYK parsing of context-free languages. J. Log. Algebraic Methods Program. 83 (5-6) (2014)
Ralph Matthes, Tarmo Uustalu
Preface. RAIRO Theor. Informatics Appl. 47 (1) (2013)
Denis Firsov, Tarmo Uustalu
Certified Parsing of Regular Languages. CPP (2013)
Ichiro Hasuo, Keiko Nakata, Tarmo Uustalu
Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11). NII Shonan Meet. Rep. 2013 (2013)
Tarmo Uustalu
Coinductive Big-Step Semantics for Concurrency. PLACES (2013)
Danel Ahman, Tarmo Uustalu
Update Monads: Cointerpreting Directed Containers. TYPES (2013)
Danel Ahman, James Chapman, Tarmo Uustalu
When Is a Container a Comonad? FoSSaCS (2012)
Tarmo Uustalu
Explicit Binds: Effortless Efficiency with and without Trees. FLOPS (2012)
Tarmo Uustalu
Structured general corecursion and coinductive graphs [extended abstract] FICS (2012)
Marc Bezem, Keiko Nakata, Tarmo Uustalu
On streams that are finitely red Log. Methods Comput. Sci. 8 (4) (2012)
Keiko Nakata, Tarmo Uustalu, Marc Bezem
A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS (2011)
Tarmo Uustalu, Varmo Vene
The Recursion Scheme from the Cofree Recursive Comonad. Electron. Notes Theor. Comput. Sci. 229 (5) (2011)
Silvio Capobianco, Tarmo Uustalu
A Categorical Outlook on Cellular Automata. JAC (2010)
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
Monads Need Not Be Endofunctors. FoSSaCS (2010)
Tarmo Uustalu
Antifounded Coinduction in Type Theory. PAR@ITP (2010)
Tarmo Uustalu
A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators. FICS (2010)
Luís Pinto, Tarmo Uustalu
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic CL&C (2010)
Keiko Nakata, Tarmo Uustalu
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. ESOP (2010)
Tarmo Uustalu, Jüri Vain
Guest Editors' Foreword. J. Log. Algebraic Methods Program. 79 (7) (2010)
Keiko Nakata, Tarmo Uustalu
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction SOS (2010)
Silvio Capobianco, Tarmo Uustalu
A Categorical Outlook on Cellular Automata CoRR (2010)
Thorsten Altenkirch, Tarmo Uustalu
Preface. Fundam. Informaticae 102 (2) (2010)
Luís Pinto, Tarmo Uustalu
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. TABLEAUX (2009)
Bernd Fischer, Ando Saabas, Tarmo Uustalu
Program Repair as Sound Optimization of Broken Programs. TASE (2009)
Ando Saabas, Tarmo Uustalu
Proof optimization for partial redundancy elimination. J. Log. Algebraic Methods Program. 78 (7) (2009)
Conor McBride, Tarmo Uustalu
Preface. J. Funct. Program. 19 (3-4) (2009)
Tarmo Uustalu
Preface. Sci. Comput. Program. 74 (8) (2009)
Maria João Frade, Ando Saabas, Tarmo Uustalu
Bidirectional data-flow analyses, type-systematically. PEPM (2009)
Keiko Nakata, Tarmo Uustalu
Trace-Based Coinductive Operational Semantics for While. TPHOLs (2009)
Venanzio Capretta, Tarmo Uustalu, Varmo Vene
Corecursive Algebras: A Study of General Structured Corecursion. SBMF (2009)
Ando Saabas, Tarmo Uustalu
Program and proof optimizations with type systems. J. Log. Algebraic Methods Program. 77 (1-2) (2008)
Ando Saabas, Tarmo Uustalu
Proof optimization for partial redundancy elimination. PEPM (2008)
Tarmo Uustalu, Varmo Vene
Comonadic Notions of Computation. CMCS (2008)
Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
Categorical Views on Computations on Trees (Extended Abstract). ICALP (2007)
Maria João Frade, Ando Saabas, Tarmo Uustalu
Foundational certification of data-flow analyses. TASE (2007)
Ando Saabas, Tarmo Uustalu
Type Systems for Optimizing Stack-based Code. Electron. Notes Theor. Comput. Sci. 190 (1) (2007)
Ando Saabas, Tarmo Uustalu
A compositional natural semantics and Hoare logic for low-level languages. Theor. Comput. Sci. 373 (3) (2007)
Ando Saabas, Tarmo Uustalu
Compositional Type Systems for Stack-Based Low-Level Languages. CATS (2006)
Peeter Laud, Tarmo Uustalu, Varmo Vene
Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci. 364 (3) (2006)
Venanzio Capretta, Tarmo Uustalu, Varmo Vene
Recursive coalgebras from comonads. Inf. Comput. 204 (4) (2006)
Neil Ghani, Tarmo Uustalu, Makoto Hamana
Explicit substitutions and higher-order syntax. High. Order Symb. Comput. 19 (2-3) (2006)
Ando Saabas, Tarmo Uustalu
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages. Electron. Notes Theor. Comput. Sci. 156 (1) (2006)
Andreas Abel, Ralph Matthes, Tarmo Uustalu
Iteration and coiteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. 333 (1-2) (2005)
Tarmo Uustalu, Varmo Vene
Signals and Comonads. J. Univers. Comput. Sci. 11 (7) (2005)
Tarmo Uustalu, Varmo Vene
Comonadic functional attribute evaluation. Trends in Functional Programming (2005)
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
Monadic augment and generalised short cut fusion. ICFP (2005)

Tarmo Uustalu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tarmo Uustalu