Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings / Edition 1by Jose Luis Fiadeiro
Pub. Date: 09/21/2005
Publisher: Springer Berlin Heidelberg
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).
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.
- Springer Berlin Heidelberg
- Publication date:
- Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #3629
- Edition description:
- Product dimensions:
- 6.00(w) x 9.20(h) x 1.10(d)
Table of Contents
Invited Talks.- Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories.- Labels from Reductions: Towards a General Theory.- Adequacy for Algebraic Effects with State.- Contributed Papers.- Bisimilarity Is Not Finitely Based over BPA with Interrupt.- Algebra Coalgebra = Presheaves.- Strong Splitting Bisimulation Equivalence.- Complete Axioms for Stateless Connectors.- On the Semantics of Coinductive Types in Martin-Löf Type Theory.- Look: Simple Shastic Relations Are Just, Well, Simple.- Modelling Fusion Calculus using HD-Automata.- An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL.- Using Proofs by Coinduction to Find “Traditional” Proofs.- From T-Coalgebras to Filter Structures and Transition Systems.- Context-Free Languages via Coalgebraic Trace Semantics.- Towards a Coalgebraic Semantics of the Ambient Calculus.- The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic.- Ultrafilter Extensions for Coalgebras.- Equational Logic of Recursive Program Schemes.- The Category Theoretic Solution of Recursive Program Schemes.- A Categorical Approach to Simulations.- Behavioral Extensions of Institutions.- Discrete Lawvere Theories.- Final Semantics for Event-Pattern Reactive Programs.- Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing.- Final Sequences and Final Coalgebras for Measurable Spaces.- Bireachability and Final Multialgebras.- Parametrized Exceptions.- Property Preserving Redesign of Specifications.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >