Implementations of term rewriting systems

Abstract

Two main applications of term rewriting systems are equational reasoning in theorem provers and equational computation in programming languages. The present paper examines a number of term rewriting systems in terms of how rewriting is used in different implementations of theorem provers, the use of rewriting techniques in logic programming languages and the problem of efficiency. In addition a non-exhaustive catalogue of distributed implementations is presented.