N. Jones, P. Sestoft, and H. Sndergaard. MIX: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, Vol. 2, No. 1, 1989, 9--50.  Home/Search   Document Not in Database   Summary   Related Articles   Check

..... 18 3 Specialized version of Fig. 1 wrt. abb a la Boyer and Moore . 21 4 Match all counterpart of Fig. 3 . 24 3 1 Background and introduction To build the first self applicable partial evaluator [35, 36], Neil Jones, Peter Sestoft and Harald Sndergaard simplified its domain of discourse to an extreme: polyvariant specialization of symbolic first order recursive equations. Source programs were expressed as recursive equations, data were represented as S expressions, and the ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9--50, 1989.

....ved Aarhus Universitet. Motivation I de senere ar har man arbejdet meget med at udvikle vrktjer til at gre programmer mere e#ektive. Af teknikker kan nvnes memoisering [Kho90] udfold fold transformationer [PP91b] graf baseret implementation af lazy evaluering [Jon87] og partiel evaluering [JSS89] At disse metoder forbedrer e#ektiviteten skyldes at nogle beregninger deles, sa de kun skal gres en gang. Imidlertid er forbindelsen mellem teknikkerne ikke klart forstaet, og det er heller ikke klart hvor stor e#ektivitetsforbedring (speedup) de kan forarsage. Ydermere giver anvendelse af ....

....In the recent years a lot of work has been devoted to developing tools for transforming less e#cient programs into more e#cient programs. These include memoization [Kho90] unfold fold transformations [PP91b] graphbased implementation of lazy evaluation [Jon87] and partial evaluation [JSS89] The e#ciency improvement caused by these techniques all are due to the fact that some computations are shared, i.e. they only have to be done once. However, it is in no way clearly understood how these techniques relate to each other; neither is it clearly understood how much speedup one can ....

[Article contains additional citation context not shown here]

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9--50, 1989.

....is known as the first Futamura projection [9] It amounts to compiling the program from the defined language to the defining language of the interpreter. This compilation can be optimized in various ways, essentially by self applying the partial evaluator (second and third Futamura projections) [12, 1, 6]. Correspondingly, our instantiations can also be optimized. We are using Consel s self applicable partial evaluator Schism [4, 5] 1.3 Overview Section 2 presents our Kleisli interpreter and a few monads. Failure to extend this interpreter with a usual exception operator leads us to an ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

.... [15, 45, 44, 52, 76, 90, 92, 94] string and pattern matching [42, 57, 126, 80] computer graphics [10, 110] numerical computation [16] circuit simulation [11] and hard real time systems [115] There was a major step forward in partial evaluation in the eighties with the MIX partial evaluator [91]. The MIX partial evaluator was different than earlier efforts because it was self applicable one could apply partial evaluation to the partial evaluator itself, specializing the partial evaluator to the input of the partial evaluator. In order to make partial evaluators self applicable, they ....

N.D. Jones, P. Seshoft, , and H. Sndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2:9--50, 1989.

....Mix [JSS85] The language treated by Mix was a subset of statically scoped rst order pure Lisp, and Mix was able to generate compilers from interpreters written in this language. The experiment showed that autoprojection was possible in practice; an automatic version of Mix was developed later [JSS89]. 1.2 Partial evaluation, operationally Partial evaluation works by propagating the static input and performing statically reducible operations. As an example, a conditional expression (if E 1 E 2 E 3 ) can be reduced if expression E 1 is static, that is, if the value of E 1 depends only on the ....

....generated signi cantly faster than by specializing the interpreter. The compiler text is too large to show here, but you may generate the compiler by running the MP job in the examples directory. 4. 2 Specializing a Mixwell interpreter We now specialize an interpreter for the Mixwell language of [JSS89]. 4.2.1 The Mixwell interpreter Mixwell is a rst order Lisp like functional language. The interpreter is given in Figure 13 and Figure 14. P : D1 D2 . Dn) D : F (V1 . Vn) E) E : V (quote C) car E) cdr E) atom E) cons E E) equal E E) if E E E) ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9-50, 1989.

....through the use of high level, machine independent specifications; efficiency is achieved from static typing, which allows the bulk of dynamic code generation costs to be paid at compile time. We call our language C (tick C) C inherits many of the performance advantages of partial evaluation [3, 9]. C differs from languages that use partial evalution in two ways. First, our language extensions and prototype implementation have been done in the context of ANSI C, a complex, statically typed, but very widely used language. Second, it is not a source to source translation, but rather gives ....

N. D. Jones, P. Sestoft, and H. Sondergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

....of N program pgm: pgm ## [x, y] # out) This asserts the possibility of translating programs from N to R without writing an N#R translator. The application of trans mod corresponds to the 1st Futamura projection [20] Practical results for a translation modifier were first reported in [32, 33]. Similar to the specializer projections, the e#ciency of the translation process can be improved by specializing the translation modifier trans mod. This transformation corresponds to the 2nd and 3rd Futamura projection. We will discuss this relation in more detail in Sec. 13. Even though a ....

.... has been used to reduce the interpretive overhead of metainterpreters, e.g. 48] Considerable success has been achieved and the refinement of these methods is an ongoing e#ort [11, 37, 55] O#ine partial evaluation is wellknown for its power to substantially reduce interpretive overhead, e.g. [10, 12, 33, 34], and has been used successfully to optimize two levels of interpretation, e.g. 35] Recent work [13] applies o#ine partial evaluation to interpreters of domain specific languages written in C. These applications may also be viewed as working examples of translation modifiers. All three ....

N. D. Jones, P. Sestoft and H. Sndergaard, "Mix: a self-applicable partial evaluator for experiments in compiler generation," LISP and Symbolic Computation 2(1) (1989) 9--50.

....on the Gmachine. This led Hughes, Johnsson, and Peyton Jones, in the mid 80 s, to devise lambda lifting as a meaning preserving transformation from blockstructured programs to recursive equations [21, 23, 34] Recursive equations also o er a convenient format in Mix style partial evaluation [26]. Indeed, modern partial evaluators such as Schism and Similix lambda lift source programs before specialization [9, 11] As a result, residual programs are also expressed as recursive equations. If partial evaluation is to be seen as a source to source program transformation, however, ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.

....In fact, the c presentation has strong connections with the work of Flanagan et al. 25] on the essence of compiling with continuations. 34 7.2. 1 Styles of specification The earliest work on partial evaluation as a two phase process specified binding time analysis as an abstract interpretation [43]. Since the work of Jones and Gomard [29, 30] binding time analysis is more often specified using type systems (we have followed this approach in the present work) Palsberg [54] and Wand [68] further clarify the role of such specifications in their work on the correctness of binding time ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

....yields the following residual term. case d of inleft(a) a 10 [ inright(b) end) This residual term is more reduced than the term (c) above. 18 3.3. 3 A concrete example: Mix s pending list The Trick was first used to program Mix, the first self applicable partial evaluator [25]. Mix s program specializer is polyvariant and operates on a pending list , which is a list of specialization points, subindexed with static values. When Mix is self applied, looking up in this list is a dynamic operation, even though the specialization points are static. The Trick is used to ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50,

....Johnsson, and Peyton Jones, in the mid 80 s, to devise a meaningpreserving transformation from block structured programs to recursive equations: lambda lifting [18, 19, 28] We review lambda lifting in Section 2. Recursive equations also offer a convenient format in Mix style partial evaluation [22]. Modern partial evaluators such as Schism and Similix lambda lift source programs before specialization [8, 10] lambda lifting As a result, residual programs are also expressed as recursive equations. If partial evaluation is to be seen as a source to source program transformation, ....

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

No context found.

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

No context found.

N. Jones, P. Sestoft, and H. Sndergaard. MIX: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, Vol. 2, No. 1, 1989, 9--50.

No context found.

N.D. Jones, P. Sestoft, and H. Sndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 1(3/4):9--50, 1988.

No context found.

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A selfapplicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.

No context found.

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9--50, 1989.

No context found.

N. Jones, P. Sestoft, and H. Sndergaard. MIX: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, Vol. 2, No. 1, 1989, 9--50.

No context found.

) Jones N., Sestoft P., and Sndergaard H., "Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation," Lisp and Symbolic Computation,

No context found.

Jones, N.D., Sestoft, P., and Sndergaard, H. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9--50, 1989.

No context found.

Neil D. Jones, Peter Sestoft, and Harald Sndergaard. MIX: A self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9--50, 1989.

No context found.

N.D. Jones, P. Sestoft, and H. Sndergaard. Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.

No context found.

N. D. Jones, P. Sestoft, and H. Sndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 1(3/4):9--50, 1988.

No context found.

N. D. Jones, P. Sestoft, and H. Sndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9-50, 1989.

No context found.

Jones, N.D., Sestoft, P., and Sndergaard, H. MIX: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation 2(1) (1989) 9--50.

No context found.

N.D. Jones, P. Sestoft, and H. Sndergaard. Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.

First 50 documents  Next 50

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