Term Rewriting Systems

ISBN-13: 9780521391153 / Angielski / Twarda / 2003 / 908 str.

Jan Willem Klop; Roel de Vrijer;Terese

Opis

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.

Recenzje

'… it will soon be a compulsory reference for anyone working in the area.' Journal of Functional Programming

Spis treści

1. Abstract reduction systems; 2. First-order term rewriting systems; 3. Examples of TRSs and special rewriting formats; 4. Orthogonality; 5. Properties of rewriting: decidability and modularity; 6. Termination; 7. Completion of equational specifications; 8. Equivalence of reductions; 9. Strategies; 10. Lambda calculus; 11. Higher order rewriting; 12. Infinitary rewriting; 13. Term graph rewriting; 14. Advanced ARS theory; 15. Rewriting based languages and systems; 16. Mathematical background.