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

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 11; no. 4-5; pp. 713 - 730
Main Author: ANTOY, SERGIO
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2011
Subjects:
Cloning
Completeness
Computation
Graphs
Logic
Logic programming
Regular Papers
Transformations
graph rewriting
pull-tabbing
functional logic programming
nondeterminism
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 not require an upfront cloning of a possibly large portion of the choice's context. We formally define the pull-tab transformation, characterize the class of programs for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the correctness of the extended computations.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068411000263