Unified and self-contained introduction to term-rewriting; suited for students or professionals.
"synopsis" may belong to another edition of this title.
'... a welcome and important addition to the library of any researcher interested in theoretical computer science. It provides a thorough grounding in the subject in a clear style, and gives plenty of indications of further directions, including an extensive bibliography'. The Computer Journal
'... a well-balanced textbook ... presenting the subject in a unified and systematic manner.' H. Herre, Zentralblatt MATH
'... a highly welcome addition to the literature on term rewriting ... It is very readable, well written and likeable book. it should be of great value to students and researchers alike.' Jan Willem Klop, Journal of Functioning Programming
This is a unified and self-contained introduction to term rewriting that can be used for advanced undergraduate courses or as a professional reference. The main algorithms are presented both informally and as ML programs. Many examples and over 170 exercises are provided.
"About this title" may belong to another edition of this title.
FREE shipping within United Kingdom
Destination, rates & speedsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 701643-n
Quantity: Over 20 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: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521779203
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521779203_new
Quantity: Over 20 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: CitiRetail, Stevenage, United Kingdom
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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521779203
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521779203
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 701643-n
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 316 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Seller Inventory # 7619471
Quantity: 4 available
Seller: moluna, Greven, Germany
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is a unified and self-contained introduction to term rewriting that can be used for advanced undergraduate courses or as a professional reference. The main algorithms are presented both informally and as ML programs. Many examples and over 170 exercise. Seller Inventory # 446946829
Quantity: Over 20 available