关于拉引的正确性
On the Correctness of Pull-Tabbing
摘要：
Pull-Tabbing是一种基于最近提出的图变换的函数逻辑计算的评估方法，它避免了做出会危及计算完整性的不可撤销的非确定性选择。与具有此属性的其他方法相比，它不需要预先克隆可能很大一部分的选择上下文。我们正式定义的拉标签变换，其特征在于类的程序的变换的目的，扩展这些程序中的计算，包括变换，并证明扩展计算的正确性。
英文摘要：
Pull-tabbing is an evaluation approach for functional logic computations, based 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 for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the correctness of the extended computations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
