LEADER 04340nam  22007095  450 
001 996465551103316
005 20230406063931.0
024 7 $a10.1007/11548133
035   $a(CKB)1000000000213210
035   $a(SSID)ssj0000316127
035   $a(PQKBManifestationID)11247776
035   $a(PQKBTitleCode)TC0000316127
035   $a(PQKBWorkID)10262719
035   $a(PQKB)10492144
035   $a(DE-He213)978-3-540-31876-7
035   $a(MiAaPQ)EBC3067623
035   $a(PPN)123097088
035   $a(EXLCZ)991000000000213210
100   $a20100721d2005      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgebra and Coalgebra in Computer Science$b[electronic resource] $eFirst International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings /$fedited by José Luis Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (XII, 460 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3629
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-31876-3 
311   $a3-540-28620-9 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3629
606   $aComputer science
606   $aMachine theory
606   $aSoftware engineering
606   $aComputer science?Mathematics
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aSoftware Engineering
606   $aSymbolic and Algebraic Manipulation
615  0$aComputer science.
615  0$aMachine theory.
615  0$aSoftware engineering.
615  0$aComputer science?Mathematics.
615 14$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aSoftware Engineering.
615 24$aSymbolic and Algebraic Manipulation.
676   $a004.0151
702   $aFiadeiro$b José Luis$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHarman$b Neil$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRoggenbach$b Markus$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRutten$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465551103316
996   $aAlgebra and Coalgebra in Computer Science$9772274
997   $aUNISA