The University of Southampton
University of Southampton Institutional Repository

Global Control for Partial Deduction through Characteristic Atoms and Global Trees

Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (online) control of logic program specialisation. A clear conceptual distinction has been established between local and global control and on both levels concrete strategies as well as general frameworks have been proposed. For global control in particular, recent work has developed concrete techniques based on the preservation of characteristic trees (limited, however, by a given, arbitrary depth bound) to obtain a very precise control of polyvariance. On the other hand, the concept of an m-tree has been introduced as a refined way to trace “relationships” of partially deduced atoms, thus serving as the basis for a general framework within which global termination of partial deduction can be ensured in a non ad hoc way.

Blending both, formerly separate, contributions, in this paper, we present an elegant and sophisticated technique to globally control partial deduction of normal logic programs. Leaving unspecified the specific local control one may wish to plug in, we develop a concrete global control strategy combining the use of characteristic atoms and trees with global (m-)trees. We thus obtain partial deduction that always terminates in an elegant, non ad hoc way, while providing excellent specialisation as well as fine-grained (but reasonable) polyvariance.

We conjecture that a similar approach may contribute to improve upon current (on-line) control strategies for functional program transformation methods such as (positive) supercompilation.
ISBN 3-540-61580-6
263-283
Springer
Leuschel, M.
6d6fd7ab-c48a-47ea-bf36-f667cef2c629
Martens, B.
70539492-f7e7-4188-aa9c-5dca8752dfce
Danvy, O
Glück, R
Thiemann, P
Leuschel, M.
6d6fd7ab-c48a-47ea-bf36-f667cef2c629
Martens, B.
70539492-f7e7-4188-aa9c-5dca8752dfce
Danvy, O
Glück, R
Thiemann, P

Leuschel, M. and Martens, B. (1996) Global Control for Partial Deduction through Characteristic Atoms and Global Trees. Danvy, O, Glück, R and Thiemann, P (eds.) In Partial Evaluation. vol. 1110, Springer. pp. 263-283 . (doi:10.1007/3-540-61580-6_13).

Record type: Conference or Workshop Item (Paper)

Abstract

Recently, considerable advances have been made in the (online) control of logic program specialisation. A clear conceptual distinction has been established between local and global control and on both levels concrete strategies as well as general frameworks have been proposed. For global control in particular, recent work has developed concrete techniques based on the preservation of characteristic trees (limited, however, by a given, arbitrary depth bound) to obtain a very precise control of polyvariance. On the other hand, the concept of an m-tree has been introduced as a refined way to trace “relationships” of partially deduced atoms, thus serving as the basis for a general framework within which global termination of partial deduction can be ensured in a non ad hoc way.

Blending both, formerly separate, contributions, in this paper, we present an elegant and sophisticated technique to globally control partial deduction of normal logic programs. Leaving unspecified the specific local control one may wish to plug in, we develop a concrete global control strategy combining the use of characteristic atoms and trees with global (m-)trees. We thus obtain partial deduction that always terminates in an elegant, non ad hoc way, while providing excellent specialisation as well as fine-grained (but reasonable) polyvariance.

We conjecture that a similar approach may contribute to improve upon current (on-line) control strategies for functional program transformation methods such as (positive) supercompilation.

This record has no associated files available for download.

More information

Published date: 1996
Additional Information: Address: Schlo{\ss}\ Dagstuhl, Germany
Venue - Dates: Dagstuhl Seminar on Partial Evaulation, Dagstuhl Castle, Germany, 1996-02-12 - 1996-02-16
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 250604
URI: http://eprints.soton.ac.uk/id/eprint/250604
ISBN: ISBN 3-540-61580-6
PURE UUID: 8a07f9a8-9d59-49f1-b413-7e78f4e02c23

Catalogue record

Date deposited: 14 Jun 1999
Last modified: 16 Mar 2024 04:09

Export record

Altmetrics

Contributors

Author: M. Leuschel
Author: B. Martens
Editor: O Danvy
Editor: R Glück
Editor: P Thiemann

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×