Term Rewriting Systems
Term Rewriting Systems
$255.00
USDTerm rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background.
- Comprehensive study from elementary to very advanced level
- Numerous exercises with selected solutions on the web
- Many applications and examples of real implementations
Reviews & endorsements
‘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
Product details
April 2003Hardback
9780521391153
908 pages
236 × 158 × 47 mm
1.64kg
273 b/w illus.
Available
Table of Contents
- 1. Abstract reduction systems
- 2. First-order term rewriting systems
- 3. Examples of TRSs and special rewriting formats
- 4. Orthogonality
- 5. Properties of rewriting: decidability and modularity
- 6. Termination
- 7. Completion of equational specifications
- 8. Equivalence of reductions
- 9. Strategies
- 10. Lambda calculus
- 11. Higher order rewriting
- 12. Infinitary rewriting
- 13. Term graph rewriting
- 14. Advanced ARS theory
- 15. Rewriting based languages and systems
- 16. Mathematical background.
