Cambridge Catalog  
  • Your account
  • View basket
  • Help
Home > Catalog > Term Rewriting and All That
Term Rewriting and All That
Google Book Search

Search this book

AddThis

Details

  • 170 exercises
  • Page extent: 316 pages
  • Size: 247 x 174 mm
  • Weight: 0.51 kg
Add to basket

Paperback

 (ISBN-13: 9780521779203 | ISBN-10: 0521779200)

  • There was also a Hardback of this title but it is no longer available
  • Published August 1999

Manufactured on demand: supplied direct from the printer

$57.00 (P)

This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader and Nipkow cover all the basic material--abstract reduction systems, termination, confluence, completion, and combination problems--but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases, and Buchberger's algorithm. They present the main algorithms both informally and as programs in the functional language Standard ML (An appendix contains a quick and easy introduction to ML). Key chapters cover crucial algorithms such as unification and congruence closure in more depth and develop efficient Pascal programs. The book contains many examples and over 170 exercises. This is also an ideal reference book for professional researchers: results spread over many conference and journal articles are collected here in a unified notation, detailed proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.

Contents

Preface; 1. Motivating examples; 2. Abstract reduction systems; 3. Universal algebra; 4. Equational problems; 5. Termination; 6. Confluence; 7. Completion; 8. Gröbner bases and Buchberger's algorithm; 9. Combination problems; 10. Equational unification; 11. Extensions; Appendix 1. Ordered sets; Appendix 2. A bluffer's guide to ML; Bibliography; Index.

Reviews

"...it fills a gap by being the first textbook in English on this topic...The book is well written, clearly structured and contains proofs of all the theorems, including those of the undecidability of termination and of Kruskal's theorem." Mathematical Reviews

"...I am thoroughly impressed by this book." Computing Reviews

printer iconPrinter friendly version AddThis