| Publication | Date of Publication | Type |
|---|
| Algebraic reasoning over relational structures | 2026-04-02 | Paper |
| Graded monads and behavioural equivalence games | 2024-12-06 | Paper |
| Positive data languages | 2024-12-03 | Paper |
| On Kripke, Vietoris and Hausdorff polynomial functors ((co)algebraic pearls) | 2024-11-26 | Paper |
| Higher-order mathematical operational semantics (early ideas) | 2024-11-26 | Paper |
| Nominal topology for data languages | 2024-11-14 | Paper |
| Monoidal extended stone duality | 2024-10-30 | Paper |
Initial algebras and terminal coalgebras. The theory of fixed points of functors (to appear)
Cambridge Tracts in Theoretical Computer Science | 2024-05-29 | Paper |
| Stateful structural operational semantics | 2024-05-27 | Paper |
| Generic partition refinement and weighted tree automata | 2024-03-14 | Paper |
Eilenberg's variety theorem without Boolean operations
Information and Computation | 2024-02-02 | Paper |
| Distributed coalgebraic partition refinement | 2024-02-01 | Paper |
Monads on Categories of Relational Structures.
(available as arXiv preprint) | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7774231 (Why is no real title available?) | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7730634 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
Nominal Büchi Automata with Name Allocation
(available as arXiv preprint) | 2023-08-21 | Paper |
A Linear-Time Nominal μ-Calculus with Name Allocation.
(available as arXiv preprint) | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7700633 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-23 | Paper |
| On Kripke, Vietoris and Hausdorff Polynomial Functors | 2023-03-20 | Paper |
| scientific article; zbMATH DE number 7649885 (Why is no real title available?) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7649944 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
Logical Methods in Computer Science | 2023-01-09 | Paper |
Reiterman’s Theorem on Finite Algebras for a Monad
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Coalgebraic semantics for nominal automata
(available as arXiv preprint) | 2022-12-07 | Paper |
| Towards a Higher-Order Mathematical Operational Semantics | 2022-10-24 | Paper |
scientific article; zbMATH DE number 7561623 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Finitary monads on the category of posets
Mathematical Structures in Computer Science | 2022-04-05 | Paper |
On the behaviour of coalgebras with side effects and algebras with effectful iteration
Journal Of Logic And Computation | 2021-10-21 | Paper |
Nondeterministic syntactic complexity
(available as arXiv preprint) | 2021-10-18 | Paper |
On language varieties without Boolean operations
(available as arXiv preprint) | 2021-10-04 | Paper |
From generic partition refinement to weighted tree automata minimization
Formal Aspects of Computing | 2021-09-14 | Paper |
| Guard your daggers and traces: on the equational properties of guarded (co-)recursion | 2021-06-10 | Paper |
Guard your daggers and traces: on the equational properties of guarded (co-)recursion
(available as arXiv preprint) | 2021-06-10 | Paper |
| On the specification of operations on the rational behaviour of systems | 2021-04-27 | Paper |
On the specification of operations on the rational behaviour of systems
(available as arXiv preprint) | 2021-04-27 | Paper |
| An Initial Algebra Theorem Without Iteration | 2021-04-20 | Paper |
| Behavioural Preorders via Graded Monads | 2020-11-29 | Paper |
On well-founded and recursive coalgebras
(available as arXiv preprint) | 2020-09-23 | Paper |
Toward a uniform theory of effectful state machines
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Toward a uniform theory of effectful state machines
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Efficient Coalgebraic Partition Refinement
(available as arXiv preprint) | 2020-05-27 | Paper |
Eilenberg Theorems for Free
(available as arXiv preprint) | 2020-05-26 | Paper |
A new foundation for finitary corecursion and iterative algebras
Information and Computation | 2020-03-12 | Paper |
A coalgebraic view on reachability
Commentationes Mathematicae Universitatis Carolinae | 2020-03-06 | Paper |
Efficient and modular coalgebraic partition refinement
(available as arXiv preprint) | 2020-02-05 | Paper |
Equational axiomatization of algebras with structure
(available as arXiv preprint) | 2020-01-28 | Paper |
On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration
(available as arXiv preprint) | 2019-11-14 | Paper |
| On finitary functors | 2019-11-14 | Paper |
On finitary functors
(available as arXiv preprint) | 2019-11-14 | Paper |
| Finitely presentable algebras for finitary monads | 2019-11-14 | Paper |
Finitely presentable algebras for finitary monads
(available as arXiv preprint) | 2019-11-14 | Paper |
On functors preserving coproducts and algebras with iterativity
Theoretical Computer Science | 2019-02-21 | Paper |
Generalized Eilenberg theorem. Varieties of languages in a category
ACM Transactions on Computational Logic | 2019-02-07 | Paper |
A Coalgebraic View on Reachability
(available as arXiv preprint) | 2019-01-30 | Paper |
Graded Monads and Graded Logics for the Linear Time -- Branching Time Spectrum
(available as arXiv preprint) | 2018-12-04 | Paper |
Predicate liftings and functor presentations in coalgebraic expression languages
(available as arXiv preprint) | 2018-10-23 | Paper |
| On algebras with effectful iteration | 2018-10-23 | Paper |
Proper functors and fixed points for finite behaviour
(available as arXiv preprint) | 2018-09-26 | Paper |
| Proper functors and their rational fixed point | 2018-08-13 | Paper |
On corecursive algebras for functors preserving coproducts
(available as arXiv preprint) | 2018-08-13 | Paper |
A categorical approach to syntactic monoids
(available as arXiv preprint) | 2018-05-30 | Paper |
Varieties of Languages in a Category
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Complete Elgot monads and coalgebraic resumptions
(available as arXiv preprint) | 2018-04-23 | Paper |
Guard your daggers and traces: properties of guarded (co-)recursion
Fundamenta Informaticae | 2017-11-10 | Paper |
Finitary corecursion for the infinitary lambda calculus
(available as arXiv preprint) | 2017-07-11 | Paper |
Syntactic monoids in a category
(available as arXiv preprint) | 2017-07-11 | Paper |
| Generic trace semantics and graded monads | 2017-07-11 | Paper |
| scientific article; zbMATH DE number 6740664 (Why is no real title available?) | 2017-07-07 | Paper |
Nominal automata with name binding
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Coproducts of monads on Set
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
Applied Categorical Structures | 2016-10-20 | Paper |
A new foundation for finitary corecursion. The locally finite fixpoint and its properties
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Profinite monads, profinite equations, and Reiterman's theorem
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Elgot theories: a new perspective of iteration theories (extended abstract)
Electronic Notes in Theoretical Computer Science | 2016-05-10 | Paper |
| Rational operational models | 2016-04-12 | Paper |
| A New Foundation for Finitary Corecursion | 2016-01-07 | Paper |
Coalgebraic constructions of canonical nondeterministic automata
Theoretical Computer Science | 2015-11-10 | Paper |
Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
Theoretical Computer Science | 2015-11-10 | Paper |
Sound and complete axiomatizations of coalgebraic language equivalence
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Canonical nondeterministic automata
Advanced Information Systems Engineering | 2015-09-11 | Paper |
How to Kill Epsilons with a Dagger
Advanced Information Systems Engineering | 2015-09-11 | Paper |
On final coalgebras of power-set functors and saturated trees
Applied Categorical Structures | 2015-08-03 | Paper |
Simplified coalgebraic trace equivalence
Software, Services, and Systems | 2015-06-22 | Paper |
On finitary functors and their presentations
Journal of Computer and System Sciences | 2015-04-28 | Paper |
Corecursive algebras, corecursive monads and Bloom monads
Logical Methods in Computer Science | 2014-09-30 | Paper |
Towards a Coalgebraic Chomsky Hierarchy
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Generalized Eilenberg theorem. I: Local varieties of languages
Lecture Notes in Computer Science | 2014-04-16 | Paper |
| scientific article; zbMATH DE number 6280315 (Why is no real title available?) | 2014-04-07 | Paper |
Base modules for parametrized iterativity
Theoretical Computer Science | 2014-02-04 | Paper |
| How iterative are iterative algebras? | 2013-12-04 | Paper |
How iterative reflections of monads are constructed
Information and Computation | 2013-11-29 | Paper |
| Elgot algebras (extended abstract) | 2013-10-08 | Paper |
Abstract GSOS rules and a modular treatment of recursive definitions
Logical Methods in Computer Science | 2013-10-01 | Paper |
| Iterative algebras for a base | 2013-09-20 | Paper |
| From iterative algebras to iterative theories (extended abstract) | 2013-09-11 | Paper |
Well-pointed coalgebras
Logical Methods in Computer Science | 2013-09-06 | Paper |
On rational monads and free iterative theories
Electronic Notes in Theoretical Computer Science | 2013-08-16 | Paper |
On iteratable endofunctors
Electronic Notes in Theoretical Computer Science | 2013-08-16 | Paper |
Final coalgebras and a solution theorem for arbitrary endofunctors
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
Recursive program schemes and context-free monads
Electronic Notes in Theoretical Computer Science | 2012-10-02 | Paper |
On Finitary Functors and Their Presentations
Coalgebraic Methods in Computer Science | 2012-09-20 | Paper |
| Power-set functors and saturated trees | 2012-09-18 | Paper |
A Coalgebraic Perspective on Minimization and Determinization
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Well-pointed coalgebras (extended abstract)
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Semantics of higher-order recursion schemes
Lecture Notes in Computer Science | 2012-06-01 | Paper |
Complete iterativity for algebras with effects
Algebra and Coalgebra in Computer Science | 2012-06-01 | Paper |
On second-order iterative monads
Theoretical Computer Science | 2011-09-22 | Paper |
From corecursive algebras to corecursive monads
Algebra and Coalgebra in Computer Science | 2011-09-02 | Paper |
Elgot theories: a new perspective on the equational properties of iteration
Mathematical Structures in Computer Science | 2011-06-10 | Paper |
Semantics of higher-order recursion schemes
Logical Methods in Computer Science | 2011-05-26 | Paper |
Equational properties of iterative monads
Information and Computation | 2011-01-14 | Paper |
Iterative reflections of monads
Mathematical Structures in Computer Science | 2010-06-02 | Paper |
CIA structures and the semantics of recursion
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
| scientific article; zbMATH DE number 5572668 (Why is no real title available?) | 2009-06-30 | Paper |
A Description of Iterative Reflections of Monads (Extended Abstract)
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Bases for parametrized iterativity
Information and Computation | 2009-03-04 | Paper |
On Algebras with Iteration
Journal Of Logic And Computation | 2008-12-22 | Paper |
What Are Iteration Theories?
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Corrigendum to: ``The category theoretic solution of recursive program schemes [Theoret. Comput. Sci. 366 (2006) 3-59]
Theoretical Computer Science | 2008-09-16 | Paper |
Recursive coalgebras of finitary functors
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Recursive coalgebras of finitary functors
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Recursive coalgebras of finitary functors
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
| Iterative algebras: how iterative are they? | 2008-03-31 | Paper |
| Iterative algebras: how iterative are they? | 2008-03-31 | Paper |
Algebras with parametrized iterativity
Theoretical Computer Science | 2007-12-18 | Paper |
Elgot Algebras
Logical Methods in Computer Science | 2007-10-11 | Paper |
Iterative algebras at work
Mathematical Structures in Computer Science | 2007-02-07 | Paper |
The category-theoretic solution of recursive program schemes
Theoretical Computer Science | 2007-01-09 | Paper |
Algebra and Coalgebra in Computer Science
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Terminal coalgebras and free iterative theories
Information and Computation | 2006-08-16 | Paper |
A general final coalgebra theorem
Mathematical Structures in Computer Science | 2005-08-03 | Paper |
Completely iterative algebras and completely iterative monads
Information and Computation | 2005-03-08 | Paper |
On coalgebra based on classes
Theoretical Computer Science | 2004-08-04 | Paper |
Some remarks on finitary and iterative monads
Applied Categorical Structures | 2004-01-06 | Paper |
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science | 2003-10-13 | Paper |
On colimits in categories of relations
Applied Categorical Structures | 2003-08-21 | Paper |
Infinite trees and completely iterative theories: A coalgebraic view
Theoretical Computer Science | 2003-07-30 | Paper |
