M. Leuschel. Partial evaluation of the \real thing". In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation | Meta-Programming in Logic. Proceedings of LOPSTR'94 and META'94, LNCS 883, pages 122-137, Pisa, Italy, June 1994. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bottom-up Transformation for Programs with Procedural Control - Vanhoof, Bruynooghe (Correct)
....residual program on the right hand side of Fig. 5, which is not correct for the query Q = r(X; 3) Indeed, O(P; Q) hfX=1gi whereas O(P ; Q) hfX=1g; fX=2gi. The reason is due to a well known problem when transforming programs with cut, namely the backward propagation of bindings over a cut [20, 7, 21, 23, 16]. Preventing the backward propagation of bindings over a cut can easily be handled during the bottom up computation using a clausal immediate consequences operator, as was suggested before. The general idea then is as follows: the bindings that are produced by the mgu operation in the immediate ....
Michael Leuschel. Partial evaluation of the \real thing". In Logic Program Synthesis and Transformation. Proceedings of LOPSTR'94, Pisa, Italy, 1994. To be published.
Transformation of Logic Programs - Pettorossi, Proietti (1998) (13 citations) (Correct)
....chapter we have considered only the case of pure Prolog, where the SLD resolution steps have no side effects. Properties which are preserved by unfold fold rules when transforming Prolog programs with sideeffects, including cuts, are described in [ Deville, 1990; Sahlin, 1993; Prestwich, 1993b; Leuschel, 1994a ] 4.5 Correctness Results for Normal Programs In this section we consider the case where the bodies of the clauses contain negative literals. There is a large number of papers dealing with transformation rules which preserve the various semantics proposed for logic programs with negation. In ....
M. Leuschel. Partial evaluation of the real thing. In L. Fribourg and F. Turini, editors, Proceedings of LOPSTR'94 and META'94, Pisa, Italy, Lecture Notes in Computer Science 883, pages 122--137, Springer-Verlag, 1994.
Analysis and Transformation of Proof Procedures - de Waal (1994) (2 citations) (Correct)
....the specialisation of arbitrary meta programs. In this thesis we wish to show how significant improvements can be made on state of the art partial evaluations for the specialisation of meta programs. During the last few years many partial evaluators for various subsets of Prolog have been written [93, 36, 78, 62, 88]. Gurr presented a self applicable partial evaluator for Godel in [46] Most of these partial evaluators are based on the theory developed by Lloyd and Shepherdson [65] and the algorithm by Benkerimi and Lloyd [10] We repeat from [65] the basic definitions and main theorems that are used. ....
M. Leuschel. Partial evaluation of the real thing. In Pre-Proceedings of LOPSTR94. University of Piza, 1994.
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
M. Leuschel. Partial evaluation of the \real thing". In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation | Meta-Programming in Logic. Proceedings of LOPSTR'94 and META'94, LNCS 883, pages 122-137, Pisa, Italy, June 1994. Springer-Verlag.
A Fixed Point Semantics for Logic Programs Extended.. - Vanhoof.. (Correct)
No context found.
Michael Leuschel. Partial evaluation of the \real thing". In Logic Program Synthesis and Transformation. Proceedings of LOPSTR'94, Pisa, Italy, 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