Term Rewriting and All That

Franz Baader, Tobias Nipkow

ISBN 10: 0521779200 / ISBN 13: 9780521779203

Edité par Cambridge University Press, GB, 1999

A propos de cet article

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, Gröbner 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.

N° de réf. du vendeur LU-9780521779203

Détails bibliographiques

• Titre: Term Rewriting and All That
• Éditeur: Cambridge University Press, GB
• Date de parution: 1999
• Langue: anglais
• ISBN à 10 chiffres: 0521779200
• ISBN à 13 chiffres: 9780521779203
• Reliure: Paperback
• État de l'article: New

A propos de ce titre

Synopsis

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, Gröbner 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.