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

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
• Edizione: 1st ed. 2005.
• Descrizione fisica: 1 online resource (XII, 460 p.)
• Disciplina: 004.01/512
• Soggetto topico: Computer science; Machine theory; Software engineering; Computer science - Mathematics; Theory of Computation; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Software Engineering; Symbolic and Algebraic Manipulation
• Altri autori: FiadeiroJose Luiz <1961->
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Algebra and coalgebra in computer science
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910484914003321
• Lo trovi qui: Univ. Federico II
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 3629