- Format
- Häftad (Paperback / softback)
- Språk
- Engelska
- Antal sidor
- 642
- Utgivningsdatum
- 2005-12-01
- Upplaga
- 2005 ed.
- Förlag
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Medarbetare
- Middeldorp, Aart (ed.), Oostrom, Vincent von (ed.), Raamsdonk, Femke van (ed.), Vrijer, Roel de (ed.)
- Illustrationer
- XVIII, 642 p.
- Dimensioner
- 234 x 156 x 34 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 1 Paperback / softback
- ISBN
- 9783540309116
- 917 g
Du kanske gillar
-
Life 3.0
Max Tegmark
HäftadProcesses, Terms and Cycles: Steps on the Road to Infinity
Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday
1598- 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 1767 krKundrecensioner
Har du läst boken? Sätt ditt betyg »Fler böcker av författarna
-
Automated Deduction - CADE-25
Amy P Felty, Aart Middeldorp
-
Rewriting Techniques and Applications
Aart Middeldorp
-
Functional and Logic Programming
Aart Middeldorp, Taisuke Sato
-
Logic for Programming, Artificial Intelligence, and Reasoning
Ken McMillan, Aart Middeldorp, Andrei Voronkov
Innehållsförteckning
The Spectra of Words.- On the Undecidability of Coherent Logic.- Loeb's Logic Meets the ?-Calculus.- A Characterisation of Weak Bisimulation Congruence.- Boehm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.- Explaining Constraint Programming.- Sharing in the Weak Lambda-Calculus.- Term Rewriting Meets Aspect-Oriented Programming.- Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes.- Primitive Rewriting.- Infinitary Rewriting: From Syntax to Semantics.- Reducing Right-Hand Sides for Termination.- Reduction Strategies for Left-Linear Term Rewriting Systems.- Higher-Order Rewriting: Framework, Confluence and Termination.- Timing the Untimed: Terminating Successfully While Being Conservative.- Confluence of Graph Transformation Revisited.- Compositional Reasoning for Probabilistic Finite-State Behaviors.- Finite Equational Bases in Process Algebra: Results and Open Questions.- Skew and ?-Skew Confluence and Abstract Boehm Semantics.- A Mobility Calculus with Local and Dependent Types.- Model Theory for Process Algebra.- Expression Reduction Systems and Extensions: An Overview.- Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.