弱μ-等式是可判定的
Weak mu-equality is decidable
摘要:
在本文中,我们考虑的一组mu-类型,一组简单的类型自由生成的原子类型和类型构造函数->的扩展,通过一个新的运营商mu,显式表示的解决方案的递归方程,如A = A -> β。我们发现,这种所谓的弱μ-平等的μ-类型是可判定的,通过定义一个派生系统的弱μ-平等的基础上,标准的减少μ-类型,使节点的数量在派生树为A = B有界作为一个功能的A,B。我们给出两个证明。一个是μ-类型的α-等价类的=的可判定性,另一个是μ-类型的=的可判定性。这两个证明都是简单和基本的。
英文摘要:
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like A = A -> beta. We show that this so-called weak mu-equality for mu-types is decidable by defining a derivation system for weak mu-equality based on standard reduction for mu-types such that the number of nodes in a derivation tree for A = B is bounded as a function of A, B. We give two proofs. One for decidability of = for alpha-equivalence classes of mu-types and one for = for mu-types theselves. Both proofs are straightforward and elementary.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。