Tarmo Uustalu

From MaRDI portal
Person:235624

Available identifiers

zbMath Open uustalu.tarmoDBLPu/TarmoUustaluWikidataQ58895674 ScholiaQ58895674MaRDI QIDQ235624

List of research outcomes





PublicationDate of PublicationType
Proof theory of skew non-commutative \texttt{MILL}2025-01-09Paper
Canonical Gradings of Monads2024-03-05Paper
Sweedler theory of monads2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q60689352023-12-15Paper
A type system with subtyping for WebAssembly's stack polymorphism2023-07-28Paper
Flexibly graded monads and graded algebras2023-06-30Paper
Decomposing Comonad Morphisms.2023-02-03Paper
Reordering Derivatives of Trace Closures of Regular Languages.2023-02-03Paper
Partiality and Container Monads2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q50890202022-07-18Paper
Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus2022-05-25Paper
The sequent calculus of skew monoidal categories2022-05-03Paper
Eilenberg-Kelly reloaded2022-04-29Paper
Proof Theory of Partially Normal Skew Monoidal Categories2022-01-10Paper
The Sequent Calculus of Skew Monoidal Categories2021-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50138292021-12-02Paper
Directed Containers as Categories2021-12-02Paper
Operational semantics with semicommutations2021-08-03Paper
Algebraic and coalgebraic perspectives on interaction laws2021-07-08Paper
Coherence for Skew-Monoidal Categories2021-06-23Paper
https://portal.mardi4nfdi.de/entity/Q58547392021-03-17Paper
https://portal.mardi4nfdi.de/entity/Q49646992021-03-03Paper
https://portal.mardi4nfdi.de/entity/Q49639012021-02-24Paper
Interaction Laws of Monads and Comonads2021-01-21Paper
Deductive Systems and Coherence for Skew Prounital Closed Categories2021-01-11Paper
Formalizing Restriction Categories2019-09-18Paper
Relative Monads Formalised2019-09-18Paper
Quotienting the delay monad by weak bisimilarity2018-12-04Paper
Codensity Lifting of Monads and its Dual2018-11-02Paper
A proof-theoretic study of bi-intuitionistic propositional sequent calculus2018-09-28Paper
Container combinatorics: monads and lax monoidal functors2018-02-16Paper
The delay monad and restriction categories2017-11-03Paper
Finiteness and rational sequences, constructively2017-10-23Paper
Combining effects and coeffects via grading2017-05-10Paper
Update Monads: Cointerpreting Directed Containers2017-03-13Paper
Stateful runners of effectful computations2016-12-16Paper
A divertimento on MonadPlus and nondeterminism2016-12-15Paper
A Coalgebraic View of Bar Recursion and Bar Induction2016-06-10Paper
Coalgebraic update lenses2016-05-13Paper
Quotienting the Delay Monad by Weak Bisimilarity2016-02-25Paper
Monads need not be endofunctors2015-03-11Paper
A Hoare logic for the coinductive trace-based big-step semantics of While2015-02-19Paper
Certified Parsing of Regular Languages2015-01-13Paper
Monadic augment and generalised short cut fusion2015-01-06Paper
Certified CYK parsing of context-free languages2014-10-23Paper
When is a container a comonad?2014-09-05Paper
The Recursion Scheme from the Cofree Recursive Comonad2014-06-27Paper
Comonadic notions of computation2014-01-24Paper
A compositional natural semantics and Hoare logic for low-level languages2013-10-07Paper
Recursive coalgebras from comonads2013-09-11Paper
Substitution in non-wellfounded syntax with variable binding2013-08-23Paper
On streams that are finitely red2012-10-22Paper
When Is a Container a Comonad?2012-06-22Paper
A Categorical Outlook on Cellular Automata2010-12-03Paper
A Hoare logic for the coinductive trace-based big-step semantics of While2010-05-04Paper
Monads need not be endofunctors2010-04-27Paper
Corecursive algebras: a study of general structured corecursion2009-12-09Paper
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents2009-12-01Paper
Trace-Based Coinductive Operational Semantics for While2009-10-20Paper
Proof optimization for partial redundancy elimination2009-09-29Paper
The Essence of Dataflow Programming2009-01-15Paper
Program and proof optimizations with type systems2008-11-06Paper
Categorical Views on Computations on Trees (Extended Abstract)2007-11-28Paper
Functional and Logic Programming2007-09-25Paper
A compositional natural semantics and Hoare logic for low-level languages2007-04-19Paper
Type systems equivalent to data-flow analyses for imperative languages2007-01-09Paper
Explicit substitutions and higher-order syntax2006-11-17Paper
Programming Languages and Systems2006-10-20Paper
Recursive coalgebras from comonads2006-06-30Paper
Programming Languages and Systems2005-08-17Paper
Iteration and coiteration schemes for higher-order and nested datatypes2005-04-06Paper
Coproducts of Ideal Monads2005-03-21Paper
Substitution in non-wellfounded syntax with variable binding2005-01-11Paper
Generalizing Substitution2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44354762003-11-12Paper
https://portal.mardi4nfdi.de/entity/Q44178512003-07-30Paper
Least and greatest fixed points in intuitionistic natural deduction2002-03-03Paper
Recursion schemes from comonads2002-01-24Paper
Functional programming with apomorphisms (corecursion)2001-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49396212000-05-28Paper
https://portal.mardi4nfdi.de/entity/Q42671981999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q43124501994-12-04Paper
https://portal.mardi4nfdi.de/entity/Q43124551994-12-04Paper
https://portal.mardi4nfdi.de/entity/Q34873331990-01-01Paper

Research outcomes over time

This page was built for person: Tarmo Uustalu