text: Pull-tabbing is an evaluation approach for functional logic computations, b ased on a graph transformation 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 f or which the transformation is intended, extend the computations in these programs to include the transformation, and prove the correctness of the extended computations.
  @cite_24: This work examines a transformation scheme from functional logic programs to purely functional programs both formally and experimentally.
  @cite_8: The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: sharing computations across non-deterministic branching and the declarative encapsulation of logic search. We then present a formal approach which shows how these improvements can be realized and prove the soundness of our approach.
summary: The idea of identifying choices to avoid combining in some expression the left and right alternatives of the same choice appears in @cite_8 . The idea is developed in the framework of a natural semantics for the translation of (flat) Curry programs into Haskell. A proof of the correctness of this idea will appear in @cite_24 which also addresses the similarities between the natural semantics and graph rewriting. This discussion, although informal, is enlightening.