Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
Term 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.Read more
- 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
"My recommendation is that anyone interested in rewriting needs this book."
Frederic Loulergue for SIGACT News
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 2003
- format: Hardback
- isbn: 9780521391153
- length: 908 pages
- dimensions: 279 x 216 x 48 mm
- weight: 2.36kg
- contains: 273 b/w illus.
- availability: Available
Table of Contents
1. Abstract reduction systems
2. First-order term rewriting systems
3. Examples of TRSs and special rewriting formats
5. Properties of rewriting: decidability and modularity
7. Completion of equational specifications
8. Equivalence of reductions
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.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email email@example.com
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in