arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.16576cs.LO
收藏

受限访问的共享与线性逻辑(扩展版)

Sharing and Linear Logic with Restricted Access (Extended Version)

Pablo Barenbaum, Eduardo Bonelli

AI总结:

本文将线性逻辑的“当然”模态词拆分为“!”和“$\bullet$”以控制子证明访问与共享,提出具有切消定理的 MSCLL 系统及 $\lambda!\bullet$-演算,并给出三种完备翻译分别模拟传名调用、传值调用及按需调用等求值策略。

摘要:

两种 Girard 翻译提供了将直觉逻辑嵌入线性逻辑的两种不同方法,对应于不同的 lambda 演算调用机制。这两种分别将 A -> B 映射为 !A -o B 和 !(A -o B) 的翻译,已被证明分别对应于传名调用和传值调用。在本研究中,我们将线性逻辑的“当然”模态词拆分为两个模态词,分别记为“!”和“$\bullet$”。直观地说,模态词“!”指定了一个可以被复制和擦除,但不一定被“访问”(即与之交互)的子证明,而组合模态词“$!\bullet$”指定了一个此外还可以被访问的子证明。所得系统称为 MSCLL,具有切消定理,并且在 MELL 上是保守的。我们研究了限制对子证明的访问如何提供在求值策略中控制共享的方法。为此,我们为 MSCLL 的一个直觉主义片段引入了一个项指派系统,称为 $\lambda!\bullet$-演算,并证明其具有主语归约性、合流性以及简单类型片段的强规范性。我们提出了三种可靠且完备的翻译,分别模拟传名调用、传值调用以及一种共享其参数求值的传名调用变体(类似于按需调用)。这些翻译被扩展以模拟 Bang-calculus 以及弱归约策略。

英文摘要:

The two Girard translations provide two different means of obtaining embeddings of Intuitionistic Logic into Linear Logic, corresponding to different lambda-calculus calling mechanisms. The translations, mapping A -> B respectively to !A -o B and !(A -o B), have been shown to correspond respectively to call-by-name and call-by-value. In this work, we split the of-course modality of linear logic into two modalities, written "!" and "$\bullet$". Intuitively, the modality "!" specifies a subproof that can be duplicated and erased, but may not necessarily be "accessed", i.e. interacted with, while the combined modality "$!\bullet$" specifies a subproof that can moreover be accessed. The resulting system, called MSCLL, enjoys cut-elimination and is conservative over MELL. We study how restricting access to subproofs provides ways to control sharing in evaluation strategies. For this, we introduce a term-assignment for an intuitionistic fragment of MSCLL, called the $λ!\bullet$-calculus, which we show to enjoy subject reduction, confluence, and strong normalization of the simply typed fragment. We propose three sound and complete translations that respectively simulate call-by-name, call-by-value, and a variant of call-by-name that shares the evaluation of its arguments (similarly as in call-by-need). The translations are extended to simulate the Bang-calculus, as well as weak reduction strategies.

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

↑