Logic program specialisation through partial deduction: Control issues
Authors:
Preprint
Abstract
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It is achieved through a well-automated application of parts of the Burstall-Darlington unfold/fold transformation framework. The main challenge in developing systems is to design automatic control that ensures correctness, efficiency, and termination. This survey and tutorial presents the main developments in controlling partial deduction over the past 10 years and analyses their respective merits and shortcomings. It ends with an assessment of current achievements and sketches some remaining research challenges.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Partial deduction of logic programs wrt well-founded semanticsNew Generation Computing, 1994
- Mixtus: An automatic partial evaluator for full PrologNew Generation Computing, 1993
- A general criterion for avoiding infinite unfolding during partial deductionNew Generation Computing, 1992
- The derivation of an algorithm for program specialisationNew Generation Computing, 1991
- Mix: A self-applicable partial evaluator for experiments in compiler generationHigher-Order and Symbolic Computation, 1989
- Partial evaluation of metaprograms in a “multiple worlds” logic languageNew Generation Computing, 1988
- Mixed computation of Prolog programsNew Generation Computing, 1988
- A self-applicable partial evaluator and its use in incremental compilationNew Generation Computing, 1988
- Mixed computation: potential applications and problems for studyTheoretical Computer Science, 1982
- A partial evaluator, and its use as a programming toolArtificial Intelligence, 1976