经典自然演绎风格演算的非幂等类型
Non-idempotent types for classical calculi in natural deduction style
AI总结:
本文为非幂等类型的λμ-演算定义资源感知类型系统,以组合论证刻画正规化项并给出归约长度上界,进而精化为λμs演算,通过类型化获得强正规化项的算术刻画。
摘要:
本文第一部分,我们基于非幂等交集与并集类型,为λμ-演算定义了两种资源感知类型系统。非幂等方法通过类型推导的递减度量提供了非常简单的组合论证,用以刻画头正规化项和强正规化项。此外,可类型化性为头归约长度和到正规形的最大归约序列长度提供了上界。本文第二部分,将λμ-演算精化为一个称为λμs的小步演算,其灵感来源于距离替换范式。λμs-演算与λμ的非幂等解释的自然扩展兼容,即λμs-归约在扩展的适当类型系统中保持并递减类型推导。因此,我们通过类型化推导出强λμs-正规化项的简单算术刻画。
英文摘要:
In the first part of this paper, we define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments-based on decreasing measures of type derivations-to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the lengths of the head reduction and the maximal reduction sequences to normal-form. In the second part of this paper, the λμ-calculus is refined to a small-step calculus called λμs, which is inspired by the substitution at a distance paradigm. The λμs-calculus turns out to be compatible with a natural extensionof the non-idempotent interpretations of λμ, i.e., λμs-reduction preserves and decreases typing derivations in an extended appropriate typing system. We thus derive a simple arithmetical characterization of strongly λμs-normalizing terms by means of typing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。