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.
"synopsis" may belong to another edition of this title.
This is a unified and self-contained introduction to the field of term rewriting, a high-level method for describing the behaviour of computer programs and for automating mathematical computations and proofs. The main algorithms are presented both informally and as programs in the ML language. Many examples and over 170 exercises are provided; each chapter closes with a guide to the literature. This text can be used for advanced undergraduate courses or as a professional reference: it is the first time many of the results have been presented in book form.
"...it fills a gap by being the first textbook in English on this topic...The book is well written, clearly structured and contains proofs of all the theorems, including those of the undecidability of termination and of Kruskal's theorem." Mathematical Reviews
"...I am thoroughly impressed by this book." Computing Reviews
"About this title" may belong to another edition of this title.
US$ 2.64 shipping within U.S.A.
Destination, rates & speedsSeller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 701643-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2416190014673
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 701643
Quantity: Over 20 available
Seller: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condition: As New. Seller Inventory # ABE-1669102990890
Quantity: 1 available
Seller: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condition: As New. Seller Inventory # ABE-1679991119292
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521779203
Quantity: Over 20 available
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Paperback. Condition: new. Paperback. 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, Grobner 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 (solutions available from ). 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. 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, Grobner 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521779203
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 314 pages. 10.00x7.00x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0521779200
Quantity: 1 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 548. Seller Inventory # C9780521779203
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 701643-n
Quantity: Over 20 available