Term Rewriting Systems by Terese
Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Basic Proof Theory
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Concurrency Verification
-
Design Theory and Computer Science
-
Nets, Terms and Formulas
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
The Uncertain Reasoner's Companion
-
Deductive and Declarative Programming
-
Information Flow
-
Domains and Lambda-Calculi
-
Formal Semantics and Pragmatics for Natural Language Querying
'The book presents the state of the art of rewriting techniques, it gives (or scratches) proofs on a very precise level and gives hints to historical sources of the results and to further readings, so it is highly recommended to researchers working in this area' Zentralblatt für Mathematik
'… has extensive material … suffice it to say that this book is indispensable for a any serious student of rewriting.' Journal of TLP
'… it will soon be a compulsory reference for anyone working in the area.' Journal of Functional Programming
'… delivers what it promises - it will soon be a compulsory reference for anyone working in the area.' Stefan Kahrs, Journal of Functional Programming
'My recommendation is that anyone interested in rewriting needs this book.' Frederic Loulergue for SIGACT News
'… has extensive material … suffice it to say that this book is indispensable for a any serious student of rewriting.' Journal of TLP
'… it will soon be a compulsory reference for anyone working in the area.' Journal of Functional Programming
'… delivers what it promises - it will soon be a compulsory reference for anyone working in the area.' Stefan Kahrs, Journal of Functional Programming
'My recommendation is that anyone interested in rewriting needs this book.' Frederic Loulergue for SIGACT News
| SKU | Unavailable |
| ISBN 13 | 9780521391153 |
| ISBN 10 | 0521391156 |
| Title | Term Rewriting Systems |
| Author | Terese |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2003-03-20 |
| Number of pages | 908 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |