- Format
- Häftad (Paperback / softback)
- Språk
- Engelska
- Antal sidor
- 451
- Utgivningsdatum
- 2013-02-20
- Upplaga
- 2013 ed.
- Förlag
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Medarbetare
- Pfenning, Frank (ed.)
- Illustratör/Fotograf
- 51 schwarz-weiße Abbildungen
- Illustrationer
- 51 Illustrations, black and white; XXIV, 451 p. 51 illus.
- Dimensioner
- 234 x 156 x 24 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 1 Paperback / softback
- ISBN
- 9783642370748
- 663 g
Du kanske gillar
-
Life 3.0
Max Tegmark
HäftadFoundations of Software Science and Computation Structures
16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings
852- Skickas inom 7-10 vardagar.
- Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även somPassar bra ihop
De som köpt den här boken har ofta också köpt Tomorrow, And Tomorrow, And Tomorrow av Gabrielle Zevin (häftad).
Köp båda 2 för 1021 krKundrecensioner
Har du läst boken? Sätt ditt betyg »Fler böcker av Frank Pfenning
-
Generative Programming and Component Engineering
Frank Pfenning, Yannis Smaragdakis
-
Term Rewriting and Applications
Frank Pfenning
-
Logic Programming and Automated Reasoning
Frank Pfenning
-
Automated Deduction - CADE-21
Frank Pfenning
Innehållsförteckning
Pattern Graphs and Rule-Based Models: The Semantics of Kappa.- History-Register Automata.- Fatal Attractors in Parity Games.- On Unique Decomposition of Processes in the Applied -Calculus.- Bounded Context-Switching and Reentrant Locking.- Reachability of Communicating Timed Processes.- Modular Bisimulation Theory for Computations and Values.- Checking Bisimilarity for Attributed Graph Transformation.- Comodels and Effects in Mathematical Operational Semantics.- Preorders on Monads and Coalgebraic Simulations.- A Proof System for Compositional Verification of Probabilistic Concurrent Processes.- Partiality and Recursion in Higher-Order Logic.- Some Sahlqvist Completeness Results for Coalgebraic Logics.- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics.- On Monadic Parametricity of Second-Order Functionals.- Deconstructing General References via Game Semantics.- Separation Logic for Non-local Control Flow and Block Scope Variables.- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.- Deciding Definability by Deterministic Regular Expressions.- Type-Based Complexity Analysis for Fork Processes.- Pure Pointer Programs and Tree Isomorphism.- A Language for Differentiable Functions.- Computing Quantiles in Markov Reward Models.- Parameterized Weighted Containment.- Weighted Specifications over Nested Words.- An Algebraic Presentation of Predicate Logic.- Strategies as Profunctors.- Generalised Name Abstraction for Nominal Sets.