© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Control Generation by Program Transformation
Andy King and Jonathan C. Martin
Fundamenta Informaticae, 69(1-2):182-196, 2006.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.
Download publication 491 kbytes (PostScript)Bibtex Record
@article{2161,
author = {Andy King and Jonathan C. Martin},
title = {Control {G}eneration by {P}rogram {T}ransformation},
month = {unknown},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2161},
publication_type = {article},
submission_id = {27799_1115722115},
journal = {Fundamenta Informaticae},
volume = {69},
number = {1-2},
ISSN = {0169-2968},
}