Efficiently generating efficient generating extensions in Prolog

Efficiently generating efficient generating extensions in Prolog

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jesper Jørgensen , Michael Leuschel

Citations:

15 - 13 self

BibTeX

@MISC{Jørgensen_efficientlygenerating,
    author = {Jesper Jørgensen and Michael Leuschel},
    title = {Efficiently generating efficient generating extensions in Prolog},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

1739	Foundations of Logic Programming - Lloyd - 1984
593	Partial Evaluation and Automatic Program Generation - Jones, Gomard, et al. - 1993
472	Program Analysis and Specialization for the C Programming Language - Andersen - 1994
263	R.: Abstract interpretation and application to logic programs - Cousot, Cousot - 1992
230	Tutorial notes on partial evaluation - Consel, Danvy - 1993
230	Partial evaluation in logic programming - Lloyd, Shepherdson - 1991
141	Tutorial on specialisation of logic programs - Gallagher - 1993
134	Transformation of logic programs: Foundations and techniques - Pettorossi, Proietti - 1994
114	Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming 16 - Bondorf, Danvy - 1991
113	ILSoudergaard MIX: a self-applicable partial evaluator for experiments in compiler generation - Jones - 1989
111	Compile-Time Derivation of Variable Dependency Using Abstract Interpretation - Muthukumar, Hermenegildo - 1992
94	An Automatic Partial Evaluator for Full Prolog - Sahlin - 1991
82	Static Analysis of Logic Programs for Independent AndParallelism - Jacobs, Langen - 1992
79	Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation - Muthukumar, Hermenegildo - 1991
73	Global Flow Analysis as a Practical Compilation Tool - Hermenegildo, Warren, et al. - 1992
66	An algorithm of generalization in positive supercompilation - Sørensen, Glück - 1995
61	The derivation of an algorithm for program specialisation - Gallagher, Bruynooghe - 1991
59	A general criterion for avoiding infinite unfolding during partial deduction - Bruynooghe, Schreye, et al. - 1992
59	Ensuring global termination of partial deduction while allowing flexible polyvariance - Martens, Gallagher - 1995
54	Efficient multi-level generating extensions for program specialization - Glück, Jørgensen - 1995
47	Global control for partial deduction through characteristic atoms and global trees - Leuschel, Martens - 1996
45	Projection Factorisations in Partial Evaluation - Launchbury - 1991
44	Loop checking in partial deduction - Bol - 1993
43	Meta-programming in logic programming - Hill, Gallagher - 1998
43	An introduction to partial deduction - Komorowski - 1992
37	De Schreye. Automatic finite unfolding using well-founded measures - Martens, D - 1996
35	Logimix: A self-applicable partial evaluator for Prolog - Mogensen, Bondorf
32	Controlling conjunctive partial deduction of definite logic programs - Glück, Jørgensen, et al. - 1996
31	A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel - Gurr
30	A partial evaluator and its use as a programming tool - Beckman, Haraldson, et al. - 1976
29	A partial evaluation procedure for logic programs - Benkerimi, Lloyd - 1990
29	Handwriting cogen to avoid problems with static typing - Holst, Launchbury - 1991
27	Hand-writing program generator generators - Birkedal, Welinder - 1994
25	Supporting transformations for the partial evaluation of logic programs - Benkerimi, Hill - 1993
25	A conceptual embedding of folding into partial deduction: Towards a maximal integration - Leuschel, Schreye, et al. - 1996
24	Ecological partial deduction: Preserving characteristic trees without constraints - Leuschel - 1995
23	A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure - Romanenko - 1988
21	Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs - Muthukumar, Hermenegildo - 1990
20	Towards fast and declarative meta-programming - Bowers, Gurr - 1995
19	Partial deduction of the ground representation and its application to integrity checking - Leuschel, Martens - 1995
17	A self-applicable partial evaluator and its use in incremental compilation - Fujita, Furukawa - 1988
17	Some low-level transformations for logic programs - Gallagher, Bruynooghe - 1990
17	Towards creating specialised integrity checks through partial evaluation of meta-interpreters - Leuschel, Schreye - 1995
16	The PADDY partial deduction system - Prestwich - 1992
14	Partial evaluation of the “real thing - Leuschel - 1994
14	Analysing logic programs using \Prop"-ositional logic programs and a magic wand - Codish, Demoen - 1993
13	An almost perfect abstraction operation for partial deduction using characteristic trees - Leuschel, Schreye - 1995
10	Syntactic currying: yet another approach to partial evaluation - Holst - 1989
6	An experiment in automatic selfapplicable partial evaluation of Prolog - Bondorf, Frauendorf, et al. - 1990
6	A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation - Neumann - 1991