交集类型中的主类型,四十五年后
Principal Typing for Intersection Types, Forty-Five Years Later
AI总结:
本文通过三种基本操作设计半算法,计算强归约项的主类型,为交集类型中的主类型属性提供现代视角。
摘要:
一个为λ演算设计的类型分配系统具有主类型属性,如果每个可类型化的项M都有一个特殊的类型分配,称为主类型,可以通过适当的运算获得所有M的类型分配。在各种交集类型学科中,主类型的存在早已通过语义和语法方法得到证实。历史上,在语法方面,证明该属性以及描述类型推断(半)算法计算主类型的证明变得复杂,由许多微妙的技术细节构成;本文旨在提供一个更易访问的表述。为此,我们重新审视一些经典概念,并识别出三种基本操作(替换、扩展、擦除),这些操作允许在描述头归约的系统中构建任何类型推导。然后,我们利用这些操作设计一个推断半算法,计算所有和仅所有强归约项的主类型,从而为最初在40多年前证明的结果提供现代视角。
英文摘要:
A type assignment system for lambda-calculus enjoys the principal typing property if every typable term M has a special typing, called principal, from which all typings for M can be obtained via suitable operations. The existence of principal typings in various intersection type disciplines has long been established using both semantical and syntactical approaches. Historically, on the syntactical side, proofs of this property and the description of type inference (semi-)algorithms computing principal typings have been complicated by many subtle technicalities; the present work aims at providing a more accessible formulation. To this end, we revisit some classical notions, and identify three elementary operations (substitution, expansion, erasure) that allow to build any type derivation in a system characterizing head normalization. We then use such operations in the design of an inference semi-algorithm that computes the principal typing of all and only the strongly normalizing terms, thus contributing to a modern perspective on results originally proven more than 40 years ago
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。