Recently, Brass and Dix showed (J. Automat. Reason. 20(1) (1998) 143-165) that the well founded semantics WFS can be deΓΏned as a con uent calculus of transformation rules. This led not only to a simple extension to disjunctive programs (J. Logic Programming 38(3) (1999) 167-213), but also to a new c
A Survey of Rewriting Strategies in Program Transformation Systems
β Scribed by Eelco Visser
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 415 KB
- Volume
- 57
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
β¦ Synopsis
Program transformation is used in a wide range of applications including compiler construction, optimization, program synthesis, refactoring, software renovation, and reverse engineering. Complex program transformations are achieved through a number of consecutive modifications of a program. Transformation rules define basic modifications. A transformation strategy is an algorithm for choosing a path in the rewrite relation induced by a set of rules. This paper surveys the support for the definition of strategies in program transformation systems. After a discussion of kinds of program transformation and choices in program representation, the basic elements of a strategy system are discussed and the choices in the design of a strategy language are considered. Several styles of strategy systems as provided in existing languages are then analyzed.
π SIMILAR VOLUMES
A review of the major aspects of process control in the chemical pulp industry indicates that the control strategies used depend not only on the state of the art in control theory but also on many considerations specific to the processes involved.
An integral transformation procedure is reported as a part of an ab initio program (named SYCETY) developed recently for spatially extended molecules. It is shown that all advantages of the program SYCETY can be kept. The procedure is especially suitable to transform the integrals to a localized bas