Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condition: As New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, GB, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. 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, Gröbner 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. 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.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press CUP, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 316.
Language: English
Published by Cambridge University Press, GB, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Rarewaves.com UK, London, United Kingdom
Paperback. Condition: New. 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, Gröbner 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. 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.
Language: English
Published by Cambridge University Press, 1998
ISBN 10: 0521455200 ISBN 13: 9780521455206
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Condition: very_good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in very good condition! The cover and any other included accessories are also in very good condition showing some minor use. The spine is straight, there are no rips tears or creases on the cover or the pages.
Language: English
Published by Cambridge University Press, 1998
ISBN 10: 0521455200 ISBN 13: 9780521455206
Seller: PAPER CAVALIER UK, London, United Kingdom
Condition: new. New!
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.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
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.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 316.
Language: English
Published by Cambridge University Press, 2006
ISBN 10: 0521779200 ISBN 13: 9780521779203
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.