Table of Contents
|
Coalgebraic Methods in Computer Science
Corina Cîrstea |
Front Matter |
Relating Structure and Power: Comonadic Semantics for Computational Resources
Samson Abramsky, Nihil Shah |
1-5 |
Coalgebraic Logics & Duality
Clemens Kupke |
6-12 |
Intuitionistic Podelski-Rybalchenko Theorem and Equivalence Between Inductive Definitions and Cyclic Proofs
Stefano Berardi, Makoto Tatsuta |
13-33 |
Undecidability of Equality for Codata Types
Ulrich Berger, Anton Setzer |
34-55 |
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann |
56-77 |
Long-Term Values in Markov Decision Processes, (Co)Algebraically
Frank Feys, Helle Hansen, Lawrence Moss |
78-99 |
(In)finite Trace Equivalence of Probabilistic Transition Systems
Alexandre Goy, Jurriaan Rot |
100-121 |
Steps and Traces
Bart Jacobs, Paul Levy, Jurriaan Rot |
122-143 |
On Algebras with Effectful Iteration
Stefan Milius, Jiří Adámek, Henning Urbat |
144-166 |
Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract)
Dusko Pavlovic, Muzamil Yahia |
167-189 |
Fibrational Bisimulations and Quantitative Reasoning
David Sprunger, Shin-Ya Katsumata, Jérémy Dubut, Ichiro Hasuo |
190-213 |
Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors
Natsuki Urabe, Ichiro Hasuo |
214-234 |
