M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 anomalies in the generated code that programmers usually (or ideally) do not write [ASU86,Hug88,LS96] Examples are redundant arguments in the functions ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

No context found.

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

....a detailed comparison) This separation has the negative consequence of duplicated work since developments are not shared and many similarities are overlooked. A unified (narrowing based) treatment can bring the di#erent methodologies closer and lays the ground for new insights in all three fields [5, 6, 23, 46, 48]. To perform reductions at specialization time, a partial evaluator normally includes an interpreter [17, 24] This implies that the power of the transformation is highly influenced by the properties of the evaluation strategy from the underlying interpreter. Narrowing driven PE [4, 5] is the ....

....original function definitions into a comprehensive specialized function. This means that narrowingdriven PE has the same potential for specialization as positive supercompilation of functional programs [23] and conjunctive partial deduction of logic programs [38] a comparison can be found in [1, 5, 6]) The contribution of this paper is the definition of a partial evaluator for functional logic programs based on needed narrowing. To be more precise, we provide the following results: We prove strong correctness for such a partial evaluator, i.e. the answers computed by needed narrowing in ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

....detailed comparison) This separation has the negative consequence of duplicated work since developments are not shared and many similarities are overlooked. A unified (narrowing based) treatment can bring the different methodologies closer and lays the ground for new insights in all three fields [5, 6, 23, 44, 49]. Narrowing driven PE [4, 5] is the first generic algorithm for the (on line) specialization of functional logic programs. The method is parametric w.r.t. the narrowing strategy which is used for the automatic construction of the search trees. The method is inspired by the theoretical framework ....

....original function definitions into a comprehensive specialized function. This means that narrowing driven PE has the same potential for specialization as positive supercompilation of functional programs [23] and conjunctive partial deduction of logic programs [39] a comparison can be found in [1, 5, 6]) To perform reductions at specialization time, a partial evaluator normally includes an interpreter [15, 24] This implies that the power of the transformation is highly influenced by the properties of the evaluation strategy from the underlying interpreter. The contribution of this paper is the ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

....logic side. In order to ease and extend the use of Curry, it is essential to make efficient and practical implementations available. Program transformation techniques which aim to derive better semantically equivalent programs have recently been investigated for functional logic languages [AFV98a, AFV98b, AFMV97] and adapted to their use in Curry [AHLV99] In this paper, we consider a different approach for improving the execution of Curry programs which relies on an incremental definition of the Curry operational machinery. We present UPV Curry, a novel implementation of Curry which provides an ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

....3 x x x f g Abstract Indy Indy Indy 1 Introduction innermost lazy M. Alpuente M. Falaschi G. Vidal March 4, 1998 Experiments with the Call by Value Partial Evaluator polyvariant polygenetic local global closedness unfolding abstraction This work has been partially supported by CICYT under grant TIC 95 0433 C03 03 and by HCM project CONSOLE. DSIC, U. P. Valencia, Camino de Vera s n, 46022 Valencia, Spain ( ....

....G. Vidal March 4, 1998 Experiments with the Call by Value Partial Evaluator polyvariant polygenetic local global closedness unfolding abstraction This work has been partially supported by CICYT under grant TIC 95 0433 C03 03 and by HCM project CONSOLE. DSIC, U. P. Valencia, Camino de Vera s n, 46022 Valencia, Spain ( alpuente,gvidal dsic.upv.es) Dip. Matematica e Informatica, U. Udine, Via delle Scienze 206, 33100 Udine, Italy (falaschi dimi.uniud.it) This paper summarizes our experience gained using the system, a narrowing driven partial evaluator for functional logic programs which ....

[Article contains additional citation context not shown here]

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. , 1998. To appear.

.... i.e. it is able to extract specialized definitions which combine several function definitions of the original program (see, e.g. 18] That means that NPE has the same potential for specialization as conjunctive PD or PS within the considered paradigm (a detailed comparison can be found in [6, 7]) This is because the generic method of [4] may allow one to deal with equations and conjunctions during specialization by simply considering the equality and conjunction operators as primitive function symbols of the language. Unfortunately, the use of primitive functions may encumber the ....

....tupling 3 problem illustrated by Example 3 into a simpler, deforestation problem, which is easily solved by the original NPE method. Actually, the original method was proved to be specially well suited for performing deforestation, while it was not able to perform all tupling automatically (see [7]) Now we introduce a refined, dynamic lazy unfolding rule which attempts to achieve a fair, balanced evaluation of the complete input term, rather than a deeper evaluation of some given subterm. This can avoid premature cutting of derivations and, in some cases, produces better specialization ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 1998. To appear.

....detailed comparison) This separation has the negative consequence of duplicated work since developments are not shared and many similarities are overlooked. A unified (narrowing based) treatment can bring the different methodologies closer and lays the ground for new insights in all three fields [5, 6, 23, 46, 48]. To perform reductions at specialization time, a partial evaluator normally includes an interpreter [17, 24] This implies that the power of the transformation is highly influenced by the properties of the evaluation strategy from the underlying interpreter. Narrowing driven PE [4, 5] is the ....

....original function definitions into a comprehensive specialized function. This means that narrowing driven PE has the same potential for specialization as positive supercompilation of functional programs [23] and conjunctive partial deduction of logic programs [38] a comparison can be found in [1, 5, 6]) The contribution of this paper is the definition of a partial evaluator for functional logic programs based on needed narrowing. To be more precise, we provide the following results: We prove strong correctness for such a partial evaluator, i.e. the answers computed by needed narrowing in ....

M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.

....work gives a good example of how to bring the advantages of partial deduction and positive supercompilation together. 9 Conclusions and Further Research Few attempts have been made to study the relationship between PE techniques used in logic and functional languages (e.g. see Alpuente et al. AFV98b] Gluck and S rensen [GS94] and Pettorossi and Proietti [PP96] On the contrary, there is a parallel development of program transformation ideas within the functional programming and the logic programming communities with too little discussion between them. This separation has the negative ....

M. Alpuente, M. Falaschi, and G. Vidal. A unifying view of functional and logic program specialization. ACM Computing Surveys, 1998. To appear.

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