Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Bern Martens , John Gallagher

Citations:

59 - 14 self

Versions

Version History

Metadata Version 5

User correction supplied by mph

Datum	Value	Source
TITLE	Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance	user correction - Legacy Corrections
AUTHOR NAME	Bern Martens	user correction
AUTHOR NAME	John Gallagher	user correction
AUTHOR AFFIL	Department of Computer Science; University of Bristol; U.K.	user correction
AUTHOR ADDR	Queen's Building; University Walk; Bristol BS8 1TR	user correction
ABSTRACT	The control of polyvariance is a key issue in partial deduction of logic programs. Certainly, only finitely many specialised versions of any procedure should be generated, while, on the other hand, overly severe limitations should not be imposed. In this paper, well-founded orderings serve as a starting point for tackling this so-called "global termination" problem. Polyvariance is determined by the set of distinct "partially deduced" atoms generated during partial deduction. Avoiding ad-hoc techniques, we formulate a quite general framework where this set is represented as a tree structure. Associating weights with nodes, we define a well-founded order among such structures, thus obtaining a foundation for certified global termination of partial deduction. We include an algorithm template, concrete instances of which can be used in actual implementations, prove termination and correctness, and report on the results of some experiments. Finally, we conjecture that the proposed framewor...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	38 found	ParsCit 1.0