| 2026 | CiE | Glivenko's Theorem Underneath Structure. | Riccardo Borsetto, Giulio Fellin, Tarmo Uustalu, Cheng-Syuan Wan |
| 2024 | CONCUR | A Unifying Categorical View of Nondeterministic Iteration and Tests. | Sergey Goncharov, Tarmo Uustalu |
| 2024 | PPDP | Concurrent monads for shared state. | Exequiel Rivas, Tarmo Uustalu |
| 2023 | PPDP | Additive Cellular Automata Graded-Monadically. | Silvio Capobianco, Tarmo Uustalu |
| 2022 | FOSSACS | Sweedler Theory of Monads. | Dylan McDermott, Exequiel Rivas, Tarmo Uustalu |
| 2022 | ICTAC | A Type System with Subtyping for WebAssembly's Stack Polymorphism. | Dylan McDermott, Yasuaki Morita, Tarmo Uustalu |
| 2022 | MPC | Flexibly Graded Monads and Graded Algebras. | Dylan McDermott, Tarmo Uustalu |
| 2020 | APLAS | Algebraic and Coalgebraic Perspectives on Interaction Laws. | Tarmo Uustalu, Niels F. W. Voorneveld |
| 2020 | LICS | Interaction Laws of Monads and Comonads. | Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu |
| 2020 | MFPS | Eilenberg-Kelly Reloaded. | Tarmo Uustalu, Niccol Veltri, Noam Zeilberger |
| 2020 | PPDP | Degrading Lists. | Dylan McDermott, Maciej Pirg, Tarmo Uustalu |
| 2019 | CALCO | Decomposing Comonad Morphisms. | Danel Ahman, Tarmo Uustalu |
| 2019 | CONCUR | Reordering Derivatives of Trace Closures of Regular Languages. | Hendrik Maarand, Tarmo Uustalu |
| 2017 | APLAS | Partiality and Container Monads. | Tarmo Uustalu, Niccol Veltri |
| 2017 | ICTAC | The Delay Monad and Restriction Categories. | Tarmo Uustalu, Niccol Veltri |
| 2016 | FOSSACS | A Coalgebraic View of Bar Recursion and Bar Induction. | Venanzio Capretta, Tarmo Uustalu |
| 2016 | ICFP | Combining effects and coeffects via grading. | Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu |
| 2015 | CPP | Certified Normalization of Context-Free Grammars. | Denis Firsov, Tarmo Uustalu |
| 2015 | ICFP | Dependently typed programming with finite sets. | Denis Firsov, Tarmo Uustalu |
| 2015 | ICTAC | Quotienting the Delay Monad by Weak Bisimilarity. | James Chapman, Tarmo Uustalu, Niccol Veltri |
| 2013 | CPP | Certified Parsing of Regular Languages. | Denis Firsov, Tarmo Uustalu |
| 2012 | FLOPS | Explicit Binds: Effortless Efficiency with and without Trees. | Tarmo Uustalu |
| 2012 | FOSSACS | When Is a Container a Comonad? | Danel Ahman, James Chapman, Tarmo Uustalu |
| 2011 | APLAS | A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. | Keiko Nakata, Tarmo Uustalu, Marc Bezem |
| 2010 | ESOP | A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. | Keiko Nakata, Tarmo Uustalu |
| 2010 | FOSSACS | Monads Need Not Be Endofunctors. | Thorsten Altenkirch, James Chapman, Tarmo Uustalu |
| 2010 | ITP | Antifounded Coinduction in Type Theory. | Tarmo Uustalu |
| 2009 | PEPM | Bidirectional data-flow analyses, type-systematically. | Maria Joo Frade, Ando Saabas, Tarmo Uustalu |
| 2009 | TABLEAUX | Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. | Lus Pinto, Tarmo Uustalu |
| 2009 | TASE | Program Repair as Sound Optimization of Broken Programs. | Bernd Fischer, Ando Saabas, Tarmo Uustalu |
| 2008 | PEPM | Proof optimization for partial redundancy elimination. | Ando Saabas, Tarmo Uustalu |
| 2007 | ICALP | Categorical Views on Computations on Trees (Extended Abstract). | Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu |
| 2007 | TASE | Foundational certification of data-flow analyses. | Maria Joo Frade, Ando Saabas, Tarmo Uustalu |
| 2005 | APLAS | The Essence of Dataflow Programming. | Tarmo Uustalu, Varmo Vene |
| 2005 | ICFP | Monadic augment and generalised short cut fusion. | Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene |
| 2004 | APLAS | Build, Augment and Destroy, Universally. | Neil Ghani, Tarmo Uustalu, Varmo Vene |
| 2004 | FLOPS | Normalization by Evaluation for lambda | Thorsten Altenkirch, Tarmo Uustalu |
| 2003 | FOSSACS | Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. | Andreas Abel, Ralph Matthes, Tarmo Uustalu |
| 2003 | ICFP | Explicit substitutions and higher-order syntax. | Neil Ghani, Tarmo Uustalu |
| 2002 | PEPM | CPS translating inductive and coinductive types. | Gilles Barthe, Tarmo Uustalu |
| 1992 | ECOOP | Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach. | Tarmo Uustalu |