IST Austria Library

Algebra and coalgebra in computer science : first international conference, CALCO 2005, Swansea, UK, September 3-6, 2005 : proceedings / Jose Luiz Fiadeiro [and others] (eds.).

By: (1st : CALCO (Conference) (1st : 2005 : Swansea, Wales)
Contributor(s): Fiadeiro, José Luiz, 1961-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3629.Publisher: Berlin ; New York : Springer, ©2005Description: 1 online resource (xi, 455 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540318767; 3540318763; 3540286209; 9783540286202Other title: CALCO 2005Subject(s): 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èbreGenre/Form: Electronic books. | Conference papers and proceedings. | Kongress. | Swansea (2005) Additional physical formats: Print version:: Algebra and coalgebra in computer science.DDC classification: 004.01/512 LOC classification: QA76.9.M35 | C33 2005Other classification: 54.71 Online resources: Click here to access online
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.
Action note: digitized 2010 committed to preserve
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

 EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

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. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

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.

There are no comments for this item.

to post a comment.

Powered by Koha