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

642 Partial Evaluation and Automatic Program Generation – - 1993
1858 Foundations of Logic Programming – - 1987
240 Partial evaluation in logic programming – - 1987
145 A System For Specialising Logic Programs – - 1991
57 Controlling generalisation and polyvariance in partial deduction of normal logic programs – - 1998
42 Offline specialisation in Prolog using a hand-written compiler generator – - 2004
61 Homeomorphic Embedding for Online Termination – - 1998
50 The ecce partial deduction system and the dppd library of benchmarks. Available via http://www.cs.kuleuven.ac.be/~lpai
103 An Automatic Partial Evaluator for Full Prolog – - 1991
41 Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments – - 1999
63 A general criterion for avoiding infinite unfolding during partial deduction – - 1992
73 An Algorithm of Generalization in Positive Supercompilation – - 1995
55 Infinite state model checking by abstract interpretation and program specialisation – - 2000
27 Conjunctive Partial Deduction in Practice – - 1996
60 Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance – - 1995
16 Efficient Local Unfolding with Ancestor Stacks for Full Prolog – - 2005
14 Non-Leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates – - 2006
28 Homeomorphic embedding for online termination of symbolic methods – - 2002
39 De Schreye. Automatic finite unfolding using well-founded measures – - 1996