Algebra and Coalgebra in Computer Science [electronic resource] :First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings /
Contributor(s): Fiadeiro, José Luiz [editor.] | Harman, Neil [editor.] | Roggenbach, Markus [editor.] | Rutten, Jan [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 3629Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: XII, 460 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540318767.Subject(s): Computer science | Software engineering | Computers | Computer logic | Mathematical logic | Computer science -- Mathematics | Computer Science | Theory of Computation | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Software Engineering | Symbolic and Algebraic ManipulationOnline resources: Click here to access online
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.