Term Rewriting and All That

Front Cover
Cambridge University Press, Aug 5, 1999 - Computers - 301 pages
0 Reviews
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
VI
13
VII
16
VIII
18
IX
21
X
26
XI
28
XL
160
XLI
164
XLII
172
XLIII
178
XLIV
182
XLV
184
XLVI
187
XLIX
189

XII
33
XIII
34
XVI
47
XVII
49
XIX
58
XX
59
XXI
61
XXII
62
XXIII
65
XXIV
71
XXV
73
XXVI
79
XXVII
82
XXVIII
91
XXIX
93
XXX
101
XXXI
104
XXXII
111
XXXIII
131
XXXIV
134
XXXV
135
XXXVI
145
XXXVII
151
XXXVIII
157
XXXIX
158
L
193
LI
196
LII
198
LIII
200
LIV
202
LV
207
LVI
211
LVII
222
LVIII
223
LIX
224
LX
230
LXI
236
LXII
250
LXIII
262
LXIV
265
LXV
267
LXVI
269
LXVII
270
LXVIII
271
LXIX
273
LXX
276
LXXII
278
LXXIII
284
LXXIV
297
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information