Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance (1995)

Cached

Download Links

by Bern Martens , John Gallagher
Citations:60 - 14 self

Documents Related by Co-Citation

241 Partial evaluation in logic programming – J W Lloyd, J C Shepherdson - 1991
147 A System For Specialising Logic Programs – J. P. Gallagher - 1991
168 The Concept of a Supercompiler – Valentin F. Turchin - 1986
641 P.: Partial Evaluation and Automatic Program Generation – N D Jones, C K Gomard, Sestoft - 1993
48 Global control for partial deduction through characteristic atoms and global trees – Michael Leuschel, Bern Martens - 1995
63 A general criterion for avoiding infinite unfolding during partial deduction – M BRUYNOOGHE, D DE SCHREYE, B MARTENS - 1992
48 Loop Checking in Partial Deduction – R Bol - 1993
46 Partial Deduction and Driving are Equivalent – Robert Glück, Morten Heine Sørensen - 1994
74 An Algorithm of Generalization in Positive Supercompilation – Morten H. Sørensen, Robert Glück - 1995
574 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
25 An Algorithm of Generalization in Positive Supercompilation – M H Srensen, R Gluck - 1995
1858 Foundation of Logic Programming – J W Lloyd - 1987
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
139 Transformation of logic programs: foundations and techniques. Journal of Logic Programming – A Pettorossi, M Proietti - 1994
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
43 The algorithm of generalization in the supercompiler – V F Turchin - 1988
63 The derivation of an algorithm for program specialisation – J Gallagher, M Bruynooghe - 1991
25 Supporting transformations for the partial evaluation of logic programs – K Benkerimi, P M Hill - 1993
102 An Automatic Partial Evaluator for Full Prolog – Dan Sahlin - 1991