Term Rewriting and All That - Softcover

Baader, Franz; Nipkow, Tobias

  • 4.11 out of 5 stars
    19 ratings by Goodreads
 
9780521779203: Term Rewriting and All That

Synopsis

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.

"synopsis" may belong to another edition of this title.

Book Description

This is a unified and self-contained introduction to the field of term rewriting, a high-level method for describing the behaviour of computer programs and for automating mathematical computations and proofs. The main algorithms are presented both informally and as programs in the ML language. Many examples and over 170 exercises are provided; each chapter closes with a guide to the literature. This text can be used for advanced undergraduate courses or as a professional reference: it is the first time many of the results have been presented in book form.

Review

"...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

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780521455206: Term Rewriting and All That

Featured Edition

ISBN 10:  0521455200 ISBN 13:  9780521455206
Publisher: Cambridge University Press, 1998
Hardcover