Global control for partial deduction through characteristic atoms and global trees

Global control for partial deduction through characteristic atoms and global trees (1995)

Cached

Download Links

[www.stups.uni-duesseldorf.de]

Other Repositories/Bibliography

DBLP

by Michael Leuschel , Bern Martens

Citations:

47 - 21 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Global control for partial deduction through characteristic atoms and global trees	INFERENCE
AUTHOR NAME	Michael Leuschel	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
AUTHOR NAME	Bern Martens	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
ABSTRACT	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. 1	SVM HeaderParse 0.2
YEAR	1995	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report CW220	INFERENCE
CITATIONS	33 found	ParsCit 1.0