Term Rewriting and All That

Term Rewriting and All That

by Franz Baader, Tobias Nipkow, Baader Franz
     
 

View All Available Formats & Editions

ISBN-10: 0521779200

ISBN-13: 9780521779203

Pub. Date: 08/28/1999

Publisher: Cambridge University Press

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

Overview

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.

Product Details

ISBN-13:
9780521779203
Publisher:
Cambridge University Press
Publication date:
08/28/1999
Edition description:
New Edition
Pages:
316
Product dimensions:
6.85(w) x 9.72(h) x 0.67(d)

Table of 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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >