Coalgebraic Methods in Computer Science
Springer Berlin (Verlag)
978-3-662-44123-7 (ISBN)
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.
| Erscheint lt. Verlag | 1.9.2014 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 245 p. 4 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 397 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Automata • bisimulation • coalgebra functors • determinization • Higher Order Logic • Hypergraphs • Lambda Calculus • Modal Logics • Operational Semantics |
| ISBN-10 | 3-662-44123-3 / 3662441233 |
| ISBN-13 | 978-3-662-44123-7 / 9783662441237 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
