| Publication | Date of Publication | Type |
|---|
| Proof theory of skew non-commutative \texttt{MILL} | 2025-01-09 | Paper |
Canonical Gradings of Monads
Electronic Proceedings in Theoretical Computer Science | 2024-03-05 | Paper |
Sweedler theory of monads
Lecture Notes in Computer Science | 2024-01-23 | Paper |
scientific article; zbMATH DE number 7779295 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-15 | Paper |
| scientific article; zbMATH DE number 7779295 (Why is no real title available?) | 2023-12-15 | Paper |
A type system with subtyping for WebAssembly's stack polymorphism
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Flexibly graded monads and graded algebras
Lecture Notes in Computer Science | 2023-06-30 | Paper |
| Decomposing Comonad Morphisms. | 2023-02-03 | Paper |
| Reordering Derivatives of Trace Closures of Regular Languages. | 2023-02-03 | Paper |
Partiality and Container Monads
Programming Languages and Systems | 2022-12-09 | Paper |
| scientific article; zbMATH DE number 7559284 (Why is no real title available?) | 2022-07-18 | Paper |
Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus
Journal of Logical and Algebraic Methods in Programming | 2022-05-25 | Paper |
| The sequent calculus of skew monoidal categories | 2022-05-03 | Paper |
| Eilenberg-Kelly reloaded | 2022-04-29 | Paper |
| Proof Theory of Partially Normal Skew Monoidal Categories | 2022-01-10 | Paper |
Proof Theory of Partially Normal Skew Monoidal Categories
(available as arXiv preprint) | 2022-01-10 | Paper |
The sequent calculus of skew monoidal categories
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics | 2021-12-08 | Paper |
The sequent calculus of skew monoidal categories
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics | 2021-12-08 | Paper |
| Variations on Noetherianness | 2021-12-02 | Paper |
Variations on Noetherianness
(available as arXiv preprint) | 2021-12-02 | Paper |
| Directed containers as categories | 2021-12-02 | Paper |
Directed containers as categories
(available as arXiv preprint) | 2021-12-02 | Paper |
Operational semantics with semicommutations
Journal of Logical and Algebraic Methods in Programming | 2021-08-03 | Paper |
| Algebraic and coalgebraic perspectives on interaction laws | 2021-07-08 | Paper |
| Coherence for skew-monoidal categories | 2021-06-23 | Paper |
Coherence for skew-monoidal categories
(available as arXiv preprint) | 2021-06-23 | Paper |
| Structured general corecursion and coinductive graphs (extended abstract) | 2021-03-17 | Paper |
Structured general corecursion and coinductive graphs (extended abstract)
(available as arXiv preprint) | 2021-03-17 | Paper |
| Relating sequent calculi for bi-intuitionistic propositional logic | 2021-03-03 | Paper |
Relating sequent calculi for bi-intuitionistic propositional logic
(available as arXiv preprint) | 2021-03-03 | Paper |
| Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction | 2021-02-24 | Paper |
Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction
(available as arXiv preprint) | 2021-02-24 | Paper |
Interaction laws of monads and comonads
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Deductive Systems and Coherence for Skew Prounital Closed Categories | 2021-01-11 | Paper |
| Formalizing Restriction Categories | 2019-09-18 | Paper |
| Relative monads formalised | 2019-09-18 | Paper |
Quotienting the delay monad by weak bisimilarity
Mathematical Structures in Computer Science | 2018-12-04 | Paper |
Codensity lifting of monads and its dual
(available as arXiv preprint) | 2018-11-02 | Paper |
A proof-theoretic study of bi-intuitionistic propositional sequent calculus
Journal Of Logic And Computation | 2018-09-28 | Paper |
| Container combinatorics: monads and lax monoidal functors | 2018-02-16 | Paper |
| The delay monad and restriction categories | 2017-11-03 | Paper |
Finiteness and rational sequences, constructively
Journal of Functional Programming | 2017-10-23 | Paper |
Combining effects and coeffects via grading
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
| Update monads: cointerpreting directed containers | 2017-03-13 | Paper |
| Stateful runners of effectful computations | 2016-12-16 | Paper |
A divertimento on MonadPlus and nondeterminism
Journal of Logical and Algebraic Methods in Programming | 2016-12-15 | Paper |
A coalgebraic view of bar recursion and bar induction
Lecture Notes in Computer Science | 2016-06-10 | Paper |
| Coalgebraic update lenses | 2016-05-13 | Paper |
Quotienting the delay monad by weak bisimilarity
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Monads need not be endofunctors
Logical Methods in Computer Science | 2015-03-11 | Paper |
A Hoare logic for the coinductive trace-based big-step semantics of While
Logical Methods in Computer Science | 2015-02-19 | Paper |
Certified parsing of regular languages
Certified Programs and Proofs | 2015-01-13 | Paper |
Monadic augment and generalised short cut fusion
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming | 2015-01-06 | Paper |
Certified CYK parsing of context-free languages
Journal of Logical and Algebraic Methods in Programming | 2014-10-23 | Paper |
When is a container a comonad?
Logical Methods in Computer Science | 2014-09-05 | Paper |
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science | 2014-06-27 | Paper |
Comonadic notions of computation
Electronic Notes in Theoretical Computer Science | 2014-01-24 | Paper |
| A compositional natural semantics and Hoare logic for low-level languages | 2013-10-07 | Paper |
| Recursive coalgebras from comonads | 2013-09-11 | Paper |
| Substitution in non-wellfounded syntax with variable binding | 2013-08-23 | Paper |
On streams that are finitely red
Logical Methods in Computer Science | 2012-10-22 | Paper |
When is a container a comonad?
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
| A Categorical Outlook on Cellular Automata | 2010-12-03 | Paper |
A Hoare logic for the coinductive trace-based big-step semantics of While
Programming Languages and Systems | 2010-05-04 | Paper |
Monads need not be endofunctors
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Corecursive algebras: a study of general structured corecursion
Lecture Notes in Computer Science | 2009-12-09 | Paper |
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Trace-Based Coinductive Operational Semantics for While
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Proof optimization for partial redundancy elimination
The Journal of Logic and Algebraic Programming | 2009-09-29 | Paper |
The Essence of Dataflow Programming
Central European Functional Programming School | 2009-01-15 | Paper |
Program and proof optimizations with type systems
The Journal of Logic and Algebraic Programming | 2008-11-06 | Paper |
Categorical Views on Computations on Trees (Extended Abstract)
Automata, Languages and Programming | 2007-11-28 | Paper |
Functional and Logic Programming
Lecture Notes in Computer Science | 2007-09-25 | Paper |
A compositional natural semantics and Hoare logic for low-level languages
Theoretical Computer Science | 2007-04-19 | Paper |
Type systems equivalent to data-flow analyses for imperative languages
Theoretical Computer Science | 2007-01-09 | Paper |
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation | 2006-11-17 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Recursive coalgebras from comonads
Information and Computation | 2006-06-30 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Iteration and coiteration schemes for higher-order and nested datatypes
Theoretical Computer Science | 2005-04-06 | Paper |
Coproducts of Ideal Monads
RAIRO - Theoretical Informatics and Applications | 2005-03-21 | Paper |
Coproducts of Ideal Monads
RAIRO - Theoretical Informatics and Applications | 2005-03-21 | Paper |
Coproducts of Ideal Monads
RAIRO - Theoretical Informatics and Applications | 2005-03-21 | Paper |
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science | 2005-01-11 | Paper |
Generalizing Substitution
RAIRO - Theoretical Informatics and Applications | 2004-03-29 | Paper |
Generalizing Substitution
RAIRO - Theoretical Informatics and Applications | 2004-03-29 | Paper |
Generalizing Substitution
RAIRO - Theoretical Informatics and Applications | 2004-03-29 | Paper |
| scientific article; zbMATH DE number 2003163 (Why is no real title available?) | 2003-11-12 | Paper |
| scientific article; zbMATH DE number 1956505 (Why is no real title available?) | 2003-07-30 | Paper |
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science | 2002-03-03 | Paper |
Recursion schemes from comonads
Nordic Journal of Computing | 2002-01-24 | Paper |
Functional programming with apomorphisms (corecursion)
Proceedings of the Estonian Academy of Sciences. Physics, Mathematics | 2001-05-09 | Paper |
| scientific article; zbMATH DE number 1400097 (Why is no real title available?) | 2000-05-28 | Paper |
| scientific article; zbMATH DE number 1343506 (Why is no real title available?) | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 683335 (Why is no real title available?) | 1994-12-04 | Paper |
| scientific article; zbMATH DE number 683339 (Why is no real title available?) | 1994-12-04 | Paper |
| scientific article; zbMATH DE number 4160713 (Why is no real title available?) | 1990-01-01 | Paper |
