Accepted CALCO Papers

  • Jiri Adamek, Stefan Milius and Larry Moss. Terminal Coalgebras for Finitary Functors
  • Kazuki Watanabe. Pareto Fronts for Compositionally Solving String Diagrams of Parity Games
  • Quentin Aristote. [(Co)Algebraic Pearl] Active learning of upward-closed sets of words
  • Ralph Sarkis and Fabio Zanasi. String Diagrams for Graded Monoidal Theories, with an Application to Imprecise Probability
  • Ana Sokolova and Harald Woracek. Cancellative Convex Semilattices (regular paper)
  • Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas and Henning Urbat. Stateful Mathematical Operational Semantics (Early Ideas)
  • Sergey Goncharov, Pouya Partow and Stelios Tsampas. From Abstract Higher-Order GSOS to Abstract Big-Step Semantics, Abstractly (Early ideas)
  • Nima Motamed, Nina Otter and Emily Roff. Coalgebraic Analysis of Social Systems (Early ideas)
  • Roberto Biondo, Davide Castelnovo and Fabio Gadducci. EGGs are adhesive! [Regular paper]
  • Gabriele Tedeschi. Verifying Quantum Protocols via Quantum Distributions [Early Ideas]
  • Ohad Kammar, Seo Jin Park and Sam Staton. Semantics for the coinductive structures in stochastic processes: Infinite product measures in quasi-Borel spaces (Early ideas)
  • Chris Purdy and Stefania Damato. Distributive Laws of Monadic Containers (Regular Paper)
  • Antonio Lorenzin and Fabio Zanasi. An Algebraic Approach to Moralisation and Triangulation of Probabilistic Graphical Models
  • Filippo Bonchi, Cipriano Junior Cioffo, Alessandro Di Giorgio and Elena Di Lavore. Tape Diagrams for Monoidal Monads (Regular paper)
  • Helle Hansen and Wolfgang Poiger. Safety and strong completeness via reducibility for many-valued coalgebraic dynamic logics (Regular Paper)
  • Elena Di Lavore and Mario Román. Graded Coalgebras of Monads for Continuous Dynamics (Early ideas)
  • Daniel Luckhardt, Harsh Beohar and Clemens Kupke. Expressivity of bisimulation pseudometrics over analytic state spaces (Regular paper)
  • Bálint Kocsis. A Categorical Framework for Testing Generalised Tree Automata (Early ideas submission)
  • Jade Master. Kan and Grothendieck Commute Together [Early Ideas]
  • Joe Moeller, Aaron Ames and Sebastien Mattenet. Lyapunov theory for coalgebras (early idea)
  • Alvin Tang and Dirk Pattinson. A Coinductive Representation of Computable Functions (Regular Paper)
  • Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot and Ruben Turkenburg. Trees in Coalgebra from Generalized Reachability ((Co)algebraic pearl)
  • Bart Jacobs and Márk Széles. Drawing and Recolouring [Regular paper]
  • Robin Jourde, Jonas Forster and Pouya Partow. (Abstract) GSOS for Trace Equivalence [Early Ideas]