A Rewrite Stack Machine for ROC!

ROC! is a deterministic rewrite strategy language which includes the rewrite rules as basic operators, and the deterministic choice and the repetition as high-level strategy operators. In this paper we present a method which, for a given term Rewriting system (TRS) R, constructs a new TRS Rmacr such that R-rewriting is equivalent (sound and complete) with Rmacr-rewriting constrained by ROC!. Since Rmacr uses a stack, it is called a rewrite stack machine.