arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.08820cs.LO
收藏

通过相交类型分解导出空间(扩展版)

Factoring Derivation Spaces via Intersection Types (Extended Version)

Pablo Barenbaum, Gonzalo Ciruelos

摘要:

在典型的非幂等交集型系统中,证明规范化是不融合的。本文引入了一个合流非幂等交型系统。类型推导使用证明项语法。该系统具有良好的性能:主题减少,强规范化,和一个非常正规的残差理论。通过模拟定理建立了与微积分的对应关系。非幂等交集类型的机制允许我们跟踪获得答案所需的资源的使用情况。特别是,它引入了垃圾的概念:如果计算对获得答案没有贡献,那么它就是垃圾。使用这些概念,我们表明,一个的派生空间的一个ESTA项可以因式分解使用的Grothendieck建设半格的一个变种。这意味着,特别是,任何推导在Aidda演算可以被唯一地写为一个无垃圾前缀后跟垃圾。

英文摘要:

In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof term syntax. The system enjoys good properties: subject reduction, strong normalization, and a very regular theory of residuals. A correspondence with the lambda-calculus is established by simulation theorems. The machinery of non-idempotent intersection types allows us to track the usage of resources required to obtain an answer. In particular, it induces a notion of garbage: a computation is garbage if it does not contribute to obtaining an answer. Using these notions, we show that the derivation space of a lambda-term may be factorized using a variant of the Grothendieck construction for semilattices. This means, in particular, that any derivation in the lambda-calculus can be uniquely written as a garbage-free prefix followed by garbage.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑