Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Term Rewriting and All That

4.3/5 ( ratings)

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, Grobner bases, and Buchberger's algorithm. They present the main algorithms both informally and as programs in the functional language Standard 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.

Language: English

Pages: 316

Format: Paperback

Publisher: Cambridge University Press

Release: August 05, 1999

ISBN: 0521779200

ISBN 13: 9780521779203

Term Rewriting and All That

4.3/5 ( ratings)

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, Grobner bases, and Buchberger's algorithm. They present the main algorithms both informally and as programs in the functional language Standard 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.

Language: English

Pages: 316

Format: Paperback

Publisher: Cambridge University Press

Release: August 05, 1999

ISBN: 0521779200

ISBN 13: 9780521779203

More books from Tobias Nipkow

Concrete Semantics

3.4/5 ( ratings)

Isabelle/Hol: A Proof Assistant for Higher-Order Logic

3.5/5 ( ratings)

Formal Logical Methods for System Security and Correctness (Nato Science for Peace and Security) (Nato Science for Peace and Security)

3.5/5 ( ratings)

Theorem Proving in Higher Order Logics: 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings

3.5/5 ( ratings)

Rewriting Techniques and Applications: 9th International Conference, Rta-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings

3.5/5 ( ratings)

Isabelle

3.5/5 ( ratings)

Rate this book!

Write a review?