E. Visser. A Survey of Strategies in Program Transformation Systems. Electronic Notes in Theoretical Computer Science, 57:363--377, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....model for programs written in these programming languages, in this paper, we investigate termination of rewriting computations controlled by strategy annotations. Strategy annotations can be given different shapes and computational interpretations. Following Visser s recent classification [Vis01], we consider the following computational strategies which are associated to strategy annotations: 1. E strategy [FGJM85,Eke98] which permits us to completely avoid the evaluation of some arguments of function symbols (in an ordered way) 2. Just in time (by van de Pol [Pol01] which is ....

E. Visser. A Survey of Strategies in Program Transformation Systems. In

....data structures. The examples are splitting a signal into several signals to be processed by several processes simultaneously to acquire a higher efficiency, and transforming data structures (e.g. trees and lists) to meet the specialized system Visser presents program transformation taxo nomy in [11]. The author distinguishes two types of the program transformation: 1) translation, where the source and target languages are different; and (2) rephrasing, where the source and target languages are the same. Translation transforms a program in a source language into a program in a target ....

E. Visser. A Survey of Strategies in Program Transformation Systems. In B.Gramlich, S.Lucas Alba (eds.), Proceedings of the Workshop on reduction Strategies in Programming and Rewriting (WRS'01), May

....The examples are splitting a signal into several signals to be processed by several processes simultaneously to acquire a higher efficiency, and transforming data structures (e.g. trees and lists) to meet the specialized system implementation. Visser presents program transformation taxonomy in [11]. The author distinguishes two types of the program transformation: 1) translation, where the source and target languages are different; and (2) rephrasing, where the source and target languages are the same. Translation transforms a program in a source language into a program in a target ....

E. Visser. A Survey of Strategies in Program Transformation Systems. In B. Gramlich, S. Lucas Alba (eds.), Proceedings of the Workshop on reduction Strategies in Programming and Rewriting (WRS'01), May

....this thesis is the construction of programming languages suitable for the implementation of program transformation systems. Program transformation is the act of automatically transforming a program in one language into another program in a possibly di#erent language. A recent survey of the field [Vis01b] presents a taxonomy of program transformations, the main types of which are translations and rephrasings. In a translation a program is transformed to another language. Examples of translations include: Synthesis, where a program is transformed from a high level specification to a ....

Eelco Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas Alba, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), May 2001.

....we are hopeful that a suitable generalisation of the present results could be of use there as well. We do not address the problem of ordering transformations once a conflict has been detected. This subject has been very well studied, and in our view the most advanced work in this area is Stratego [7, 6], which provides a language for defining transformation strategies. Ideally, an extended version of the algorithm presented in this paper could be combined with a system such as Stratego, giving warnings when a set of transformations contains conflicts and needs explicit ordering. 8 Discussion and ....

E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. L. Alba, editors, Workshop on reduction strategies in rewriting and programming, volume 57 of Electronic Notes in Theoretical Computer Science, 2001.

No context found.

E. Visser. A survey of strategies in program transformation systems. Electronic Notes in Theoretical Computer Science, 57, 2001.

....idiom has emerged from numerous approaches that contain some of its ingredients. Various concepts enable, to some extent, separation of traversal control and basic actions. In our previous work, we have analysed related work in the more technical context of certain programming paradigms [30,40,39,38,22,27,20,26]. In the present paper, we will restrict ourselves to related approaches that are of special interest in light of our language independent definition of strategic programming. Levels of traversal control Our discussion of related work will be centred around traversal control. To this end, we ....

E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 57. Elsevier Science Publishers, 2001.

....forms. For each canonical form a tree is normalized with respect to a subset of the rules in the specification. ELAN [3] provides non deterministic sequential strategies. Stratego [17,15] provides generic primitive traversal operators that can be used to compose generic tree traversal schemas. See [16] for a survey of strategies in program transformation. 1.2 Context free Nature of Rewrite Rules The second problem of rewriting is the context free nature of rewrite rules. A rule has only knowledge of the construct it is transforming. However, transformation problems are often ....

E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57/2 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers. .

....forms. For each canonical form a tree is normalized with respect to a subset of the rules in the speci cation. ELAN [3] provides non deterministic sequential strategies. Stratego [17,15] provides generic primitive traversal operators that can be used to compose generic tree traversal schemas. See [16] for a survey of strategies in program transformation. 1.2 Context free Nature of Rewrite Rules The second problem of rewriting is the context free nature of rewrite rules. A rule has only knowledge of the construct it is transforming. However, transformation problems are often ....

E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57/2 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers. .

No context found.

E. Visser. A Survey of Strategies in Program Transformation Systems. Electronic Notes in Theoretical Computer Science, 57:363--377, 2001.

No context found.

E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001. http://www.elsevier.nl/locate/entcs/volume57.html.

No context found.

E. Visser. A Survey of Strategies in Program Transformation Systems. Electronic Notes in Theoretical Computer Science, 57:363--377, 2001.

No context found.

Eelco Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57/2 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.

No context found.

E. Visser. A Survey of Strategies in Program Transformation Systems. In

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC