Coalgebraic Methods in Computer Science 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 – April 1, 2012, Revised Selected Papers / [electronic resource] :
edited by Dirk Pattinson, Lutz Schröder.
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
- VII, 259 p. 7 illus. online resource.
- Lecture Notes in Computer Science, 7399 0302-9743 ; .
- Lecture Notes in Computer Science, 7399 .
From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference -- Defining Context-Free Power Series Coalgebraically -- Relational Presheaves as Labelled Transition Systems -- On Finitary Functors and Their Presentations -- Structural Operational Semantics for Continuous State Probabilistic Processes -- Stream Automata Are Coalgebras -- Trace Semantics via Determinizatio -- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus -- Lax Extensions of Coalgebra Functors -- From Transitions to Executions -- Tracing the Man in the Middle in Monoidal Categories -- Permutations in Coinductive Graph Representation -- Internal Models for Coalgebraic Modal Logics.
This book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012, colocated with ETAPS 2012, held in Tallin, Estonia, in March/April 2012. The 10 revised full papers were carefully reviewed and selected from 23 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.
9783642327841
10.1007/978-3-642-32784-1 doi
Computer science.
Logic design.
Computer Science.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Logics and Meanings of Programs.
Probability and Statistics in Computer Science.
QA8.9-QA10.3
005.131
From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference -- Defining Context-Free Power Series Coalgebraically -- Relational Presheaves as Labelled Transition Systems -- On Finitary Functors and Their Presentations -- Structural Operational Semantics for Continuous State Probabilistic Processes -- Stream Automata Are Coalgebras -- Trace Semantics via Determinizatio -- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus -- Lax Extensions of Coalgebra Functors -- From Transitions to Executions -- Tracing the Man in the Middle in Monoidal Categories -- Permutations in Coinductive Graph Representation -- Internal Models for Coalgebraic Modal Logics.
This book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012, colocated with ETAPS 2012, held in Tallin, Estonia, in March/April 2012. The 10 revised full papers were carefully reviewed and selected from 23 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.
9783642327841
10.1007/978-3-642-32784-1 doi
Computer science.
Logic design.
Computer Science.
Mathematical Logic and Formal Languages.
Computation by Abstract Devices.
Logics and Meanings of Programs.
Probability and Statistics in Computer Science.
QA8.9-QA10.3
005.131