Program Transformation with Scoped Dynamic Rewrite Rules

Issue title: Program Transformation: Theoretical Foundations and Basic Techniques. Part 2

Article type: Research Article

Authors: Bravenboer, Martin | van Dam, Arthur | Olmos, Karina | Visser, Eelco

Affiliations: Department of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. E-mail: visser@acm.org

Abstract: The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strategies. The second problem is addressed by the extension of rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are defined at run-time and can access variables available from their definition context. Rules defined within a rule scope are automatically retracted at the end of that scope. In this paper, we explore the design space of dynamic rules, and their application to transformation problems. The technique is formally defined by extending the operational semantics underlying the program transformation language Stratego, and illustrated by means of several program transformations in Stratego, including constant propagation, bound variable renaming, dead code elimination, function inlining, and function specialization.

Journal: Fundamenta Informaticae, vol. 69, no. 1-2, pp. 123-178, 2006