交集类型子类型的传递性
Transitivity of Subtyping for Intersection Types
摘要:
交叉类型的子类型规则传统上采用传递性规则(Barendregt et al. 1983),这意味着子类型不满足子公式属性,使得它更难以用于编译器验证的过滤器模型。Laurent开发了一个序列风格的子类型系统,没有传递性,并通过一系列六个引理证明了传递性,最终在切割消除(2018)。本文开发了一个规则风格的子类型系统,省略了传递性,并提供了传递性的直接证明,显着减少了证明的长度,将六个引理交换为一个引理。受Laurent系统的启发,函数类型的规则本质上是$β$可靠性。新系统满足“子公式合取性质”:在$A <: B$的推导中出现的每一个类型都是$A$或$B$的子公式,或者是这些子公式的交集。本文证明了新的亚型系统与Barendregt、Coppo和Dezani-Ciancaglini的亚型系统是等价的。
英文摘要:
The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property, making it more difficult to use in filter models for compiler verification. Laurent develops a sequent-style subtyping system, without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018). This article develops a subtyping system in regular style that omits transitivity and provides a direct proof of transitivity, significantly reducing the length of the proof, exchanging the six lemmas for just one. Inspired by Laurent's system, the rule for function types is essentially the $β$-soundness property. The new system satisfies the "subformula conjunction property": every type occurring in the derivation of $A <: B$ is a subformula of $A$ or $B$, or an intersection of such subformulas. The article proves that the new subtyping system is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。