Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings

Samson Abramsky (auth.), José Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten (eds.)3540286209, 9783540286202

This book constitutes the refereed proceedings of the First International Conference on Algebra and Coalgebra in Computer Science, CALCO 2005, held in Swansea, UK in September 2005. The biennial conference was created by joining the International Workshop on Coalgebraic Methods in Computer Science (CMCS) and the Workshop on Algebraic Development Techniques (WADT). It addresses two basic areas of application for algebras and coalgebras – as mathematical objects as well as their application in computer science.

The 25 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 62 submissions. The papers deal with the following subjects: automata and languages; categorical semantics; hybrid, probabilistic, and timed systems; inductive and coinductive methods; modal logics; relational systems and term rewriting; abstract data types; algebraic and coalgebraic specification; calculi and models of concurrent, distributed, mobile, and context-aware computing; formal testing and quality assurance; general systems theory and computational models (chemical, biological, etc); generative programming and model-driven development; models, correctness and (re)configuration of hardware/middleware/architectures; re-engineering techniques (program transformation); semantics of conceptual modelling methods and techniques; semantics of programming languages; validation and verification.

---

Table of contents :
Front Matter….Pages –
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories….Pages 1-29
Labels from Reductions: Towards a General Theory….Pages 30-50
Adequacy for Algebraic Effects with State….Pages 51-51
Bisimilarity Is Not Finitely Based over BPA with Interrupt….Pages 52-66
Algebra ∩ Coalgebra = Presheaves….Pages 67-82
Strong Splitting Bisimulation Equivalence….Pages 83-97
Complete Axioms for Stateless Connectors….Pages 98-113
On the Semantics of Coinductive Types in Martin-Löf Type Theory….Pages 114-126
Look: Simple Stochastic Relations Are Just, Well, Simple….Pages 127-141
Modelling Fusion Calculus using HD-Automata….Pages 142-156
An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL….Pages 157-174
Using Proofs by Coinduction to Find “Traditional” Proofs….Pages 175-193
From T -Coalgebras to Filter Structures and Transition Systems….Pages 194-212
Context-Free Languages via Coalgebraic Trace Semantics….Pages 213-231
Towards a Coalgebraic Semantics of the Ambient Calculus….Pages 232-246
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic….Pages 247-262
Ultrafilter Extensions for Coalgebras….Pages 263-277
Equational Logic of Recursive Program Schemes….Pages 278-292
The Category Theoretic Solution of Recursive Program Schemes….Pages 293-312
A Categorical Approach to Simulations….Pages 313-330
Behavioral Extensions of Institutions….Pages 331-347
Discrete Lawvere Theories….Pages 348-363
Final Semantics for Event-Pattern Reactive Programs….Pages 364-378
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing….Pages 379-394
Final Sequences and Final Coalgebras for Measurable Spaces….Pages 395-407
Bireachability and Final Multialgebras….Pages 408-423
Parametrized Exceptions….Pages 424-438
Property Preserving Redesign of Specifications….Pages 439-455
Back Matter….Pages –