A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Denmark, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and compares them to the expected results for all twenty examples in less time than it takes to blink. This is hardly a de nitive test, and more work needs to be done to establish the algorithm s complexity,andtosee if it scales to large programs. 15. RELATED WORK Mogenson [13] Bondorf [2, 3] and Consel [5] presentBTAs for higher order languages which are based upon abstract interpretation. Three papers on BTAs for typed lambda calculi are closely related to the work presented here because they express BTA as a type inference problem. Nielson and Nielson [15] give a BTA based upon ....

A. Bondorf. Self-Applicable Partial Evaluation (RevisedVersion). PhD thesis, DIKU, Universityof Copenhagen, Denmark, Dec. 1990. DIKU-report 90/17.

....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 ....

Anders Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, 1990. DIKU Report 90-17.

....as Higher order functions, Polymorphism, Polyvariance, Partially static first order data, Higher order partially static functions, and an Unbounded number of stages. We believe the potential for tuning the algorithm to a highly e#cient one remains. 15. RELATED WORK Mogensen [16] Bondorf [2, 3] and Consel [5] present BTAs for higher order languages which are based upon abstract interpretation. Three papers on BTAs for typed lambda calculi are closely related to the work presented here because they express BTA as a type inference problem. Nielson and Nielson [18] give a BTA based upon ....

A. Bondorf. Self-Applicable Partial Evaluation (Revised Version). PhD thesis, DIKU, University of Copenhagen, Denmark, Dec. 1990. DIKU-report 90/17.

....and compares them to the expected results for all twenty examples in less time than it takes to blink. This is hardly a de nitive test, and more work needs to be done to establish the algorithm s complexity, and to see if it scales to large programs. 15. RELATED WORK Mogenson [13] Bondorf [2, 3] and Consel [5] present BTAs for higher order languages which are based upon abstract interpretation. Three papers on BTAs for typed lambda calculi are closely related to the work presented here because they express BTA as a type inference problem. Nielson and Nielson [15] give a BTA based upon ....

A. Bondorf. Self-Applicable Partial Evaluation (Revised Version). PhD thesis, DIKU, University of Copenhagen, Denmark, Dec. 1990. DIKU-report 90/17.

....and control flow simplifications based on this information. Partial evaluation adapts a program to known (static) information about its execution context, leaving behind only the program parts controlled by unknown (dynamic) data. Partial evaluation has been extensively investigated for functional [4, 8], logic [23] and imperative [2, 3, 9] languages, and has been recently extended to Java, by Schultz et al. 28] using C as an intermediate language. Since then, we have extended this approach to automatically produce specialized Java source programs, thus implementing a complete Java to Java ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....flow, thus blocking traditional optimizations at both the hardware and software level. Partial evaluation is an automated technique for mapping generic programs into specific implementations dedicated to a specific purpose. Partial evaluation has been investigated extensively for functional [4, 6], logical [17] and imperative [2, 3, 7] languages, and has recently been investigated for object oriented languages by Schultz et al. in the context of a prototype partial evaluator for Java [26] However, no precise specification of partial evaluation for objectoriented languages has thus far ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....the annotations of the object program to generate the residual program (x 2.1) In the original self application experiments, these annotations were added to the object program manually. Later, a technique for the automatic annotation of programs, called Binding Time Analysis (BTA) was developed [Bon90, NN88, GJ96] Offline partial evaluators do not have access to the static values, but only know which arguments are fixed (static) Based on this information, the expressions in the program are annotated with their binding times, based on the binding times of their arguments. For example, an ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Denmark, 1990.

....and dynamic if it may depend on dynamic input. The second phase of PE performs the actual specialization. Given the specialization values and an annotated program, the specialization phase evaluates the static constructs and rebuilds the dynamic constructs. PE has been studied for functional [3,4], logic [9] and imperative languages [1,2,6] It has reached a mature state, enabling the implementation of partial evaluators for real size languages such as C [6] and Java [17] Partial evaluators have been used for a large variety of realistic applications in domains such as operating systems ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....work done in the Compose Group at IRISA INRIA, Rennes, France; supported in part by Bull. 1 Partial evaluation is an automated technique for mapping generic programs into specific implementations dedicated to a specific purpose. Partial evaluation has been investigated extensively for functional [5, 7], logical [16] and imperative [2, 4, 8] languages, and has recently been investigated for object oriented languages by Schultz et al. in the context of a prototype partial evaluator for Java [25] However, no precise specification of partial evaluation for object oriented languages has thus far ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....control flow simplifications based on the usage context. Partial evaluation adapts a program to known (static) information about its execution context, leaving behind only the program parts controlled by unknown (dynamic) data. Partial evaluation has been extensively investigated for functional [3, 5], logic [19] and imperative [1, 2, 6] languages. In this paper, we only consider o# line partial evaluation, where the program is first divided into static and dynamic computations using a binding time analysis, and then specialized according to a concrete context by executing the static program ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....final result of the generating extension (i.e. the residual program) As far as we are aware, there has been few analyses that detects linear expressions and reduces unnecessary let insertions before specialization. Similix s abstract occurrence counting analysis (Section 4.6 and Section 5. 8 of [6]) has a similar goal. There also exist a lot of results for inlining (e.g. 4] but they are orthogonal to our analysis because they inline let bindings after specialization, which makes the specialization no faster. 8 Chapter 3 Naive Online PE 3.1 Naive Online PE without Let Insertion A ....

Anders Bondorf. Self-applicable partial evaluation. Technical Report 90/17, Department of Computer Science, University of Copenhagen, 1990. Ph.D. Thesis (Revised Version).

....good unfolding strategy must terminate, should avoid duplicating computations, and should produce as few residual function applications as possible. The Similix partial evaluator uses a novel strategy which ensures termination of call unfolding, and also performs well; this method is described in [Bon90] 5.3 The Similix partial evaluator Similix is a publically available self applicable partial evaluator for a nearly complete higher order subset of the Scheme programming language [Bon93] Similix is automatic; in general, user annotations are not needed in order for the partial evaluator to ....

Anders Bondorf. Self-Applicable Partial Evaluation. PhD thesis, Department of Computer Science, University of Copenhagen, 1990.

....program into an exponential time program. In Wadler s [55] Hamilton s [23] and Marlow s [35] approaches this is avoided by considering only linear programs, i.e. programs consisting of functions that do not duplicate their arguments. Some weaker restrictions are adopted in partial evaluation [46, 5] and in work on firstorder deforestation [21] Second, there is the problem of code duplication. Unrestrained unfolding may increase the size of a program dramatically. In principle the size of a program does not affect its running time, but in practice this is not always true. Third, ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, Department of Computer Science, Universty of Copenhagen, 1990. DIKU-Rapport 90/17.

....to automatic program specialization is partial evaluation, which performs aggressive inter procedural constant propagation of all data types, and performs constant folding and control AEow simplications based on this information. Partial evaluation has been extensively investigated for functional [4, 8], logic [23] and imperative [2, 3, 9] languages. This technique has been recently extended to Java, by Schultz et al. 28] using C as an intermediate language. The implementation combines the Harissa bytecode to C compiler [26] with the Tempo program specializer for the C language [9] For this ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....mainly in the context of offline specialization, but can be useful under online frameworks as well. Binding time improvement via the replication of code is common practice in writing interpreters to be specialized via offline means (for some example interpreters written in this style, see [5]) Automating such replication was first suggested by Mogensen [31] Using the CPS transformation to perform the same task was first suggested by Consel and Danvy [14] and has been used to improve the quality of specialization in several examples [13, 28] other manual transformations, such as ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

.... on the Specialization of Term Rewriting Systems Bondorf seems to have been the first to systematically study the application of partial evaluation to term rewriting systems [7] For the reader interested in the specialization of term rewriting systems, we recommend consulting Bondorf s thesis [8]. Part II The Theory of Multi Stage Programming Chapter 4 How Do We Implement MetaML Or, the Basic Semantic Concerns I test my bath before I sit, And I m always moved to wonderment That what chills the finger not a bit Is so frigid upon the fundament. Samson Agonistes, Ogden Nash In ....

Bondorf, A. Self-Applicable Partial Evaluation. PhD thesis, University of Copenhagen, 1990.

....program specialization is partial evaluation, which performs aggressive inter procedural constant propagation (of all data types) and performs constant folding and control flow simplifications based on this information. Partial evaluation has been extensively investigated for functional [3, 4], logic [6] and imperative [1, 2, 5] languages. This technique has been recently extended to Java by Schultz et al. 7] Partial evaluation is a twostage process: first the program is analyzed with an abstract domain of values (values are either known or unknown) and then it is specialized with ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

....used to find as many operations that can be evaluated ( bound ) statically. Early binding time analysis work limited itself to first order languages [JSS85,JSS89,Jon87, Mog89,Rom87,Lau87,Lau90] but, more recently, higher order languages have also been analyzed: Mogensen [Mog89] Bondorf [Bon90a,Bon90b] Consel [Con90] and Hunt and Sands [HS91] describe higher order binding time analysis in an abstract interpretation framework; Nielson and Nielson [NN88a] Schmidt [Sch87] and Gomard [Gom89,Gom90,GJ91] formalize it as a type inference (or type annotation) problem within two level typed ....

....existing formulations ffl Can the type system with type be generalized to an ML style polymorphic system What are its properties ffl In our system lifting is restricted to first order values. But higher order lifting is both possible and useful in practice, as exemplified in Similix [Bon90b] What happens when lifting for static functions and induced lifting for arbitrary partially static structures and functions are also permitted Acknowledgments I would like to express my thanks: to Carsten Gomard for many hours of explaining the use of his type inference system in ....

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Dec. 1990.

....revisits Bondorf and Palsberg s benchmarks. Section 4 reports further benchmarks. Section 5 concludes. 2 Syntax Directed vs. Type Directed Partial Evaluation 2. 1 Syntax directed partial evaluation (sdpe) The Similix partial evaluator is o ine, syntax directed, polyvariant, and self applicable [1]. In general, it is not idempotent. O ine: Similix performs a number of analyses over the source program to optimize specialization (and enable self application) These analyses include a binding time analysis. Syntax directed: Similix operates on the text of the source program. As pointed ....

Anders Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, 1990. DIKU Rapport 90/17.

No context found.

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Denmark, 1990.

No context found.

BONDORF, A. 1990. Self-applicable partial evaluation. Ph.D. thesis, DIKU, University of Copenhagen, Denmark. Revised version: DIKU Report 90/17.

No context found.

Bondorf, A. Self-Applicable Partial Evaluation. Ph.D. Thesis, Report 90/17. DIKU Dept. of Computer Science, University of Copenhagen, 1990.

No context found.

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17.

No context found.

A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Denmark, 1990. Revised version: DIKU Report 90/17. 151

No context found.

A. Bondorf. Self-Applicable Partial Evaluation. Ph.D. thesis, DIKU-Rapport 90/17, Department of Computer Science, University of Copenhagen, 1990.

First 50 documents

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