LEADER 04076nam  2200673Ia 450 
001 9910484370903321
005 20200520144314.0
010   $a3-642-03741-0
024 7 $a10.1007/978-3-642-03741-2
035   $a(CKB)1000000000784697
035   $a(SSID)ssj0000316128
035   $a(PQKBManifestationID)11228958
035   $a(PQKBTitleCode)TC0000316128
035   $a(PQKBWorkID)10274780
035   $a(PQKB)11460486
035   $a(DE-He213)978-3-642-03741-2
035   $a(MiAaPQ)EBC3064590
035   $a(PPN)139955070
035   $a(EXLCZ)991000000000784697
100   $a20090914d2009      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aAlgebra and coalgebra in computer science $ethird international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings /$fAlexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)
205   $a1st ed. 2009.
210   $aBerlin ;$aHeidelberg $cSpringer-Verlag$d2009
215   $a1 online resource (XI, 457 p.) 
225 1 $aLecture notes in computer science,$x0302-9743 ;$v5728
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-03740-2 
320   $aIncludes bibliographical references and index.
327   $aAlgebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let?s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools.
410  0$aLecture notes in computer science ;$v5728.
606   $aAlgebra$xData processing
606   $aComputational complexity
606   $aComputer science
606   $aLogic design
615  0$aAlgebra$xData processing.
615  0$aComputational complexity.
615  0$aComputer science.
615  0$aLogic design.
676   $a004.0151
686   $aDAT 500f$2stub
686   $aDAT 702f$2stub
686   $aMAT 110f$2stub
686   $aSS 4800$2rvk
701   $aKurz$b Alexander$01759631
701   $aLenisa$b Marina$01759632
701   $aTarlecki$b Andrzej$01221270
712 12$aCALCO 2009
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484370903321
996   $aAlgebra and coalgebra in computer science$94198205
997   $aUNINA