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...

Celý popis

Podrobná bibliografia

Vydané v:	Theory and practice of logic programming Ročník 11; číslo 4-5; s. 713 - 730
Hlavný autor:	ANTOY, SERGIO
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.07.2011
Predmet:	Cloning Completeness Computation Graphs Logic Logic programming Regular Papers Transformations graph rewriting pull-tabbing functional logic programming nondeterminism
ISSN:	1471-0684, 1475-3081
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!