有意义的交类型理论
Sensible Intersection Type Theories
AI总结:
本文研究了交类型理论中有意义滤波模型的构造与性质,提出通过meet-semilattices和态射保持有意义性,并推广Mendler准则到交类型和头部归约项。
摘要:
有限/静态语义形式的交类型分配已成为分析各种lambda模型精细结构的范式。关键步骤是构造一个与给定lambda模型同构的滤波模型。滤波lambda模型的一个重要性质是“有意义性”,即所有不可解项的解释是最小元素。交类型分配的灵活性源于其对交类型理论的参数化。我们将交类型理论视为特殊的meet-semilattices,并展示在meet-semilattices相反类别中的适当态射保持诱导lambda模型的有意义性。有趣的是,饱和集与lambda项的集合构成这样的meet-semilattices,从而表明基于Tait-Girards可计算性论据等同于构造一个态射。我们刻画了两种交类型理论类别,它们诱导出有意义的滤波模型。第一种是非有效的,第二种是有效的,并且相当于将Mendler准则推广到交类型和头部归约项。然而,对有意义滤波模型的完整刻画仍尚未完成。
英文摘要:
Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given lambda-model. A property of great interest of filter lambda-models is sensibility, i.e. the interpretation of all unsolvable terms is the least element. The flexibility of intersection type assignments derives from their parametrisation on intersection type theories. We construe intersection type theories as special meet-semilattices and show that appropriate morphisms, in the opposite category of meet-semilattices, preserve sensibility of the induced lambda-models. Interestingly the set of saturated sets together with the set of lambda-terms is such a meet-semilattice, thus showing that arguments based on Tait-Girards's computability amount to the construction of a morphism. We characterise two classes of intersection type theories which induce sensible filter models. The first is non-effective while the second is effective and it amounts to the generalisation of Mendler's criterion to intersection types and head normalising terms. The complete characterisation of sensible filter models however still escapes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。