关于具有给定交集类型的项集合
On sets of terms having a given intersection type
AI总结:
本文在交集类型赋值系统中证明每个强规范化项具有唯一性类型,并探讨类型代数表示,同时证明给定类型的封闭项集合的一致可分离性及无限时的数字系统性质。
摘要:
我们在Coppo、Dezani-Ciancaglini和Venneri [1981]的交集类型赋值系统的一个变体中工作,证明了关于具有给定交集类型的项集合的几个事实。我们的主要结果是每个强规范化项M都承认一个*唯一性类型*,即一个对$(Γ,A)$,使得1) $Γ\vdash M : A$ 且 2) $Γ\vdash N : A \Longrightarrow M =_{βη} N$。我们还讨论了交集类型代数的若干表示,以及类型赋值规则的相应选择。此外,我们证明了具有给定类型的封闭项集合是一致可分离的,并且,如果它是无限的,则构成一个适当的数字系统。这一事实的证明使用了Böhm-out技术的一个内部版本,该技术适用于具有给定交集类型的项。
英文摘要:
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing term M admits a *uniqueness typing*, which is a pair $(Γ,A)$ such that 1) $Γ\vdash M : A$ 2) $Γ\vdash N : A \Longrightarrow M =_{βη} N$ We also discuss several presentations of intersection type algebras, and the corresponding choices of type assignment rules. Moreover, we show that the set of closed terms with a given type is uniformly separable, and, if infinite, forms an adequate numeral system. The proof of this fact uses an internal version of the Böhm-out technique, adapted to terms of a given intersection type.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。