This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers 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, Grobner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises (solutions available from firstname.lastname@example.org). This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.
'... a welcome and important addition to the library of any researcher interested in theoretical computer science. It provides a thorough grounding in the subject in a clear style, and gives plenty of indications of further directions, including an extensive bibliography'. The Computer Journal '... a well-balanced textbook ... presenting the subject in a unified and systematic manner.' H. Herre, Zentralblatt MATH '... a highly welcome addition to the literature on term rewriting ... It is very readable, well written and likeable book. it should be of great value to students and researchers alike.' Jan Willem Klop, Journal of Functioning Programming