非正交项重写系统的生产率
Productivity of Non-Orthogonal Term Rewrite Systems
摘要:
生产力是一个属性,即可以使用给定的项重写系统计算无限构造函数项的有限前缀。然而,生产率只考虑了正交系统,其中不允许非确定性。本文提出的技术,也证明了非正交项重写系统的生产力。对于这样的系统,期望不必猜测要执行的约简步骤,而是任何最外公平约简应该计算极限中的无限构造函数项。作为一个主要的结果,它表明,对于可能的非正交项重写系统,这种生产力可以从上下文敏感的终止。这一结果可用于证明数字电路的稳定性,这将通过一个例子来说明。
英文摘要:
Productivity is the property that finite prefixes of an infinite constructor term can be computed using a given term rewrite system. Hitherto, productivity has only been considered for orthogonal systems, where non-determinism is not allowed. This paper presents techniques to also prove productivity of non-orthogonal term rewrite systems. For such systems, it is desired that one does not have to guess the reduction steps to perform, instead any outermost-fair reduction should compute an infinite constructor term in the limit. As a main result, it is shown that for possibly non-orthogonal term rewrite systems this kind of productivity can be concluded from context-sensitive termination. This result can be applied to prove stabilization of digital circuits, as will be illustrated by means of an example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。