Tarmo Uustalu - RankMe

137 papers A* 2A 5B 24C 10Misc 4Journal 45Unranked 43

Year	Rank	Type	Title / Venue / Authors
2026	B	`ed.`	Automated Reasoning with Analytic Tableaux and Related Methods - 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27-29, 2025, Proceedings TABLEAUX Gian Luca Pozzato, Tarmo Uustalu
2025	—	`conf`	Monoid Structures on Indexed Containers. LSFA Michele De Pascalis, Tarmo Uustalu, Niccolò Veltri
2024	B	`conf`	A Unifying Categorical View of Nondeterministic Iteration and Tests. CONCUR Sergey Goncharov, Tarmo Uustalu
2024	J	`jnl`	A Unifying Categorical View of Nondeterministic Iteration and Tests. CoRR Sergey Goncharov, Tarmo Uustalu
2024	C	`conf`	Concurrent monads for shared state. PPDP Exequiel Rivas, Tarmo Uustalu
2023	C	`conf`	Additive Cellular Automata Graded-Monadically. PPDP Silvio Capobianco, Tarmo Uustalu
2022	C	`conf`	A Type System with Subtyping for WebAssembly's Stack Polymorphism. ICTAC Dylan McDermott, Yasuaki Morita, Tarmo Uustalu
2022	—	`conf`	Canonical Gradings of Monads. ACT Flavien Breuvart, Dylan McDermott, Tarmo Uustalu
2022	J	`jnl`	Flexible presentations of graded monads. Proc. ACM Program. Lang. Shin-ya Katsumata, Dylan McDermott, Tarmo Uustalu, Nicolas Wu
2022	B	`conf`	Flexibly Graded Monads and Graded Algebras. MPC Dylan McDermott, Tarmo Uustalu
2022	J	`jnl`	Plotkin's call-by-value J. Log. Algebraic Methods Program. José Espírito Santo, Luís Pinto, Tarmo Uustalu
2022	—	`conf`	Proof Theory of Skew Non-Commutative MILL. NCL Tarmo Uustalu, Niccolò Veltri, Cheng-Syuan Wan
2022	B	`conf`	Sweedler Theory of Monads. FoSSaCS Dylan McDermott, Exequiel Rivas, Tarmo Uustalu
2022	—	`conf`	What Makes a Strong Monad? MSFP@ETAPS Dylan McDermott, Tarmo Uustalu
2021	J	`jnl`	Operational semantics with semicommutations. J. Log. Algebraic Methods Program. Hendrik Maarand, Tarmo Uustalu
2020	B	`conf`	Algebraic and Coalgebraic Perspectives on Interaction Laws. APLAS Tarmo Uustalu, Niels F. W. Voorneveld
2020	—	`conf`	Deductive Systems and Coherence for Skew Prounital Closed Categories. LFMTP Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
2020	C	`conf`	Degrading Lists. PPDP Dylan McDermott, Maciej Piróg, Tarmo Uustalu
2020	B	`conf`	Eilenberg-Kelly Reloaded. MFPS Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
2020	A*	`conf`	Interaction Laws of Monads and Comonads. LICS Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu
2020	—	`conf`	Proof Theory of Partially Normal Skew Monoidal Categories. ACT Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
2020	J	`jnl`	The Sequent Calculus of Skew Monoidal Categories. CoRR Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
2019	J	`jnl`	Certified normalization of generalized traces. Innov. Syst. Softw. Eng. Hendrik Maarand, Tarmo Uustalu
2019	B	`conf`	Decomposing Comonad Morphisms. CALCO Danel Ahman, Tarmo Uustalu
2019	J	`jnl`	Interaction laws of monads and comonads. CoRR Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu
2019	B	`conf`	Modal Embeddings and Calling Paradigms. FSCD José Espírito Santo, Luís Pinto, Tarmo Uustalu
2019	J	`jnl`	Quotienting the delay monad by weak bisimilarity. Math. Struct. Comput. Sci. James Chapman, Tarmo Uustalu, Niccolò Veltri
2019	J	`jnl`	Reordering Derivatives of Trace Closures of Regular Languages (Full Version). CoRR Hendrik Maarand, Tarmo Uustalu
2019	B	`conf`	Reordering Derivatives of Trace Closures of Regular Languages. CONCUR Hendrik Maarand, Tarmo Uustalu
2018	—	`ed.`	21st International Conference on Types for Proofs and Programs, TYPES 2015, Tallinn, Estonia, May 18-21, 2015 TYPES Tarmo Uustalu
2018	J	`jnl`	A proof-theoretic study of bi-intuitionistic propositional sequent calculus. J. Log. Comput. Luís Pinto, Tarmo Uustalu
2018	—	`conf`	Certified Foata Normalization for Generalized Traces. NFM Hendrik Maarand, Tarmo Uustalu
2018	J	`jnl`	Codensity Lifting of Monads and its Dual. CoRR Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu
2018	J	`jnl`	Codensity Lifting of Monads and its Dual. Log. Methods Comput. Sci. Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu
2018	B	`conf`	The Sequent Calculus of Skew Monoidal Categories. MFPS Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger
2018	C	`ed.`	Theoretical Aspects of Computing - ICTAC 2018 - 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings ICTAC Bernd Fischer, Tarmo Uustalu
2017	—	`conf`	Container Combinatorics: Monads and Lax Monoidal Functors. TTCS Tarmo Uustalu
2017	J	`jnl`	Finiteness and rational sequences, constructively. J. Funct. Program. Tarmo Uustalu, Niccolò Veltri
2017	J	`jnl`	Formalizing Restriction Categories. J. Formaliz. Reason. James Chapman, Tarmo Uustalu, Niccolò Veltri
2017	—	`conf`	Generating Representative Executions [Extended Abstract]. PLACES@ETAPS Hendrik Maarand, Tarmo Uustalu
2017	B	`conf`	Partiality and Container Monads. APLAS Tarmo Uustalu, Niccolò Veltri
2017	—	`conf`	Taking Updates Seriously. BX@ETAPS Danel Ahman, Tarmo Uustalu
2017	C	`conf`	The Delay Monad and Restriction Categories. ICTAC Tarmo Uustalu, Niccolò Veltri
2016	B	`conf`	A Coalgebraic View of Bar Recursion and Bar Induction. FoSSaCS Venanzio Capretta, Tarmo Uustalu
2016	J	`jnl`	A divertimento on MonadPlus and nondeterminism. J. Log. Algebraic Methods Program. Tarmo Uustalu
2016	A	`conf`	Combining effects and coeffects via grading. ICFP Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu
2016	—	`conf`	Directed Containers as Categories. MSFP Danel Ahman, Tarmo Uustalu
2016	J	`jnl`	Guest editors' foreword. J. Log. Algebraic Methods Program. Tarmo Uustalu, Jüri Vain
2016	—	`conf`	Variations on Noetherianness. MSFP Denis Firsov, Tarmo Uustalu, Niccolò Veltri
2015	J	`jnl`	A Hoare logic for the coinductive trace-based big-step semantics of While. Log. Methods Comput. Sci. Keiko Nakata, Tarmo Uustalu
2015	B	`conf`	Certified Normalization of Context-Free Grammars. CPP Denis Firsov, Tarmo Uustalu
2015	—	`conf`	Dependently typed programming with finite sets. WGP@ICFP Denis Firsov, Tarmo Uustalu
2015	J	`jnl`	Monads need not be endofunctors. Log. Methods Comput. Sci. Thorsten Altenkirch, James Chapman, Tarmo Uustalu
2015	C	`conf`	Quotienting the Delay Monad by Weak Bisimilarity. ICTAC James Chapman, Tarmo Uustalu, Niccolò Veltri
2015	B	`conf`	Stateful Runners of Effectful Computations. MFPS Tarmo Uustalu
2014	J	`jnl`	Certified CYK parsing of context-free languages. J. Log. Algebraic Methods Program. Denis Firsov, Tarmo Uustalu
2014	B	`conf`	Coalgebraic Update Lenses. MFPS Danel Ahman, Tarmo Uustalu
2014	—	`conf`	Coherence for Skew-Monoidal Categories. MSFP Tarmo Uustalu
2014	J	`jnl`	Relative Monads Formalised. J. Formaliz. Reason. Thorsten Altenkirch, James Chapman, Tarmo Uustalu
2014	J	`jnl`	When is a container a comonad? Log. Methods Comput. Sci. Danel Ahman, James Chapman, Tarmo Uustalu
2013	A	`ed.`	ACM SIGPLAN International Conference on Functional Programming, ICFP'13, Boston, MA, USA - September 25 - 27, 2013 ICFP Greg Morrisett, Tarmo Uustalu
2013	B	`conf`	Certified Parsing of Regular Languages. CPP Denis Firsov, Tarmo Uustalu
2013	J	`jnl`	Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11). NII Shonan Meet. Rep. Ichiro Hasuo, Keiko Nakata, Tarmo Uustalu
2013	—	`conf`	Coinductive Big-Step Semantics for Concurrency. PLACES Tarmo Uustalu
2013	J	`jnl`	Preface. RAIRO Theor. Informatics Appl. Ralph Matthes, Tarmo Uustalu
2013	—	`conf`	Update Monads: Cointerpreting Directed Containers. TYPES Danel Ahman, Tarmo Uustalu
2012	Misc	`conf`	Explicit Binds: Effortless Efficiency with and without Trees. FLOPS Tarmo Uustalu
2012	J	`jnl`	On streams that are finitely red Log. Methods Comput. Sci. Marc Bezem, Keiko Nakata, Tarmo Uustalu
2012	—	`conf`	Structured general corecursion and coinductive graphs [extended abstract] FICS Tarmo Uustalu
2012	B	`conf`	When Is a Container a Comonad? FoSSaCS Danel Ahman, James Chapman, Tarmo Uustalu
2011	B	`conf`	A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS Keiko Nakata, Tarmo Uustalu, Marc Bezem
2010	J	`jnl`	A Categorical Outlook on Cellular Automata CoRR Silvio Capobianco, Tarmo Uustalu
2010	—	`conf`	A Categorical Outlook on Cellular Automata. JAC Silvio Capobianco, Tarmo Uustalu
2010	A	`conf`	A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. ESOP Keiko Nakata, Tarmo Uustalu
2010	—	`conf`	A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators. FICS Tarmo Uustalu
2010	—	`conf`	Antifounded Coinduction in Type Theory. PAR@ITP Tarmo Uustalu
2010	J	`jnl`	Guest Editors' Foreword. J. Log. Algebraic Methods Program. Tarmo Uustalu, Jüri Vain
2010	B	`conf`	Monads Need Not Be Endofunctors. FoSSaCS Thorsten Altenkirch, James Chapman, Tarmo Uustalu
2010	J	`jnl`	Preface. Fundam. Informaticae Thorsten Altenkirch, Tarmo Uustalu
2010	—	`conf`	Relating Sequent Calculi for Bi-intuitionistic Propositional Logic CL&C Luís Pinto, Tarmo Uustalu
2010	—	`conf`	Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction SOS Keiko Nakata, Tarmo Uustalu
2009	—	`ed.`	6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, September 12-13, 2009. FICS Ralph Matthes, Tarmo Uustalu
2009	C	`conf`	Bidirectional data-flow analyses, type-systematically. PEPM Maria João Frade, Ando Saabas, Tarmo Uustalu
2009	—	`conf`	Corecursive Algebras: A Study of General Structured Corecursion. SBMF Venanzio Capretta, Tarmo Uustalu, Varmo Vene
2009	J	`jnl`	Preface. J. Funct. Program. Conor McBride, Tarmo Uustalu
2009	J	`jnl`	Preface. Sci. Comput. Program. Tarmo Uustalu
2009	Misc	`conf`	Program Repair as Sound Optimization of Broken Programs. TASE Bernd Fischer, Ando Saabas, Tarmo Uustalu
2009	B	`conf`	Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. TABLEAUX Luís Pinto, Tarmo Uustalu
2009	J	`jnl`	Proof optimization for partial redundancy elimination. J. Log. Algebraic Methods Program. Ando Saabas, Tarmo Uustalu
2009	—	`conf`	Trace-Based Coinductive Operational Semantics for While. TPHOLs Keiko Nakata, Tarmo Uustalu
2008	—	`conf`	Comonadic Notions of Computation. CMCS Tarmo Uustalu, Varmo Vene
2008	J	`jnl`	Program and proof optimizations with type systems. J. Log. Algebraic Methods Program. Ando Saabas, Tarmo Uustalu
2008	C	`conf`	Proof optimization for partial redundancy elimination. PEPM Ando Saabas, Tarmo Uustalu
2008	—	`conf`	The Recursion Scheme from the Cofree Recursive Comonad. MSFP@ICALP Tarmo Uustalu, Varmo Vene
2007	J	`jnl`	A compositional natural semantics and Hoare logic for low-level languages. Theor. Comput. Sci. Ando Saabas, Tarmo Uustalu
2007	A*	`conf`	Categorical Views on Computations on Trees (Extended Abstract). ICALP Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
2007	Misc	`conf`	Foundational certification of data-flow analyses. TASE Maria João Frade, Ando Saabas, Tarmo Uustalu
2007	—	`conf`	Type Systems for Optimizing Stack-based Code. Bytecode@ETAPS Ando Saabas, Tarmo Uustalu
2006	—	`conf`	Compositional Type Systems for Stack-Based Low-Level Languages. CATS Ando Saabas, Tarmo Uustalu
2006	J	`jnl`	Explicit substitutions and higher-order syntax. High. Order Symb. Comput. Neil Ghani, Tarmo Uustalu, Makoto Hamana
2006	B	`ed.`	Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings MPC Tarmo Uustalu
2006	J	`jnl`	Recursive coalgebras from comonads. Inf. Comput. Venanzio Capretta, Tarmo Uustalu, Varmo Vene
2006	J	`jnl`	Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci. Peeter Laud, Tarmo Uustalu, Varmo Vene
2006	—	`ed.`	Workshop on Mathematically Structured Functional Programming, MSFP@MPC 2006, Kuressaare, Estonia, July 2, 2006. MSFP@MPC Conor McBride, Tarmo Uustalu
2005	—	`conf`	A Compositional Natural Semantics and Hoare Logic for Low-Level Languages. SOS@ICALP Ando Saabas, Tarmo Uustalu
2005	—	`ed.`	Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures Advanced Functional Programming Varmo Vene, Tarmo Uustalu
2005	—	`conf`	Comonadic functional attribute evaluation. Trends in Functional Programming Tarmo Uustalu, Varmo Vene
2005	J	`jnl`	Iteration and coiteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. Andreas Abel, Ralph Matthes, Tarmo Uustalu
2005	A	`conf`	Monadic augment and generalised short cut fusion. ICFP Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
2005	J	`jnl`	Signals and Comonads. J. Univers. Comput. Sci. Tarmo Uustalu, Varmo Vene
2005	B	`conf`	The Essence of Dataflow Programming. APLAS Tarmo Uustalu, Varmo Vene
2005	—	`conf`	The Essence of Dataflow Programming. CEFP Tarmo Uustalu, Varmo Vene
2004	B	`conf`	Build, Augment and Destroy, Universally. APLAS Neil Ghani, Tarmo Uustalu, Varmo Vene
2004	J	`jnl`	Coproducts of Ideal Monads. RAIRO Theor. Informatics Appl. Neil Ghani, Tarmo Uustalu
2004	—	`conf`	Generalizing the AUGMENT combinator. Trends in Functional Programming Neil Ghani, Tarmo Uustalu, Varmo Vene
2004	Misc	`conf`	Normalization by Evaluation for lambda FLOPS Thorsten Altenkirch, Tarmo Uustalu
2004	—	`conf`	Recursive Coalgebras from Comonads. CMCS Venanzio Capretta, Tarmo Uustalu, Varmo Vene
2004	J	`jnl`	Substitution in non-wellfounded syntax with variable binding. Theor. Comput. Sci. Ralph Matthes, Tarmo Uustalu
2004	J	`jnl`	Type-based termination of recursive definitions. Math. Struct. Comput. Sci. Gilles Barthe, Maria João Frade, Eduardo Giménez, Luís Pinto, Tarmo Uustalu
2003	—	`conf`	An Alternative Characterization of Complete Iterativeness (Extended Abstract). FICS Tarmo Uustalu, Varmo Vene
2003	—	`conf`	Coproducts of Ideal Monads (Extended Abstract). FICS Neil Ghani, Tarmo Uustalu
2003	—	`conf`	Explicit substitutions and higher-order syntax. MERLIN Neil Ghani, Tarmo Uustalu
2003	B	`conf`	Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. FoSSaCS Andreas Abel, Ralph Matthes, Tarmo Uustalu
2003	J	`jnl`	Generalizing Substitution. RAIRO Theor. Informatics Appl. Tarmo Uustalu
2003	—	`conf`	Substitution in Non-wellfounded Syntax with Variable Binding. CMCS Ralph Matthes, Tarmo Uustalu
2002	C	`conf`	CPS translating inductive and coinductive types. PEPM Gilles Barthe, Tarmo Uustalu
2002	—	`conf`	Generalizing substitution. FICS Tarmo Uustalu
2002	J	`jnl`	Least and greatest fixed points in intuitionistic natural deduction. Theor. Comput. Sci. Tarmo Uustalu, Varmo Vene
2002	—	`conf`	Monad Translating Inductive and Coinductive Types. TYPES Tarmo Uustalu
2001	—	`conf`	(Co)monads from inductive and coinductive types (Extended Abstract). APPIA-GULP-PRODE Tarmo Uustalu
2001	J	`jnl`	Recursion Schemes from Comonads. Nord. J. Comput. Tarmo Uustalu, Varmo Vene, Alberto Pardo
2001	—	`conf`	The Dual of Substitution is Redecoration. Scottish Functional Programming Workshop Tarmo Uustalu, Varmo Vene
1999	J	`jnl`	Mendler-Style Inductive Types, Categorically. Nord. J. Comput. Tarmo Uustalu, Varmo Vene
1999	J	`jnl`	Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically. Informatica Tarmo Uustalu, Varmo Vene
1993	—	`conf`	Constraint Satisfaction and Constraint Programming: A Brief Lead-In. NATO ASI CP Brian H. Mayoh, Enn Tyugu, Tarmo Uustalu
1993	—	`conf`	Higher-Order Functional Constraint Networks. NATO ASI CP Enn Tyugu, Tarmo Uustalu
1992	A	`conf`	Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach. ECOOP Tarmo Uustalu