Format:
1 online resource (xii, 301 pages)
ISBN:
9780521455206
,
9780521779203
,
9781139172752
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Additional Edition:
ISBN 9780521455206
Additional Edition:
ISBN 9780521779203
Additional Edition:
Baader, Franz, 1959 - Term rewriting and all that Cambridge [u.a.] : Cambridge Univ. Press, 1998 ISBN 0521779200
Additional Edition:
ISBN 9780521455206
Additional Edition:
ISBN 9780521779203
Additional Edition:
ISBN 0521455200
Additional Edition:
Print version ISBN 9780521455206
Language:
English
Subjects:
Computer Science
Keywords:
Termersetzungssystem
DOI:
10.1017/CBO9781139172752
Author information:
Nipkow, Tobias 1958-
Bookmarklink
