Control Generation by Program Transformation

Jonathan, Martin and King, Andy (2006) Control Generation by Program Transformation. Fundamenta informaticae, 69 (1-2). pp. 179-218. ISSN 0169-2968. E-ISSN 1875-8681. (Full text available)

Abstract

The objective of control generation in logic programming is to derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this fundamental problem in logic programming has been slow and, to date, only partial solutions have been proposed. Previously proposed schemes are either inefficient, incomplete (incorrect) or difficult to apply for programs consisting of many components (the scheme is not modular). This paper shows how the control generation problem can be tackled by program transformation. The transformation relies on information about the depths of derivations to derive delay declarations which orchestrate the control. To prove correctness of the transformation, the notion of semi-delay recurrency is introduced, which generalises previous ideas in the termination literature for reasoning about logic programs with delay declarations. In contrast to previous work, semi-delay recurrency does not require an atom to be completely resolved before another is selected for reduction. This enhancement permits the transformation to introduce control which is flexible and relatively efficient.

Item Type: Article
Uncontrolled keywords: Control generation, program transformation, logic programming
Subjects: A General Works
A General Works > AC Collections. Series. Collected works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 12 Dec 2013 15:41 UTC
Last Modified: 03 Jul 2014 13:37 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37531 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year