浅项重写系统的范式唯一性
Uniqueness of Normal Forms for Shallow Term Rewrite Systems
摘要:
范式的唯一性($UN^=$)是项重写系统的一个重要性质。$UN^=$对于地是可判定的(即,无变量)系统和一般不可判定。最近,它被证明是可判定的线性,浅系统。我们推广了以前的结果,并表明,这个属性是可判定的浅重写系统,在相反的汇合,可达性和其他属性,这都是不可判定的平面系统。我们的结果在某种意义上也是最优的,因为我们证明了$UN^=$属性对于两类线性重写系统是不可判定的:左手边深度至多为2的左平坦系统和左手边深度至多为2的右平坦系统。
英文摘要:
Uniqueness of normal forms ($UN^=$) is an important property of term rewrite systems. $UN^=$ is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow systems. We generalize this previous result and show that this property is decidable for shallow rewrite systems, in contrast to confluence, reachability and other properties, which are all undecidable for flat systems. Our result is also optimal in some sense, since we prove that the $UN^=$ property is undecidable for two classes of linear rewrite systems: left-flat systems in which right-hand sides are of depth at most two and right-flat systems in which left-hand sides are of depth at most two.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。