|
|
|
|
LEADER |
03202nam a22005295i 4500 |
001 |
978-3-662-44124-4 |
003 |
DE-He213 |
005 |
20151030051352.0 |
007 |
cr nn 008mamaa |
008 |
140819s2014 gw | s |||| 0|eng d |
020 |
|
|
|a 9783662441244
|9 978-3-662-44124-4
|
024 |
7 |
|
|a 10.1007/978-3-662-44124-4
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA8.9-QA10.3
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a MAT018000
|2 bisacsh
|
072 |
|
7 |
|a COM051010
|2 bisacsh
|
082 |
0 |
4 |
|a 005.131
|2 23
|
245 |
1 |
0 |
|a Coalgebraic Methods in Computer Science
|h [electronic resource] :
|b 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers /
|c edited by Marcello M. Bonsangue.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2014.
|
300 |
|
|
|a X, 245 p. 4 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8446
|
505 |
0 |
|
|a Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) -- Generic Weakest Precondition Semantics from Monads Enriched with Order -- Coalgebraic Multigames -- How to Kill Epsilons with a Dagger -- On Coalgebras with Internal Moves -- A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics -- Coalgebraic Simulations and Congruences -- Dijkstra Monads in Monadic Computation -- Categories of Coalgebras with Monadic Homomorphisms -- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions -- Canonical Nondeterministic Automata -- Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra -- Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Models.
|
520 |
|
|
|a This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2014, colocated with ETAPS 2014, held in Grenoble, France, in April 2014. The 10 revised full papers were carefully reviewed and selected from 20 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Mathematical statistics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Probability and Statistics in Computer Science.
|
700 |
1 |
|
|a Bonsangue, Marcello M.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662441237
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8446
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-662-44124-4
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|