Term Rewriting Systems [Hardcover]

A comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.Term rewriting systems have greatly influenced theoretical computer science. Such systems consist of sequences of discrete steps where one term is replaced with another, and thus have applications in many areas, from automatic theorem proving systems to computer algebra. The early introductory chapters are followed by higher level material, much of which appears here for the first time in book form. Many exercises are included, with selected solutions, and there is a comprehensive bibliography, making the book ideal both for teaching and for research.Term rewriting systems have greatly influenced theoretical computer science. Such systems consist of sequences of discrete steps where one term is replaced with another, and thus have applications in many areas, from automatic theorem proving systems to computer algebra. The early introductory chapters are followed by higher level material, much of which appears here for the first time in book form. Many exercises are included, with selected solutions, and there is a comprehensive bibliography, making the book ideal both for teaching and for research.Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background.1. Abstract reduction systems; 2. First-order term rewriting systems; 3. Examples of TRSs and special rewrlc"