Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the proceedings of the Third International Conference on Algebra and Coalgebra in Computer Science, CALCO 2009, formed in 2005 by joining CMCS and WADT. This year the conference was held in Udine, Italy, September 7-10, 2009.

The 23 full papers were carefully reviewed and selected from 42 submissions. They are presented together with four invited talks and workshop papers from the CALCO-tools Workshop. The conference was divided into the following sessions: algebraic effects and recursive equations, theory of coalgebra, coinduction, bisimulation, stone duality, game theory, graph transformation, and software development techniques.

Author(s): Gordon Plotkin (auth.), Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)
Series: Lecture Notes in Computer Science 5728 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2009

Language: English
Pages: 457
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Discrete Mathematics in Computer Science; Symbolic and Algebraic Manipulation; Models and Principles; Computation by Abstract Devices

Front Matter....Pages -
Adequacy for Infinitary Algebraic Effects (Abstract)....Pages 1-2
Algebras for Parameterised Monads....Pages 3-17
Kleene Monads: Handling Iteration in a Framework of Generic Effects....Pages 18-33
Complete Iterativity for Algebras with Effects....Pages 34-48
Semantics of Higher-Order Recursion Schemes....Pages 49-63
Coalgebraic Components in a Many-Sorted Microcosm....Pages 64-80
Complementation of Coalgebra Automata....Pages 81-96
Characterising Behavioural Equivalence: Three Sides of One Coin....Pages 97-112
Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract)....Pages 113-126
Circular Coinduction: A Proof Theoretical Foundation....Pages 127-144
Approximating Labelled Markov Processes Again!....Pages 145-156
Weak Bisimilarity Coalgebraically....Pages 157-172
Coalgebraic Symbolic Semantics....Pages 173-190
Relating Coalgebraic Notions of Bisimulation....Pages 191-205
Traces, Executions and Schedulers, Coalgebraically....Pages 206-220
Non-strongly Stable Orders Also Define Interesting Simulation Relations....Pages 221-235
Stone Duality and the Recognisable Languages over an Algebra....Pages 236-250
Free Heyting Algebras: Revisited....Pages 251-266
Distributive Lattice-Structured Ontologies....Pages 267-283
A Duality Theorem for Real C * Algebras....Pages 284-299
Conway Games, Coalgebraically....Pages 300-316
A Semantical Approach to Equilibria and Rationality....Pages 317-334
Van Kampen Colimits as Bicolimits in Span....Pages 335-349
Unfolding Grammars in Adhesive Categories....Pages 350-366
Views on Behaviour Protocols and Their Semantic Foundation....Pages 367-382
Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation....Pages 383-397
Constructor-Based Institutions....Pages 398-412
DBtk : A Toolkit for Directed Bigraphs....Pages 413-422
Constraint-Muse: A Soft-Constraint Based System for Music Therapy....Pages 423-432
CIRC: A Behavioral Verification Tool Based on Circular Coinduction....Pages 433-442
The Priced-Timed Maude Tool....Pages 443-448
A Tool Proving Well-Definedness of Streams Using Termination Tools....Pages 449-456
Back Matter....Pages -