1 option
Algebra and Coalgebra in Computer Science : First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings / edited by José Luis Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten.
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, 3629.
- Theoretical Computer Science and General Issues ; 3629
- Language:
- English
- Subjects (All):
- Computers.
- Computer logic.
- Logic, Symbolic and mathematical.
- Software engineering.
- Computer science--Mathematics.
- Computer science.
- Theory of Computation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Theory of Computation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XII, 460 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- 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 Stochastic 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-31876-7
- 9783540318767
- 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.