VERY GOOD: This book is in very good condition, showing only slight signs of use and wear.
Product Details
Continued from the back cover: "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 efficient Pascal programs are developed. The book contains many examples and over 180 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, detailed proofs of almost all theorems are provided, and each chapter closes with a guide to the literature."
Chapters
Motivating Examples
Abstract Reduction Systems
Universal Algebra
Equational Problems
Termination
Confluence
Completion
Gröbner Bases and Buchberger's Algorithm
Combination Problems
Equational Unification
Extensions
Appendices
Ordered Sets
A Bluffer's Guide to ML
The textbook concludes with "Bibliography" and "Index."
