Term Rewriting and All That

Front Cover
Cambridge University Press, Aug 5, 1999 - Computers - 316 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
IV
13
V
16
VI
18
VII
21
VIII
26
IX
28
XXXVI
160
XXXVII
164
XXXVIII
172
XXXIX
178
XL
182
XLI
184
XLII
187
XLIII
189

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

Common terms and phrases

References to this book

All Book Search results »

About the author (1999)

Franz Baader is a Professor in the Institute of Theoretical Computer Science at TU Dresden.

Bibliographic information