On the Correctness of Pull-Tabbing
Computer Science Department
Portland State University
Portland, OR 97207, U.S.A.
Pull-tabbing is an evaluation approach for functional logic computations, based on a graph trans-
formation recently proposed, which avoids making irrevocable non-deterministic 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.
KEYWORDS: Functional Logic Programming, Non-Determinism, Graph Rewriting, Pull-tabbing
To appear in the Proceedings of 27th International Conference on Logic Programming (ICLP 2011)
Lexington, Kentucky, USA, July 6-10, 2011
The original publication is copyrighted by Cambridge University Press
Draft Wed Mar 30 17:21:24 PDT 2011