Overview

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.

ISBN-13

9780521391153

ISBN-10

0521391156

Weight

3.62 Pounds

Dimensions

6.25 x 1.75 x 9.50 In

List Price

$211.00

Edition

1st Edition

Format

Hardcover

Language

English

Pages

908 pages

Publisher

Cambridge University Press

Published On

2003-03-20



View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
Used, Very Good
Seller details
Books From California
★★★★☆

Simi Valley, CA, USA

Very Clean Copy-Over 500, 000 Internet Orders Filled.
$208.74

 Free delivery by: 01 Apr 2026


Bookstores.com relies on cookies to improve your experience.