Bondorf, A., \Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems", D.Bjrner, A.P.Ershov, N.D.Jones, editors, Workshop on Partial Evaluation and Mixed Computation, Gl.Avernaes, Denmark, October 1987. Proceedings North-Holland (1988).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and partial evaluation, and none that establish a common ground between them. They focus more on highlighting the fact that TRSs can be seen as a fully functional programming language but did not exploit rewriting technology for the formalization of partial evaluation. 1) In his M.Sc. thesis [3], Bondorf investigated the (self applicable) partial evaluation of TRSs. He thus wrote a partial evaluator for TRSs, using a TRS. 2) Sherman and Strandh [29] use partial evaluation to optimize the implementation of term rewriting systems. 3) Dershowitz [8] uses rewriting as the basic mechanism ....

Anders Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27--50. NorthHolland, 1988. 17

....optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely This work has been partially supported by CICYT TIC 98 0445 C03 01 and by Acci on Integrada hispano alemana HA1997 0073. applied in term rewriting [Bel95,Bon88,DR93,MS96], functional programming [CD93,JGS93] logic programming [Gal93,LS91] and integrated functional logic languages [AFJV97,AFV98a,AFV98b,AHLV99,LG97] A number of researchers have noticed that certain processes of optimization, transformation, specialization and reuse of code often introduce ....

A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. In Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, Amsterdam, 1988.

....independence of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [13, 14, 15, 20, 35, 43], functional programming [17, 32] and logic programming [21, 39] Although the objectives are similar, the general methods are often di#erent due to the distinct underlying models and the di#erent perspectives (see [5] for a detailed comparison) This separation has the negative consequence of ....

A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. In D. Bjrner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, Amsterdam, 1988.

.... 21 This is terminating, but poor since first many proposals are generated by the inverse append, that are mostly omitted by the test at the end. Note that there is always at most one final result. Example: dcons (a ; b ) 1; 2; 3] a = bl = 1; 2; 3] b = 1; n = 2; 3] No j a = [1]; bl = 2; 3] b = 2; n = 3] No j a = 1; 2] bl = 3] b = 3; n = Yes j a = 1; 2; 3] bl = F ailure Hence, the solution is a = 1; 2] b = 3. A much better algorithm may be obtained by transformations: dcons (a; b) c) n = nil; bl = b : n; app (a; bl) c Unfolding app: ....

....and thus, one component of the stream items decreases in size. This implies the termination of the inverse rev 0 . Although the algorithm for the inverse rev looks quite different from the original one, it operates similarly: Example: rev [1; 2; 3] rev 0 ( 1; 2; 3] rev 0 ( 2; 3] [1]) rev 0 ( 3] 2; 1] rev 0 ( 3; 2; 1] 3; 2; 1] invrev [1; 2; 3] let (a; x) invrev 0 [1; 2; 3] in if x = nil then a else fail invrev 0 [1; 2; 3] 1; 2; 3] j ( 1] 2; 3] j ( 2; 1] 3] j ( 3; 2; 1] Answer [3; 2; 1] 9 Examples for successful ....

[Article contains additional citation context not shown here]

Bondorf, A.: Towards a Self-applicable Partial Evaluator for Term Rewriting Systems. In: Bjrner, D., Ershov, A.P., Jones, N.D., Ed.: Partial Evaluation and Mixed Computation, (Elsevier, North Holland, Amsterdam, 1988) 27-50

....independency of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [12, 13, 18, 36, 42], functional programming [15, 33] and logic programming [21, 40] Although the objectives are similar, the general methods are often different due to the distinct underlying models and the different perspectives (see [5] for a detailed comparison) This separation has the negative consequence ....

A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, Amsterdam, 1988.

....and partial evaluation, and none that establish a common ground between them. They focus more on highlighting the fact that TRSs can be seen as a fully functional programming language but did not exploit rewriting technology for the formalization of partial evaluation. 1) In his M.Sc. thesis [2], Bondorf investigated the (self applicable) partial evaluation of TRSs. He thus wrote a partial evaluator for TRSs, using a TRS. 2) Sherman and Strandh [24] use partial evaluation to optimize the implementation of term rewriting systems. 3) Dershowitz [7] uses rewriting as the basic mechanism ....

Anders Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, 1988.

....independence of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [13 15, 20, 35, 43], functional programming [17, 32] and logic programming [21, 39] Although the objectives are similar, the general methods are often different due to the distinct underlying models and the different perspectives (see [5] for a detailed comparison) This separation has the negative consequence of ....

A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, Amsterdam, 1988.

....step involves determining binding time information. Online partial evaluation: The reduce residualize generalize decision is made during specialization using actual data values. Advances in offline techniques help in furthering self application, making it more practical and efficient [Bon87, Bon89, Bon90, CD91a, CD91b, CD90, Con88, Gom92, Lau91] and improving binding time analysis [NN88, Jon87, Bon90] Semantics directed compiling shows a lot of promise but it still has ways to go before it can be of any practical use [Tof90, Lee89] An interesting avenue here is using partial ....

Anders Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems, chapter in Partial Evaluation and Mixed Computation, Proceedings of the IFIP TC2 Workshop [BEJ87], pages 27--50. North-Holland, 1987. REFERENCES 27

....can only compare the ground equational consequences semantics of the programs. 8. 2 Partial Evaluation for Term Rewriting Systems Earlier work on partial evaluation of term rewriting systems has focused on self application rather than on the termination or the correctness of the transformation [Bon88b, Bon89] In Bondorf [Bon89] a selfapplicable, call by value partial evaluator for (an intermediate language for) TRS s is presented, called TreeMix. During unfolding, variables are backward instantiated by a mechanism, introduced in Bondorf [Bon88b] which involves unification and is very ....

....or the correctness of the transformation [Bon88b, Bon89] In Bondorf [Bon89] a selfapplicable, call by value partial evaluator for (an intermediate language for) TRS s is presented, called TreeMix. During unfolding, variables are backward instantiated by a mechanism, introduced in Bondorf [Bon88b] which involves unification and is very similar to driving. However, overlapping lhs s make this mechanism of instantiation followed by unfolding problematic [Bon88b] To solve this problem, rather than specializing a program in the form of a TRS, programs are first translated by TreeMix into ....

[Article contains additional citation context not shown here]

A. Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Proceedings of the International Workshop on Partial Evaluation and Mixed Computation, pages 27--50, Amsterdam, 1988. North-Holland.

....be evaluated at runtime. In an earlier work, we proposed to stage PE further by shifting the interpretation of binding times from PE to PE [24, 29] This shift substantially simplifies the specializer. To get the best of both worlds, online and offline partial evaluation can be combined as follows [11, 109]. Whenever the exact binding time property of an expression can be determined, offline partial evaluation is used. Otherwise, the treatment for this expression is postponed until specialization time, when concrete values are available. Bondorf s partial evaluator for term rewriting systems uses ....

....the exact binding time property of an expression can be determined, offline partial evaluation is used. Otherwise, the treatment for this expression is postponed until specialization time, when concrete values are available. Bondorf s partial evaluator for term rewriting systems uses this strategy [11]. 2.4 Formalizing partial evaluation Much effort is devoted to specifying and proving offline partial evaluation. Gomard defines the denotational semantics of the specialization process for the calculus and proves its correctness [53] Launchbury formulates a binding time analysis for a ....

A. Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Bjørner et al.

....in particular, a handwritten cogen typically performs no (time consuming) environment manipulations whereas one generated by self application does. 3) When working in statically typed languages with user defined data types, the self application approach requires encoding data type values [Bon88, Lau91, DNBV91], resulting in relatively inefficient (cogen generated) compilers that spend much of their time on coding and decoding. By writing cogen by hand, the coding problem is eliminated [HL91, BW93] Specializers written in continuation passing style (abbreviated cps ) perform better than specializers ....

Anders Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, 1988.

....enough, the idea of using dynamic conditionals as specialization points has been used in other language contexts, but never for autoprojectors for Lisp like recursive equation languages. 19] thus reports an autoprojector for an imperative assembly style language using this idea. 42] and [7] essentially use the same idea for functional languages based on pattern matching. 5.3 Insertion of new procedure calls In partial evaluators for recursive equation languages, the specializable program points have traditionally been reduced to be only user written procedures (functions) In ....

Anders Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27--50, North-Holland, 1988.

No context found.

Bondorf, A., \Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems", D.Bjrner, A.P.Ershov, N.D.Jones, editors, Workshop on Partial Evaluation and Mixed Computation, Gl.Avernaes, Denmark, October 1987. Proceedings North-Holland (1988).

No context found.

A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. In D. Bjrner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 27--50. North-Holland, Amsterdam, 1988.

No context found.

A. Bondorf. Towards a self-applicable partial evaluator for term rewriting systems. In D. Bjrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 27-50. NorthHolland, 1988.

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