Conjunctive Partial Deduction in Practice

Recently, partial deduction of logic programs has been extended to conceptually embed folding. To this end, partial deductions are no longer computed of single atoms, but rather of entire conjunctions; Hence the term “conjunctive partial deduction”.

[1]  Sandro Etalle,et al.  Transforming acyclic programs , 1994, TOPL.

[2]  Patricia M. Hill,et al.  Supporting Transformations for the Partial Evaluation of Logic Programs , 1993, J. Log. Comput..

[3]  John P. Gallagher,et al.  The Applicability of Logic Program Analysis and Transformation to Theorem Proving , 1994, CADE.

[4]  John Darlington,et al.  A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[5]  Danny De Schreye,et al.  Automatic Finite Unfolding Using Well-Founded Measures , 1996, J. Log. Program..

[6]  Steven David Prestwich,et al.  The PADDY Partial Deduction System , 1992 .

[7]  Danny De Schreye,et al.  A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration , 1996, JICSLP.

[8]  Robert Glück,et al.  Controlling Conjunctive Partial Deduction , 1996, PLILP.

[9]  Alan Bundy,et al.  Logic Program Synthesis via Proof Planning , 1992, LOPSTR.

[10]  Michael Leuschel,et al.  Redundant Argument Filtering of Logic Programs , 1996, LOPSTR.

[11]  John P. Gallagher,et al.  Tutorial on specialisation of logic programs , 1993, PEPM '93.

[12]  Alberto Pettorossi,et al.  The Loop Absorption and the Generalization Strategies for the Development of Logic Programs and Partial Deduction , 1993, J. Log. Program..

[13]  Robert Glück,et al.  An Algorithm of Generalization in Positive Supercompilation , 1995, ILPS.

[14]  Saumya K. Debray,et al.  Estimating the Computational Cost of Logic Programs , 1994, SAS.

[15]  Michael Leuschel,et al.  Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints , 1995, LOPSTR.

[16]  Danny De Schreye,et al.  An almost perfect abstraction operation for partial deduction using characteristic trees , 1995 .

[17]  John P. Gallagher,et al.  Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance , 1995, ICLP.

[18]  Alberto Pettorossi,et al.  Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs , 1991, PLILP.

[19]  Michael Leuschel,et al.  Global Control for Partial Deduction through Characteristic Atoms and Global Trees , 1996, Dagstuhl Seminar on Partial Evaluation.

[20]  Danny De Schreye,et al.  Logic Program Specialisation: How To Be More Specific , 1996, PLILP.

[21]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1990, Theor. Comput. Sci..

[22]  Alberto Pettorossi,et al.  Transformation of Logic Programs: Foundations and Techniques , 1994, J. Log. Program..

[23]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[24]  John W. Lloyd,et al.  Partial Evaluation in Logic Programming , 1991, J. Log. Program..

[25]  Annalisa Bossi,et al.  Preserving Universal Termination through Unfold/Fold , 1994, ALP.

[26]  Valentin F. Turchin,et al.  The concept of a supercompiler , 1986, TOPL.

[27]  Zoltan Somogyi,et al.  The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language , 1996, J. Log. Program..

[28]  John P. Gallagher,et al.  Specialisation of a Unification Algorithm , 1991, LOPSTR.

[29]  Randy Goebel,et al.  Gracefully adding negation and disjunction to Prolog , 1986, ICLP.

[30]  John P. Gallagher,et al.  Some low-level source transformations of logic programs , 1990 .

[31]  Roland N. Bol,et al.  Loop checking in partial deduction , 1993, J. Log. Program..

[32]  Annalisa Bossi,et al.  Replacement Can Preserve Termination , 1996, LOPSTR.

[33]  Robert Glück,et al.  Controlling conjunctive partial deduction of definite logic programs , 1996 .

[34]  Alberto Pettorossi,et al.  Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs , 1995, Theor. Comput. Sci..

[35]  Saumya K. Debray,et al.  Cost analysis of logic programs , 1993, TOPL.

[36]  Sandro Etalle,et al.  Transformation of Left Terminating Programs: the Reordering Problem , 1995, LOPSTR.

[37]  Pascal Van Hentenryck,et al.  Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables , 1994 .