R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, May 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....are here in conjunction with small local transformations to achieve large scale optimization e ects. Small local transformations have been dubbed humble transformations in [14] Such transformations are used extensively in optimizing compilers based on the compilation by transformation idiom [8,9,1,13]. They are also used to some degree in most compilers, although not necessarily recognizable as rewrite rules in the implementation. The optimization of innermost presented in this paper was inspired by more general work on functional program optimization. In [5] an optimization scheme for ....

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, May 1989.

....here in conjunction with small local transformations to achieve large scale optimization e#ects. Small local transformations have been dubbed humble transformations in [14] Such transformations are used extensively in optimizing compilers based on the compilation by transformation idiom [8,9,1,13]. They are also used to some degree in most compilers, although not necessarily recognizable as rewrite rules in the implementation. The optimization of innermost presented in this paper was inspired by more general work on functional program optimization. In [5] an optimization scheme for ....

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, May 1989.

....are here in conjunction with small local transformations to achieve large scale optimization e ects. Small local transformations have been dubbed humble transformations in [13] Such transformations are used extensively in optimizing compilers based on the compilation by transformation idiom [8, 9, 1, 14]. They are also used to some degree in most others compilers. The optimization of innermost presented in this paper was inspired by more general work on functional program optimization. In [6] an optimization scheme for compositions of functions that uniformly consume algebraic data structures ....

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, May 1989.

....MASATO TAKEICHI Department of Information Engineering, University of Tokyo, Tokyo, Japan hu ipl.t.u tokyo.ac.jp ; takeichi u tokyo.ac. jp Introduction Correctness preserving program transformation has recently received a particular attention for compiler optimization in functional programming [Kelsey and Hudak 1989; Appel 1992; Peyton Jones 1996] By implementing a compiler using many passes, each of which is a transformation for a particular optimization, one can attain a modular compiler. It is no surprise that the modularity would increase if transformations are structured, i.e. constructed in a modular ....

Kelsey, R. and Hudak, P. 1989. Compilation by program transformation. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages (Austin, Texas, Jan 1989), pp. 281--292. ACM Press.

....transformations used are simple, but when they are repeatedly applied and interact, they achieve results that often are obtained only through specific and more complex transformations. 1 Introduction The compilation of languages by program transformation has been known and studied for many years [5,4,2]. But the study of program transformation techniques specifically for code improvement has often concentrated on computationally expensive transformations, and quite often the resulting effect of these transformations has been studied on small benchmarks, specially suited to reflect the ....

.... c of alt c1 e c1 : alt cm e cm 1 C C C C C C A of alt 1 e 1 : alt n e n = case e c of alt c1 case e c1 of alt 1 e 1 : alt n e n : alt cm case e cm of alt 1 e 1 : alt n e n A particular instance of this transformation is presented in [1] and [4]. There, it is essentially presented to short circuit ifs, a case which also Santos occurs often in imperative languages. For example: if (b1 b2) then e1 else e2 where b1 and b2 are boolean expressions, and is the conjunction operator. If b1 evaluates to false, there is no need to ....

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, Department of Computer Science, May 1989. YALEU/DCS/RR702.

.... as a compiler optimisation is a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially, the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989]; Kelsey Hudak [1989] Kranz [1988] Steele [1978] A transformational approach to compiler construction is attractive for two reasons: ffl Each transformation can be implemented, verified, and tested separately. This leads to a more modular compiler design, in contrast to compilers that ....

.... a compiler optimisation is a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially, the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989] Kelsey Hudak [1989]; Kranz [1988] Steele [1978] A transformational approach to compiler construction is attractive for two reasons: ffl Each transformation can be implemented, verified, and tested separately. This leads to a more modular compiler design, in contrast to compilers that consist of a few huge passes ....

R Kelsey [1989], "Compilation by program transformation," YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University, May 1989.

.... to b[a 1 =x ; a 2 =y ] ffl Lifting invariant expressions out of loops corresponds to a simple transformation called the full laziness transformation (Hughes [1983] Peyton Jones Lester [1991] This idea, of compilation by transformation, is not new (Appel [1992] Fradet Metayer [1991] Kelsey [1989]) but it is particularly applicable in a non strict language. Although non strict semantics carries an implementation cost, it also means that transformation rules such as those above can be applied globally, and in a wholesale fashion without side conditions. This is not true of a strict ....

R Kelsey [May 1989], "Compilation by program transformation, " YALEU/DCS/RR-702,PhD thesis, Department of Computer Science, Yale University.

.... as a compiler optimisation is, of course, a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989]; Kelsey Hudak [1989] Kranz [1988] Perhaps because it seems such a modest transformation, however, there are few papers about let floating, except in the context of hoisting invariants out of loops. Appel s work on let hoisting in the context of ML is the only substantial example we have ....

.... optimisation is, of course, a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989] Kelsey Hudak [1989]; Kranz [1988] Perhaps because it seems such a modest transformation, however, there are few papers about let floating, except in the context of hoisting invariants out of loops. Appel s work on let hoisting in the context of ML is the only substantial example we have uncovered (Appel [1992, ....

R Kelsey [May 1989], "Compilation by program transformation, " YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.

....object code. Although most optimisations performed in compilers can be regarded as program transformations, they are often implemented in these intermediate representations, which are often quite different from the original source language. The approach of compilation by program transformation [Kel89] uses a single intermediate representation, often based on the lambda calculus [Chu41, Bar84] during most of the compilation process. This approach has two important advantages: 1.1. Contributions of the thesis 2 ffl The source to source transformations are easier to be proven correct, and ....

.... : alt cm e cm 1 C C A of alt 1 e 1 : alt n e n = case e c of alt c1 case e c1 of alt 1 e 1 : alt n e n : alt cm case e cm of alt 1 e 1 : alt n e n A particular instance of the case of case transformation is described in [Aug87] and in [Kel89] using ifs) They were concerned, among other things, with short circuiting boolean conditionals. For example, consider the expression: if (b1 b2) then e1 else e2 where b1 and b2 are boolean expressions, and is boolean conjunction. If b1 turns out to be false there is no point in testing ....

[Article contains additional citation context not shown here]

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, Department of Computer Science, May 1989. YALEU/DCS/RR-702.

....the other performs case analysis on a value of primitive type. 4. 8 Relationship to CPS conversion Transformation to continuation passing style (CPS) is a technique which has been used to good effect in several compilers for strict (call by value) languages (Appel [1992] Fradet Metayer [1991] Kelsey [1989]; Kranz [1988] Steele [1978] Though the STG language is lazy, it has much the same flavour as CPS: nested constructs are flattened to an explicit sequence of simple operations, so that the flow of control is manifest, and there is a direct relationship between the remaining language constructs ....

R Kelsey [May 1989], "Compilation by program transformation," YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.

.... as a compiler optimisation is a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially, the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989]; Kelsey Hudak [1989] Kranz [1988] Steele [1978] A transformational approach to compiler construction is attractive for two reasons: ffl Each transformation can be implemented, verified, and tested separately. This leads to a more modular compiler design, in contrast to compilers that ....

.... a compiler optimisation is a well established technique (Aho, Sethi Ullman [1986] Bacon, Graham Sharp [1994] In the functional programming area especially, the idea of compilation by transformation has received quite a bit of attention (Appel [1992] Fradet Metayer [1991] Kelsey [1989] Kelsey Hudak [1989]; Kranz [1988] Steele [1978] A transformational approach to compiler construction is attractive for two reasons: ffl Each transformation can be implemented, verified, and tested separately. This leads to a more modular compiler design, in contrast to compilers that consist of a few huge passes ....

R Kelsey [May 1989], "Compilation by program transformation," YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.

....that (hopefully) executes more quickly or in less space. Functional languages are particularly amenable to this approach because they have a particularly rich family of possible transformations. Examples of transformation based compilers include the Orbit compiler ( 9] Kelsey s compilers ([8], 7] the New Jersey SML compiler ( 1] and the Glasgow Haskell compiler ( 15] Of course many, perhaps most, other compilers also use transformation to some degree. Compilation by transformation uses automatic transformations; that is, those which can safely be applied automatically by a ....

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, Department of Computer Science, May 1989. YALEU/DCS/RR-702.

.... Appel and MacQueen s Standard ML compiler is a further development in this line, with even greater modularity especially near the back end (Appel Jim [1989] Kelsey s thesis, entitled Compilation by program transformation , is also CPS based, but he handles imperative languages as well (Kelsey [1989]) Fradet and LeMetayer describe another transformation based compiler based on CPS (Fradet Metayer [1990] Fradet Metayer [1988] Their approach is unusual in that their target code is a continuation based combinator language which has a direct reading either as a functional program or as a ....

R Kelsey [May 1989], "Compilation by program transformation," YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.

....Portland, Oregon 97291 1000, USA http: www.cse.ogi.edu PacSoft Email: oliva cse.ogi.edu February 24, 1995 1 Description The program instantiator compiles a restricted subset of Standard ML into Ada 83. It uses a transformational approach similar to those detailed in Steele [Ste78] and Kelsey [Kel89]. The transformations are detailed below. 1. alpha conversion renames variables such that every name in the program is unique. This eliminates possible problems involving name capture in subsequent transformations. 2. datalifting transformation moves all declarations of datatypes to top ....

Kelsey, R. "Compilation By Program Transformation," Ph.D. Thesis, Yale University, 1989.

No context found.

R. A. Kelsey. Compilation by Program Transformation. PhD thesis, Yale University, May 1989.

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