|
230
|
Partial evaluation in logic programming
– J W Lloyd, J C Shepherdson
- 1991
|
|
141
|
A System For Specialising Logic Programs
– J. P. Gallagher
- 1991
|
|
47
|
Global control for partial deduction through characteristic atoms and global trees
– Michael Leuschel, Bern Martens
- 1995
|
|
134
|
Transformation of logic programs: Foundations and techniques
– A Pettorossi, M Proietti
- 1994
|
|
59
|
Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance
– Bern Martens, John Gallagher
- 1995
|
|
48
|
The ecce partial deduction system and the dppd library of benchmarks. Available via http://www.cs.kuleuven.ac.be/~lpai
– M Leuschel
|
|
1739
|
Foundations of Logic Programming
– J W Lloyd
- 1984
|
|
26
|
Conjunctive Partial Deduction in Practice
– Jesper Jørgensen, Michael Leuschel, Bern Martens
- 1996
|
|
94
|
An Automatic Partial Evaluator for Full Prolog
– Dan Sahlin
- 1991
|
|
37
|
De Schreye. Automatic finite unfolding using well-founded measures
– B Martens, D
- 1996
|
|
155
|
The Concept of a Supercompiler
– Valentin F. Turchin
- 1986
|
|
593
|
Partial Evaluation and Automatic Program Generation
– N D Jones, C K Gomard, P Sestoft
- 1993
|
|
44
|
Loop checking in partial deduction
– R Bol
- 1993
|
|
24
|
Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints
– Michael Leuschel
- 1995
|
|
25
|
A conceptual embedding of folding into partial deduction: Towards a maximal integration
– Michael Leuschel, Danny De Schreye, André De Waal
- 1996
|
|
25
|
Advanced Techniques for Logic Program Specialisation
– Michael Leuschel
- 1997
|
|
61
|
The derivation of an algorithm for program specialisation
– J Gallagher, M Bruynooghe
- 1991
|
|
25
|
An Algorithm of Generalization in Positive Supercompilation
– M H Srensen, R Gluck
- 1995
|
|
59
|
A general criterion for avoiding infinite unfolding during partial deduction
– M Bruynooghe, D De Schreye, B Martens
- 1992
|
