E. Visser. A survey of rewriting strategies in program transformation systems. In Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Evaluation Strategies for Term Rewriting Systems - Nakamura (2002) (2 citations) (Correct)
....Standard ML[MTHM97] the functional strategy for Haskell[HWA 90] and so on. Those strategies have each merits and demerits. In recent year, strategies whose behaviour can be decided by a user have being watched with interest, such as the evaluation strategy for the OBJ family and Stratego for ELAN [Vis01, Vis99, Vis99a, Vis99b, Vis99c, Dol01]. By using such a strategy we can define a suitable strategy for every program or specification. 1.2 One step strategies A strategy may be defined by a one step strategy usually in term rewriting. A one step strategy is a function S which takes a term and returns a redex position to which a rule ....
E. Visser, A survey of rewriting strategies in program transformation systems, In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming, volume 57 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, Elsevier Science Publishers, 2001.
Combining Optimizations, Combining Theories - Veldhuizen, Siek (Correct)
....pessimistic analysis, intermediate results are semantics preserving. An optimistic analysis assumes that a program may be transformed maximally; intermediate results are not sound. We start by noting that there are two major approaches to program improvement: the rst is term rewriting (see e.g. Vis01] in which we apply semanticspreserving rules such as: if true then a else b 7 a if false then a else b 7 b Rewrite systems are an example of the pessimistic approach, in the sense that a term is transformed via a sequence of semantics preserving steps. The second, more common approach is ....
Eelco Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
On Combining Program Improvers - Veldhuizen, Siek (2003) (Correct)
....analysis, intermediate results are semantics preserving. An optimistic analysis assumes that a program may be transformed maximally; intermediate results are not sound. We start by noting that there are two major approaches to program improvement: the first is term rewriting (see e.g. Vis01] in which we apply semanticspreserving rules such as: if true then a else b if false then a else b Rewrite systems are an example of the pessimistic approach, in the sense that a term is transformed via a sequence of semantics preserving steps. The second, more common approach is to ....
Eelco Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
Guaranteed Optimization: Proving Nullspace Properties of.. - Veldhuizen, Lumsdaine (2002) (2 citations) (Correct)
....implies A(x z) Ax; that is, adding something from the nullspace has no e ect. How does one account for adding abstraction to a program Here the analogy to linear algebra is weak, and we turn to rewrite systems. Term rewriting systems have a long history of use in program optimization (e.g. [19, 4, 20]) We consider an application opposite to their usual use: as rules that de optimize a program, introducing abstraction, rather than optimizing it. Here are two such rules, stated informally: 1. Replace any expression e with x, where x is a fresh variable, and insert x : e immediately before e. ....
Eelco Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
Guaranteed Optimization: Proving Nullspace Properties of.. - Veldhuizen, Lumsdaine (2002) (2 citations) (Correct)
....A(x z) Ax; that is, adding something from the nullspace has no effect. How does one account for adding abstraction to a program Here the analogy to linear algebra is weak, and we turn to rewrite systems. Term rewriting systems have a long history of use in program optimization (e.g. [19, 4, 20]) We consider an application opposite to their usual use: as rules that de optimize a program, introducing abstraction, rather than optimizing it. Here are two such rules, stated informally: 1. Replace any expression e with x, where x is a fresh variable, and insert x : e immediately before e. ....
Eelco Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
Program Transformation with Stratego/XT: Rules, Strategies.. - Visser (2003) (1 citation) Self-citation (Visser) (Correct)
No context found.
E. Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
Program Transformation with Stratego/XT: Rules, Strategies.. - Visser (2004) (1 citation) Self-citation (Visser) (Correct)
No context found.
E. Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
The Essence Of Strategic Programming - An inquiry into.. - Lämmel, Visser, Visser (2002) Self-citation (Visser) (Correct)
....rewrite rules is usually non con uent and non terminating. In a pure rewrite system, control over the application of rewrite rules can only be obtained by means of additional constructors and rewrite rules. There are many approaches that address aspects of the problem of control in rewriting; [63] surveys approaches to rewriting strategies in program transformation. In this section we illustrate the problem of control in pure rewrite systems, discuss the usual approach to solving this problem, and show how the extension of a rewriting language with programmable rewriting strategies ....
E. Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers. 10
The Reengineering Wiki - van Deursen, Visser (2002) Self-citation (Visser) (Correct)
....the Reengineering Wiki is a substantial part, consists of 750 pages surveying aspects of program transformation. This part of the site currently generates 20,000 page views per month, distributed over 1000 unique visitors. The site is intended for creating on line surveys in several areas (such as [10]) One category of topics includes resources of interest to the reengineering community. The Program Transformation.Org 7 See http: www.program transformation.org re 8 See http: www.program transformation.org 9 Based on Twiki technology: www.twiki.org. 3 wiki includes separate lists of ....
E. Visser. A survey of rewriting strategies in program transformation systems. In B. Gramlich and S. Lucas Alba, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electr. Notes in Th, Comp. Sc. Elsevier Science Publishers, 2001. 4
c) 2003 IEEE. Personal use of this material is permitted. .. - Reprint Republish This (2006) (Correct)
No context found.
E. Visser. A survey of rewriting strategies in program transformation systems. In Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science, 2001.
Strategies and Analysis Techniques in Functional Program.. - Escobar (Correct)
No context found.
E. Visser. A survey of rewriting strategies in program transformation systems. In B. Gramlich and S. Lucas, editors, Proc. of the 1st Int'l Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001.
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
Eelco Visser. A survey of rewriting 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, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
Partial Evaluation using Rewrite Rules - Specification Of Partial (Correct)
No context found.
Eelco Visser. A survey of rewriting strategies in program transformation systems. In B. Gramlich and S. Lucas, editors,Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 ofElectronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.
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