1 option
Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings / edited by Alexander Kurz, Marina Lenisa.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5728.
- Theoretical Computer Science and General Issues ; 5728
- Language:
- English
- Subjects (All):
- Computer logic.
- Logic, Symbolic and mathematical.
- Computer science--Mathematics.
- Computer science.
- Computers.
- 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.
- Local Subjects:
- 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.
- Physical Description:
- 1 online resource (XI, 457 pages).
- Edition:
- First edition 2009.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
- System Details:
- text file PDF
- Contents:
- Algebraic Effects and Recursive Equations
- Adequacy for Infinitary Algebraic Effects (Abstract)
- Algebras for Parameterised Monads
- Kleene Monads: Handling Iteration in a Framework of Generic Effects
- Complete Iterativity for Algebras with Effects
- Semantics of Higher-Order Recursion Schemes
- Theory of Coalgebra
- Coalgebraic Components in a Many-Sorted Microcosm
- Complementation of Coalgebra Automata
- Characterising Behavioural Equivalence: Three Sides of One Coin
- Coinduction
- Let's See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract)
- Circular Coinduction: A Proof Theoretical Foundation
- Bisimulation
- Approximating Labelled Markov Processes Again!
- Weak Bisimilarity Coalgebraically
- Coalgebraic Symbolic Semantics
- Relating Coalgebraic Notions of Bisimulation
- Traces, Executions and Schedulers, Coalgebraically
- Non-strongly Stable Orders Also Define Interesting Simulation Relations
- Stone Duality
- Stone Duality and the Recognisable Languages over an Algebra
- Free Heyting Algebras: Revisited
- Distributive Lattice-Structured Ontologies
- A Duality Theorem for Real C * Algebras
- Game Theory
- Conway Games, Coalgebraically
- A Semantical Approach to Equilibria and Rationality
- Graph Transformation
- Van Kampen Colimits as Bicolimits in Span
- Unfolding Grammars in Adhesive Categories
- Software Development Techniques
- Views on Behaviour Protocols and Their Semantic Foundation
- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation
- Constructor-Based Institutions
- CALCO Tools Workshop
- DBtk: A Toolkit for Directed Bigraphs
- Constraint-Muse: A Soft-Constraint Based System for Music Therapy
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- The Priced-Timed Maude Tool
- A Tool Proving Well-Definedness of Streams Using Termination Tools.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-03741-2
- 9783642037412
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.