On the correctness of pull-tabbing

Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable nondeterministic choices that would jeopardize the completeness of computations. In contrast to other approaches with this property, it does no...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 11; H. 4-5; S. 713 - 730
1. Verfasser:	ANTOY, SERGIO
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.07.2011
Schlagworte:	Cloning Completeness Computation Graphs Logic Logic programming Regular Papers Transformations graph rewriting pull-tabbing functional logic programming nondeterminism
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!