Term rewriting and all that
Author(s)
Bibliographic Information
Term rewriting and all that
Cambridge University Press, 1998
Available at / 28 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 284-296) and index
Description and Table of Contents
Description
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, Groebner 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. 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.
Table of Contents
- Preface
- 1. Motivating examples
- 2. Abstract reduction systems
- 3. Universal algebra
- 4. Equational problems
- 5. Termination
- 6. Confluence
- 7. Completion
- 8. Groebner 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.
by "Nielsen BookData"
