LEADER 06248nam 22008415 450 001 9910484370903321 005 20251226202943.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(BIP)27391615 035 $a(EXLCZ)991000000000784697 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebra and Coalgebra in Computer Science $eThird International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings /$fedited by Alexander Kurz, Marina Lenisa 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XI, 457 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5728 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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 -- ThePriced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools. 330 $aCALCO, the Conference on Algebra and Coalgebra in Computer Science, is a high-level, bi-annual conference formed by joining CMCS (the International WorkshoponCoalgebraicMethodsinComputerScience)andWADT(theWo- shoponAlgebraicDevelopmentTechniques).CALCObringstogetherresearchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer s- ence. The study of algebra and coalgebra relates to the data, process and str- tural aspects of software systems. CALCO is supervised by the Steering C- mittee, co-chaired by Josī e Luiz Fiadeiro and Jan Rutten. The ?rst two CALCO conferences took place in 2005 in Swansea, Wales, and in 2007 in Bergen, Norway. CALCO 2009, the third event in the series, took place in Udine, Italy, during September 7-10, 2009. CALCO 2009 received 42 submissions, out of which 23 were selected for presentationattheconference.Inspiteofarelativelylownumberofsubmissions, their standard was generally very high. The selection process was carried out by the Program Committee, taking into account the originality, quality and relevance of the material presented in each submission, based on the opinions of expert reviewers, four for each submission. The selected and revised papers are included in this volume, together with the contributions from the invited speakersMaiGehrke,ConorMcBride,PrakashPanangadenandGordonPlotkin. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5728 606 $aComputer science 606 $aMachine theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aModels of Computation 606 $aTheory of Computation 615 0$aComputer science. 615 0$aMachine theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aModels of Computation. 615 24$aTheory of Computation. 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