【24h】

Intersection Logic

机译:交叉逻辑

获取原文

摘要

The intersection type assignment system IT uses the formulas of the negative fragment of the predicate calculus (LJ) as types for the λ-terms. However, the deductions of IT only correspond to the proper sub-set of the derivations of LJ, obtained by imposing a meta-theoretic condition about the use of the conjunction of LJ. This paper proposes a logical foundation for IT. This is done by introducing a logic IL. Intuitively, a derivation of IL is a set of derivations in LJ such that the derivations in the set can be thought of as writable in parallel. This way of looking at LJ, by means of IL, allows to transform the meta-theoretic condition, mentioned above, into a purely structural property of IL. The relation between IL and LJ surely has a first main benefit: the strong normalization of LJ directly implies the same property on IL, which translates in a very simple proof of the strong normalizability of the λ-terms typable with IT.
机译:交集类型分配系统IT使用谓词演算(LJ)的负片段的公式作为λ项的类型。但是,IT推论仅对应于LJ推导的适当子集,这是通过对使用LJ的连词施加元理论条件而获得的。本文为IT提出了逻辑基础。这是通过引入逻辑IL来完成的。直观上,IL的派生是LJ中的一组派生,因此该组中的派生可以被认为是可并行写的。通过IL观察LJ的这种方式可以将上述的元理论条件转化为IL的纯结构性质。 IL和LJ之间的关系无疑具有第一个主要好处:LJ的强规范化直接暗示了IL的相同属性,这转化为非常简单的证据,证明了可以用IT进行分类的λ项的强归一化性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号