Algebra and coalgebra in computer science : first international conference, CALCO 2005, Swansea, UK, September 3-6, 2005 : proceedings /
Algebra and coalgebra in computer science : first international conference, CALCO 2005, Swansea, UK, September 3-6, 2005 : proceedings /
CALCO 2005
Jose Luiz Fiadeiro [and others] (eds.).
- Berlin ; New York : Springer, ©2005.
- 1 online resource (xi, 455 pages) : illustrations
- Lecture notes in computer science, 3629 0302-9743 ; .
- Lecture notes in computer science ; 3629. .
Includes bibliographical references and index.
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.
Use copy
Electronic reproduction.
[Place of publication not identified] :
HathiTrust Digital Library,
2010.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
http://purl.oclc.org/DLF/benchrepro0212
9783540318767 3540318763 3540286209 9783540286202
10.1007/11548133 doi
978-3-540-28620-2 Springer http://www.springerlink.com
Computer science--Mathematics--Congresses.
Algebra--Congresses.
Informatique--Mathématiques--Congrès.
Algèbre--Congrès.
COMPUTERS--Reference.
COMPUTERS--Machine Theory.
COMPUTERS--Computer Literacy.
COMPUTERS--Information Technology.
COMPUTERS--Data Processing.
COMPUTERS--Computer Science.
COMPUTERS--Hardware--General.
Informatique.
Algebra.
Computer science--Mathematics.
Algebra
Formale Methode
Koalgebra
Theoretische Informatik
Algèbre.
Mathématique discrète.
Coalgèbre.
Congress
Conference papers and proceedings.
Conference papers and proceedings.
Actes de congrès.
Kongress.
Swansea (2005)
QA76.9.M35 / C33 2005
004.01/512
Includes bibliographical references and index.
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.
Use copy
Electronic reproduction.
[Place of publication not identified] :
HathiTrust Digital Library,
2010.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
http://purl.oclc.org/DLF/benchrepro0212
9783540318767 3540318763 3540286209 9783540286202
10.1007/11548133 doi
978-3-540-28620-2 Springer http://www.springerlink.com
Computer science--Mathematics--Congresses.
Algebra--Congresses.
Informatique--Mathématiques--Congrès.
Algèbre--Congrès.
COMPUTERS--Reference.
COMPUTERS--Machine Theory.
COMPUTERS--Computer Literacy.
COMPUTERS--Information Technology.
COMPUTERS--Data Processing.
COMPUTERS--Computer Science.
COMPUTERS--Hardware--General.
Informatique.
Algebra.
Computer science--Mathematics.
Algebra
Formale Methode
Koalgebra
Theoretische Informatik
Algèbre.
Mathématique discrète.
Coalgèbre.
Congress
Conference papers and proceedings.
Conference papers and proceedings.
Actes de congrès.
Kongress.
Swansea (2005)
QA76.9.M35 / C33 2005
004.01/512