Abstract is missing.
- An Effect System for Algebraic Effects and HandlersAndrej Bauer, Matija Pretnar. 1-16 [doi]
- Automata and Algebras for Infinite Words and TreesMikolaj Bojanczyk. 17-18 [doi]
- Positive Inductive-Recursive DefinitionsNeil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg. 19-33 [doi]
- Coalgebraic Up-to TechniquesDamien Pous. 34-35 [doi]
- Exploiting Algebraic Laws to Improve Mechanized AxiomatizationsLuca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers. 36-50 [doi]
- Positive Fragments of Coalgebraic LogicsAdriana Balan, Alexander Kurz, Jiri Velebil. 51-65 [doi]
- Many-Valued Relation Lifting and Moss' Coalgebraic LogicMarta Bílková, Matej Dostál. 66-79 [doi]
- Saturated Semantics for Coalgebraic Logic ProgrammingFilippo Bonchi, Fabio Zanasi. 80-94 [doi]
- Presenting Distributive LawsMarcello M. Bonsangue, Helle Hvid Hansen, Alexander Kurz, Jurriaan Rot. 95-109 [doi]
- Interaction and Observation: Categorical Semantics of Reactive Systems Trough DialgebrasVincenzo Ciancia. 110-125 [doi]
- Homomorphisms of Coalgebras from Predicate LiftingsSebastian Enqvist. 126-140 [doi]
- From Kleisli Categories to Commutative C *-Algebras: Probabilistic Gelfand DualityRobert Furber, Bart Jacobs. 141-157 [doi]
- Trace Semantics via Generic ObservationsSergey Goncharov. 158-174 [doi]
- Full Abstraction for Fair Testing in CCSTom Hirschowitz. 175-190 [doi]
- A Simple Case of Rationality of EscalationPierre Lescanne. 191-204 [doi]
- Coalgebras with Symmetries and Modelling Quantum SystemsDaniel Marsden. 205-219 [doi]
- From Operational Chu Duality to Coalgebraic Quantum SymmetryYoshihiro Maruyama. 220-235 [doi]
- Noninterfering Schedulers - When Possibilistic Noninterference Implies Probabilistic NoninterferenceAndrei Popescu 0001, Johannes Hölzl, Tobias Nipkow. 236-252 [doi]
- Simulations and Bisimulations for Coalgebraic Modal LogicsDaniel Gorín, Lutz Schröder. 253-266 [doi]
- A Coalgebraic View of ε-TransitionsAlexandra Silva, Bram Westerbaan. 267-281 [doi]
- Nets, Relations and Linking DiagramsPawel Sobocinski. 282-298 [doi]
- A Logic-Programming Semantics of ServicesIonut Tutu, José Luiz Fiadeiro. 299-313 [doi]
- Preface to CALCO-ToolsLutz Schröder. 314 [doi]
- Checking Conservativity with HetsMihai Codescu, Till Mossakowski, Christian Maeder. 315-321 [doi]
- The HI-Maude ToolMuhammad Fadlisyah, Peter Csaba Ölveczky. 322-327 [doi]
- Constructor-Based Inductive Theorem ProverDaniel Gâinâ, Min Zhang 0002, Yuki Chiba, Yasuhito Arimoto. 328-333 [doi]
- A Timed CTL Model Checker for Real-Time MaudeDaniela Lepri, Erika Ábrahám, Peter Csaba Ölveczky. 334-339 [doi]
- Hybridisation at WorkRenato Neves, Alexandre Madeira, Manuel A. Martins, Luís Soares Barbosa. 340-345 [doi]
- Penrose: Putting Compositionality to Work for Petri Net ReachabilityPawel Sobocinski, Owen Stephens. 346-352 [doi]
- QStream: A Suite of StreamsJoost Winter. 353-358 [doi]