Rewrite : a general purpose rewriting program

This thesis reviews the rewriting theory from the data structure and Prolog language point of view so that a basic rewriting program can be implemented using the theory. To allow a user to specify control strategies, "call by name" and "call by value" rules are allowed. Inherited and synthesized states have been included in the rewriting program to enhance its power. To make the rewriting explanation natural, quiet rewriting and recursive rewriting mechanisms have been included. In addition, an accounting system is used to curtail the redundant searches, while meta-level rule specifications can be used to define rules sharing the same characteristics.