Term Rewriting and All That [Paperback]

Franz Baader (Author), Tobias Nipkow (Author)

List Price:	CDN$ 48.95
Price:	CDN$ 42.77 & this item ships for FREE with Super Saver Shipping. Details
You Save:	CDN$ 6.18 (13%)
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

In Stock.
Ships from and sold by Amazon.ca. Gift-wrap available.

Only 1 left in stock--order soon (more on the way).

Want it delivered Tuesday, May 29? Choose One-Day Shipping at checkout.

Formats	Amazon Price		New from	Used from
Hardcover	--		--	--
Paperback	CDN $42.77		--	--

Product Details

Paperback: 316 pages
Publisher: Cambridge University Press (Aug 28 1999)
Language: English
ISBN-10: 0521779200
ISBN-13: 978-0521779203
Product Dimensions: 2.4 x 1.7 x 0.2 cm
Shipping Weight: 544 g
Amazon Bestsellers Rank: #635,224 in Books (See Top 100 in Books)

Would you like to update product info or give feedback on images?

See Complete Table of Contents

Product Description

Review

"...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

Product Description

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.

See all Product Description

Inside This Book (Learn More)

First Sentence
Equational reasoning is concerned with a rather restricted class of first-order languages: the only predicate symbol is equality. Read the first page

Explore More
Concordance

Tag this product

(What's this?)

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Customer Reviews

There are no customer reviews yet on Amazon.ca

5 star:		(0)
4 star:		(0)
3 star:		(0)
2 star:		(0)
1 star:		(0)

Share your experience with this product with others

Create your own review

Most Helpful Customer Reviews on Amazon.com ^(beta)

Amazon.com: 4.0 out of 5 stars (3 customer reviews)

4 of 5 people found the following review helpful

4.0 out of 5 stars A good, comprehensive text, Oct 4 2009

By H. Vallee - Published on Amazon.com

Amazon Verified Purchase(What's this?)

This review is from: Term Rewriting and All That (Paperback)

This is a good book for someone researching term rewriting, but it does expect a certain amount of background information. Also, some times the terminology is a little unfamiliar to me (an undergrad math/computer science senior), but a little digging through the index takes care of that problem. All in all, a good book all around, especially if you are used to mathematical writing styles.

20 of 29 people found the following review helpful

3.0 out of 5 stars You'd better love equations, Feb 1 1999

By A Customer - Published on Amazon.com

This review is from: Term Rewriting and All That (Hardcover)

My main criticism of this book is its title. As a computer science graduate student, I was looking for a somewhat accessible book on the field of term rewriting, and the title of this book made me think it might fulfill my needs. Although the book seems fairly comprehensive, it is very difficult to understand. In fact, I have read several of the papers listed in this book's bibliography and found them more comprehensible. If your math skills are very good, and you prefer equations to english, this may be the book for you.

1 of 1 people found the following review helpful

5.0 out of 5 stars great book, Jan 23 2011

By symbolic - Published on Amazon.com

Amazon Verified Purchase(What's this?)

This review is from: Term Rewriting and All That (Paperback)

I needed to understand and use term rewriting techniques in my research
and this book fit the bill. It is very well written and essentially
has no typos or errors that I could find (... I may have found one).
So, the quality is very high. The presentation is quite lucid, well-organized
and logical. As to what to expect, just to be clear, this is a serious, concise mathematics
book and so every word counts. To get the most out of it, a reader needs to work
with the ideas in the context of examples. The book could use some more examples
in my opinion but it's always good practice to come up with your own examples anyway
when reading mathematics. It's also good to read other treatments of the same material
and this book's extensive bibliography supports doing that.

› Go to Amazon.com to see all 3 reviews 4.0 out of 5 stars