Open AccessJournal Article10.1017/S147106840200145X

Logic program specialisation through partial deduction: Control issues

- 01 Jul 2002

- Theory and Practice of Logic Programming

- Vol. 2, Iss: 4, pp 461-515

112

TL;DR: This survey and tutorial presents the main developments in controlling partial deduction over the past 10 years and analyses their respective merits and shortcomings and ends with an assessment of current achievements and sketches some remaining research challenges.

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.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Under consideration for publication in theory and practice of logic programming 1 logic program specialisation through partial deduction: control issues" ?

This survey and tutorial presents the main developments in controlling partial deduction over the past 10 years and analyses their respective merits and shortcomings.

2. What are the future works mentioned in the paper "Under consideration for publication in theory and practice of logic programming 1 logic program specialisation through partial deduction: control issues" ?

Future work should advance the state of the art of specialising constraint logic programming to that for standard logic programming.. As to the future of the o -line versus on-line debate, the authors believe that hybrid approaches might prove to be the way to go for many applications, delivering a good compromise between fast transformation speeds and precise specialisation.. In the following the authors present some factors which they believe explain this situation: { non-declarative features: most Prolog programs contain some form of non- declarative parts.. In principle, existing online systems such as mixtus and ecce are fully auto- matic and can be used by a na ve user.

Fig. 1. Incomplete SLDNF-trees for Example 2

Fig. 3. Generic partial deduction procedure

Fig. 5. Three almost determinate trees and one determinate tree

Citations

•Book

Introduction to logic programming

Jean-Marie Jacquet

- 21 Nov 1993

TL;DR: This introduction to logic programming is based on Haskell, a very simple way of programming that can be applied to any kind of computer programming.

...read moreread less

102

•Book Chapter•10.1007/3-540-36377-7_17

Homeomorphic embedding for online termination of symbolic methods

Michael Leuschel

- 01 Jan 2002

- Lecture Notes in Computer Science

TL;DR: A survey and discussion of the use of homeomorphic embedding in the context of metaprogramming and the advantages of such an approach over one using well-founded orders are discussed.

...read moreread less

•Proceedings Article•10.1145/1806651.1806671

Parametric inference of memory requirements for garbage collected languages

Elvira Albert, +2 more

- 05 Jun 2010

TL;DR: A novel approach to inferring upper bounds on memory requirements of Java-like programs which is parametric on the notion of object lifetime, i.e., on when objects become collectible, and infers accurateupper bounds on the memory consumption for a reachability-based garbage collector.

...read moreread less

Book•10.1007/10720327

Logic-Based Program Synthesis and Transformation

Annalisa Bossi

- 01 Jan 2000

TL;DR: Various formalizations of the concept of “refinement step” as used in the formal development of programs from algebraic specifications are presented and compared.

...read moreread less

Partial Evaluation 워크샵 보고서

도경구

- 01 Jun 1998

TL;DR: Partial evaluation is an automated program-transformation technique for specializing programs that employs techniques found in optimizing compilers such as constant propagation and folding (evaluating expressions with constant parameters), loop unrolling (reducing the number of iterations by 1).

...read moreread less

...

Expand

References

•Book

Introduction to Metamathematics

H. Rasiowa

- 01 Jan 1952

4.7K

•Book

Foundations of logic programming

John W. Lloyd

- 01 Jan 1984

TL;DR: This is the second edition of an account of the mathematical foundations of logic programming, which collects, in a unified and comprehensive manner, the basic theoretical results of the field, which have previously only been available in widely scattered research papers.

...read moreread less

4.5K

Book•10.1007/978-3-642-96826-6

Foundations of Logic Programming

John W. Lloyd

- 01 Jan 1984

4.1K

•Book

Partial evaluation and automatic program generation

Neil D. Jones, +2 more

- 01 Jan 1993

TL;DR: This paper presents a guide to the literature the self-applicable scheme specializer, a partial evaluator for a subset of scheme for a first-order functional languages.

...read moreread less

1.7K

Book Chapter•10.1016/B978-0-444-88074-1.50011-1

CHAPTER 6 – Rewrite Systems

Nachum Dershowitz

- 01 Jan 1990

TL;DR: In this paper, the authors focus on rewrite systems, which are directed equations used to compute by repeatedly replacing sub-terms of a given formula with equal terms until the simplest form possible is obtained.

...read moreread less

1.6K

...

Expand

Logic program specialisation through partial deduction: Control issues

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Under consideration for publication in theory and practice of logic programming 1 logic program specialisation through partial deduction: control issues" ?

2. What are the future works mentioned in the paper "Under consideration for publication in theory and practice of logic programming 1 logic program specialisation through partial deduction: control issues" ?

Figures

Citations

Introduction to logic programming

Homeomorphic embedding for online termination of symbolic methods

Parametric inference of memory requirements for garbage collected languages

Logic-Based Program Synthesis and Transformation

Partial Evaluation 워크샵 보고서

References

Introduction to Metamathematics

Foundations of logic programming

Foundations of Logic Programming

Partial evaluation and automatic program generation

CHAPTER 6 – Rewrite Systems

Related Papers (5)

Partial evaluation and automatic program generation

Partial evaluation in logic programming

Foundations of logic programming

Controlling generalization and polyvariance in partial deduction of normal logic programs

Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints