ITEM METADATA RECORD
Title: A general criterion for avoiding infinite unfolding during partial deduction
Authors: Bruynooghe, Maurice ×
De Schreye, Danny
Martens, Bern #
Issue Date: 1992
Publisher: Springer verlag
Series Title: New generation computing vol:11 issue:1 pages:47-79
Abstract: Well-founded orderings are a commonly used tool for proving the termination of programs. We introduce related concepts specialised to SLD-trees- Based on these concepts, we formulate formal and practical criteria for controlling the unfolding during the construction of SLD-trees that form the basis of a partial deduction. We provide algorithms thaL allow to use these criteria in a constructive way. In contrast to the many ad hoc techniques proposed in the literature, our technique provides both a formal and practically applicable framework.
URI: 
ISSN: 0288-3635
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy

 




All items in Lirias are protected by copyright, with all rights reserved.

© Web of science