使起泡实用
Making Bubbling Practical
摘要:
冒泡是一种运行时图形转换,用于执行函数逻辑计算中的非确定性步骤。这种转换已经被证明是正确的,但是按照目前的公式,它需要关于步骤的整个上下文的信息,即使步骤只影响少数节点。因此,尽管有一些优点,但它似乎并不能与只需要本地化信息的方法(如回溯和拉标签)竞争。我们提出了一种新的算法,执行冒泡的步骤,只访问本地信息。为此,我们定义了具有附加属性的图,每个节点的支配者,并且当执行重写和/或冒泡步骤时,我们维护该属性。当执行冒泡步骤时,支配者是免费可用的,并且只访问本地信息。我们的工作使冒泡实用,理论上具有竞争力,在功能逻辑计算中实现非确定性。
英文摘要:
Bubbling is a run-time graph transformation studied for the execution of non-deterministic steps in functional logic computations. This transformation has been proven correct, but as currently formulated it requires information about the entire context of a step, even when the step affects only a handful of nodes. Therefore, despite some advantages, it does not appear to be competitive with approaches that require only localized information, such as backtracking and pull-tabbing. We propose a novel algorithm that executes bubbling steps accessing only local information. To this aim, we define graphs that have an additional attribute, a dominator of each node, and we maintain this attribute when a rewrite and/or bubbling step is executed. When a bubbling step is executed, the dominator is available at no cost, and only local information is accessed. Our work makes bubbling practical, and theoretically competitive, for implementing non-determinism in functional logic computations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。