Skip to content

Term Rewriting Systems

Spend $50 to get a free movie!

ISBN-10: 0521391156

ISBN-13: 9780521391153

Edition: 2002

Authors: J. W. Klop, R. C. De Vrijer, S. Abramsky, P. H. Aczel, Y. Gurevich

List price: $194.99
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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…    
Customers also bought

Book details

List price: $194.99
Copyright year: 2002
Publisher: Cambridge University Press
Publication date: 3/20/2003
Binding: Hardcover
Pages: 908
Size: 6.25" wide x 9.50" long x 1.75" tall
Weight: 3.586
Language: English

Abstract reduction systems
First-order term rewriting systems
Examples of TRSs and special rewriting formats
Orthogonality
Properties of rewriting: decidability and modularity
Termination
Completion of equational specifications
Equivalence of reductions
Strategies
Lambda calculus
Higher order rewriting
Infinitary rewriting
Term graph rewriting
Advanced ARS theory
Rewriting based languages and systems
Mathematical background