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.
- Comprehensive study from elementary to very advanced level
- Numerous exercises with selected solutions on the web
- Many applications and examples of real implementations
Read more
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
See more reviews
Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: March 2003
- format: Hardback
- isbn: 9780521391153
- length: 908 pages
- dimensions: 236 x 158 x 47 mm
- weight: 1.64kg
- 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
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.
Look Inside

General Resources

Resources

Find resources associated with this title

Back to resources home

Type	Name	Unlocked *	Format	Size

Showing of

This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

If you are having problems accessing these resources please contact [email protected].