Logic program specialisation through partial deduction: Control issues (2002)

Cached

Download Links

by Michael Leuschel , Maurice Bruynooghe
Venue:THEORY AND PRACTICE OF LOGIC PROGRAMMING
Citations:53 - 12 self

Documents Related by Co-Citation

638 Partial Evaluation and Automatic Program Generation – N D Jones, C K Gomard, P Sestoft - 1993
1852 Foundations of Logic Programming – J W Lloyd - 1987
239 Partial evaluation in logic programming – J W Lloyd, J C Shepherdson - 1991
145 A System For Specialising Logic Programs – J. P. Gallagher - 1991
57 Controlling generalisation and polyvariance in partial deduction of normal logic programs – M Leuschel, B Martens, D De Schreye - 1998
41 Offline specialisation in Prolog using a hand-written compiler generator – Michael Leuschel, Jesper Jørgensen - 2004
61 Homeomorphic Embedding for Online Termination – Michael Leuschel - 1998
50 The ecce partial deduction system and the dppd library of benchmarks. Available via http://www.cs.kuleuven.ac.be/~lpai – M Leuschel
102 An Automatic Partial Evaluator for Full Prolog – Dan Sahlin - 1991
41 Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments – Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen - 1999
73 An Algorithm of Generalization in Positive Supercompilation – Morten H. Sørensen, Robert Glück - 1995
63 A general criterion for avoiding infinite unfolding during partial deduction – M Bruynooghe, D De Schreye, B Martens - 1992
55 Infinite state model checking by abstract interpretation and program specialisation – Michael Leuschel, Thierry Massart - 2000
27 Conjunctive Partial Deduction in Practice – Jesper Jørgensen, Michael Leuschel, Bern Martens - 1996
60 Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance – Bern Martens, John Gallagher - 1995
16 Efficient Local Unfolding with Ancestor Stacks for Full Prolog – Germán Puebla, Elvira Albert, Manuel Hermenegildo - 2005
13 Non-Leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates – Elvira Albert, Germán Puebla, John Gallagher - 2006
28 Homeomorphic embedding for online termination of symbolic methods – Michael Leuschel - 2002
39 De Schreye. Automatic finite unfolding using well-founded measures – B Martens, D - 1996