index - Coalgebraic Methods in Computer Science

Table of Contents
Coalgebraic Methods in Computer Science *Dirk Pattinson, Lutz Schröder (Eds.)*	Front Matter
From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference *Samson Abramsky, Jonathan Zvesper*	1-19
Defining Context-Free Power Series Coalgebraically *Marcello Bonsangue, Jan Rutten, Joost Winter*	20-39
Relational Presheaves as Labelled Transition Systems *Paweł Sobociński*	40-50
On Finitary Functors and Their Presentations *Jiří Adámek, Stefan Milius, Lawrence Moss*	51-70
Structural Operational Semantics for Continuous State Probabilistic Processes *Giorgio Bacci, Marino Miculan*	71-89
Stream Automata Are Coalgebras *Vincenzo Ciancia, Yde Venema*	90-108
Trace Semantics via Determinization *Bart Jacobs, Alexandra Silva, Ana Sokolova*	109-129
An Alpha-Corecursion Principle for the Infinitary Lambda Calculus *Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan Vries*	130-149
Lax Extensions of Coalgebra Functors *Johannes Marti, Yde Venema*	150-169
From Transitions to Executions *Eleftherios Matsikoudis, Edward Lee*	170-190
Tracing the Man in the Middle in Monoidal Categories *Dusko Pavlovic*	191-217
Permutations in Coinductive Graph Representation *Celia Picard, Ralph Matthes*	218-237
Internal Models for Coalgebraic Modal Logics *Toby Wilkinson*	238-258

Full Text Documents