Term Rewriting and All That

Front Cover
Cambridge University Press, Aug 5, 1999 - Computers - 301 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

II
1
III
7
IV
13
V
16
VI
18
VII
21
VIII
26
IX
28
XXXV
160
XXXVI
164
XXXVII
172
XXXVIII
178
XXXIX
182
XL
184
XLI
187
XLII
189

X
33
XI
34
XII
47
XIII
49
XIV
58
XV
59
XVI
61
XVII
62
XVIII
65
XIX
71
XX
73
XXI
79
XXII
82
XXIII
91
XXIV
93
XXV
101
XXVI
104
XXVII
111
XXVIII
131
XXIX
134
XXX
135
XXXI
145
XXXII
151
XXXIII
157
XXXIV
158
XLIII
193
XLIV
196
XLV
198
XLVI
200
XLVII
202
XLVIII
207
XLIX
211
L
222
LI
223
LII
224
LIII
230
LIV
236
LV
250
LVI
262
LVII
265
LVIII
267
LIX
269
LX
270
LXI
271
LXII
273
LXIII
276
LXIV
278
LXV
284
LXVI
297
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information