Record ID | harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:855055936:4033 |
Source | harvard_bibliographic_metadata |
Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:855055936:4033?format=raw |
LEADER: 04033nam a22005055a 4500
001 013770082-2
005 20131004190653.0
008 130827s2013 gw | s ||0| 0|eng d
020 $a9783642402067
020 $a9783642402067
020 $a9783642402050
024 7 $a10.1007/978-3-642-40206-7$2doi
035 $a(Springer)9783642402067
040 $aSpringer
050 4 $aQA75.5-76.95
072 7 $aUY$2bicssc
072 7 $aUYA$2bicssc
072 7 $aCOM014000$2bisacsh
072 7 $aCOM031000$2bisacsh
082 04 $a004.0151$223
100 1 $aHeckel, Reiko,$eeditor.
245 10 $aAlgebra and Coalgebra in Computer Science :$b5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings /$cedited by Reiko Heckel, Stefan Milius.
264 1 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c2013.
300 $aXIV, 359 p. 29 illus.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v8089
505 0 $aInvited Talks -- An Effect System for Algebraic Effects and Handlers -- Automata and Algebras for Infinite Words and Trees -- Positive Inductive-Recursive Definitions -- Coalgebraic up-to techniques -- Contributed Papers -- Exploiting Algebraic Laws to Improve Mechanized Axiomatization -- Positive Fragments of Coalgebraic Logics -- Many-valued Relation Lifting and Moss' Coalgebraic Logic -- Saturated Semantics for Coalgebraic Logic Programming -- Presenting Distributive Laws -- Interaction and observation: categorical semantics of reactive systems trough dialgebras -- Homomorphisms of coalgebras from predicate liftings -- From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality -- Trace Semantics via Generic Observations -- Full abstraction for fair testing in CCS -- A simple case of rationality of escalation -- Coalgebras with Symmetries and Modelling Quantum Systems -- From Operational Chu Duality to Coalgebraic Quantum Symmetry -- Noninterfering Schedulers|When Possibilistic Noninterference Implies Probabilistic Noninterference -- Simulations and Bisimulations For Coalgebraic Modal Logics -- A Coalgebraic View of "-Transitions -- Nets, relations and linking diagrams -- A Logic-Programming Semantics of Services -- CALCO-Tools Workshop -- Preface to CALCO-Tools -- Checking Conservativity With Hets -- The HI-Maude Tool -- Constructor-based Inductive Theorem Prover -- A Timed CTL Model Checker for Real-Time Maude -- Hybridisation at Work -- Penrose: Putting Compositionality to Work For Petri Net Reachability -- QStream: A Suite of Streams.
520 $aThis book constitutes the refereed proceedings of the 5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, held in Warsaw, Poland, in September 2013. The 18 full papers presented together with 4 invited talks were carefully reviewed and selected from 33 submissions. The papers cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, system specification and verification, as well as corecursion in programming languages, and algebra and coalgebra in quantum computing. The book also includes 6 papers from the CALCO Tools Workshop, co-located with CALCO 2013 and dedicated to tools based on algebraic and/or coalgebraic principles.
650 20 $aSoftware engineering.
650 10 $aComputer science.
650 0 $aComputer science.
650 0 $aSoftware engineering.
650 0 $aInformation theory.
650 0 $aAlgebra$xData processing.
650 24 $aTheory of Computation.
650 24 $aQuantum Computing.
650 24 $aSymbolic and Algebraic Manipulation.
700 1 $aMilius, Stefan,$eeditor.
776 08 $iPrinted edition:$z9783642402050
830 0 $aLecture Notes in Computer Science ;$v8089.
988 $a20130904
906 $0VEN