Speeding up Subtree Replacement Systems

This paper is the last in a three-part study of efficient evaluations of expressions. Here the optimal evaluation algorithms for systems of graph-like expressions studied earlier are compared with the best possible performance of evaluation algorithms for classical systems of expressions. For a wide class of systems it is shown that a graph-like version can speed up the classical system while maintaining correctness.