Umfang:
34 S.
Serie:
Centrum voor Wiskunde en Informatica 〈Amsterdam〉 / Department of Computer Science: Report CS 91,34
Inhalt:
Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears that loop checks for partial deduction must be complete, whereas traditionally the soundness of a loop check is more important. However, it is also shown that sound loop checks can contribute to improve partial decuction. Finally, a class of complete loop checks suitable for partial deduction is identified."
Sprache:
Englisch
