Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Computer Science Department, Rice University, Houston, Texas, August 1994. Technical report TR94-242.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....produces code essentially in continuation passing style (CPS) 11, 24, 30] which preserves a program s meaning. This technique is commonly used in compilers for advanced functional languages [2] While CPS is normally used by compilers to name intermediate terms (as observed by Sabry [26, 27]) it has the effect of making the continuations in the program explicit. These become our Continuation objects. Bookmarking becomes the act of saving and restoring continuations, which do indeed capture the state of the computation. Prior work on CPS can also guide the implementation of the ....

Sabry, A. The Formal Relationship between Direct and Continuation-passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Rice University, 1994.

....annoying administrative reductions that are interleaved with actual reductions. Proving properties of CPS programs such as relating their reduction steps with the corresponding reduction steps in direct style thus required Plotkin to develop a so called colon translation [17] which has stuck [12, 19]. In the late 80 s, however, a new CPS transformation was developed that operates in one pass and performs administrative reductions at transformation time [1, 6, 23] This one pass transformation is higher order (or more precisely: second order) and it is not clear how to prove properties about ....

....system, however, gives rise to the notion of administrative redexes: redexes solely due to the CPS transformation and not corresponding to an actual reduction step in the original program. The corresponding administrative reductions are annoying because they are interleaved with actual reductions [12, 13, 17, 19, 20]: actual Let us consider the following simple example, using Figure 1. k:k x: k: k:k x) v 0 : k:k x) v 1 :v 0 v 1 k) The CPS transformed program contains two administrative redexes: the two occurrences of ( k: And reducing them yields two more administrative ....

[Article contains additional citation context not shown here]

Amr Sabry. The Formal Relationship between Direct and ContinuationPassing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Computer Science Department, Rice University, Houston, Texas, August 1994. Technical report TR94-242.

.... will be published in Electronic Notes in Theoretical Computer Science URL: www.elsevier.nl locate entcs Danvy, Dzafic, and Pfenning their reduction steps with the corresponding reduction steps in direct style thus required Plotkin to develop a so called colon translation [17] which has stuck [12,19]. In the late 80 s, however, a new CPS transformation was developed that operates in one pass and performs administrative reductions at transformation time [1,6,23] This one pass transformation is higher order (or more precisely: second order) and it is not clear how to prove properties about ....

....system, however, gives rise to the notion of administrative redexes: redexes solely due to the CPS transformation and not corresponding to an actual reduction step in the original program. The corresponding administrative reductions are annoying because they are interleaved with actual reductions [12,13,17,19,20]: DS AGF actual reductions ED Fnan Fnan fflffl CPS transformation Fnan Fnan CPS BCED administrative actual reductions GF Fnan Fnan fflffl Let us consider the following simple example, using Figure 1. x:x x] DRoot = k:k x:k: k:k x) v 0 : k:k x) v 1 :v 0 v 1 k) Danvy, ....

[Article contains additional citation context not shown here]

Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Computer Science Department, Rice University, Houston, Texas, August 1994. Technical report TR94-242.

....work is supported by NSF Grant CCR 9303383. This is a preliminary version being submitted to HOOTS99 Danvy, Dzafic, and Pfenning their reduction steps with the corresponding reduction steps in direct style thus required Plotkin to develop a so called colon translation [16] which has stuck [11,18]. In the late 80 s, however, a new CPS transformation was developed that operates in one pass and performs administrative reductions at transformation time [1,5,22] This one pass transformation is higher order (or more precisely: third order) and it is not clear how to prove properties about it, ....

....system, however, gives rise to the notion of administrative redexes: redexes solely due to the CPS transformation and not corresponding to an actual reduction step in the original program. The corresponding administrative reductions are annoying because they are interleaved with actual reductions [11,12,16,18,19]: DS #### actual reductions ## ## CPS transformation ## CPS #### administrative actual reductions ## ## It turns out, however, that administrative reductions can be factored out of a CPS program, so that the resulting reductions are actual ones: Danvy, Dzafic, and Pfenning [ ....

[Article contains additional citation context not shown here]

Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Computer Science Department, Rice University, Houston, Texas, August 1994. Technical report TR94-242.

....j (V E[ Evaluation Context) x 2 V ars; x oe 2 AssignableV ars; a 2 Csts 2 The letref construct corresponds to Felleisen and Hieb s [9] ae notation where the store , a finite function represented as a set, maps assignable variables to values. The axioms of the v CS theory can be found in [30] pages 91 92. Each (pcall M N) creates a speculative process to evaluate N . As soon as the value of M is obtained, the speculative process becomes mandatory. In order to know the number of speculative processes or speculative results in a configuration, we just need to count the number of pairs ....

Amr A. Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: a Synthesis of Two Paradigms. PhD thesis, Rice University, Houston, Texas, August 1994.

....of this article is to present a syntactic theory that allows the user to perform equational reasoning on programs using dynamic binding. Our contribution is fivefold. 1. From the dynamic environment passing translation, we construct an inverse translation. Using Sabry and Felleisen s technique [58, 59], we derive a set of axioms and define a calculus, which we prove to be sound and complete with respect to the derivations accepted in dynamic environment passing style (Section 3) 2. We devise a sequential evaluation function, i.e. an algorithm, which we prove to return a value whenever the ....

....W ) lookup x E) if x1 6= x (lk2) he; yi:W he; yi) W if e; y 62 FV (W ) j Theta v ) Figure 4. Syntax and Axioms of the deps( d ) calculus Evaluation in the target language is based on the set of axioms displayed in the second part of Figure 4. Similarly as the store passing calculus [58], deps( d ) is based on the call by value beta reduction. Applications of binary abstractions require a double fi v reduction as modelled by rule (fi Theta v ) and environment lookup is implemented by (lk 1 ) and (lk 2 ) the latter rule traverses the environment structure recursively. ....

[Article contains additional citation context not shown here]

Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: a Synthesis of Two Paradigms. PhD thesis, Rice University, Houston, Texas, August 1994. 61

....of this paper is to present a syntactic theory that allows the user to perform equational reasoning on programs using dynamic binding. Our contribution is fivefold. First, from the dynamic environment passing translation, we construct an inverse translation. Using Sabry and Felleisen s technique [40, 41], we derive a set of axioms and define a calculus, which we prove to be sound and complete with respect to the derivations accepted in dynamic environment passing style (Section 3) Second, we devise a sequential evaluation function, i.e. an algorithm, which we prove to return a value whenever the ....

....x ( xd D Gamma1 [ W ] Fig. 4. The Inverse Dynamic Environment Passing Transform D Gamma1 deps( d ) More precisely, we want to define a calculus on d that equationally corresponds to the calculus on deps( d ) The following definition of equational correspondence is taken verbatim from [40]. Definition 1 (Equational Correspondence) Let R and G be two languages with calculi XR and XG . Also let f : R G be a translation from R to G, and h : G R be a translation from G to R. Finally let r; r 1 ; r 2 2 R and g; g 1 ; g 2 2 G. Then the calculus XR equationally corresponds to the ....

[Article contains additional citation context not shown here]

Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: a Synthesis of Two Paradigms. PhD thesis, Rice University, 1994.

No context found.

Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Computer Science Department, Rice University, Houston, Texas, August 1994. Technical report TR94-242.

No context found.

Sabry, A. The Formal Relationship between Direct and Continuation-passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Rice University, 1994.

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