paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Classical Notions of Computation and the Hasegawa-Thielecke Theorem

经典计算概念与 Hasegawa-Thielecke 定理
POPL 10(POPL)2026匹配度 1/10 · 该论文属于纯形式语义与范畴论方向,研究经典逻辑的线性 L-演算、duploid 语义及 Hasegawa-Thielecke 定理,与用户关注的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析均无直接关联。虽然属于程序语言理论,但并未涉及用户当前追踪的 PL↔AI 或程序分析问题。引用 2 inbox
Éléonore Mangel, Paul-André Melliès, Guillaume Munch-Maccagnoni
crossref: 2026-09-10

AI 速览

一句话:为经典逻辑的线性 L-演算建立对话 duploid 语义,并据此证明 Hasegawa-Thielecke 定理。

本文从 Curry-Howard 对应出发,研究带对合否定的经典逻辑,提出线性经典 L-演算这一极化效应演算。为同时容纳 call-by-value 与 call-by-name,直接风格指称语义中复合失去结合性。作者在非结合范畴上定义图态射伴随,提出非结合的 duploid 与对话 duploid 语义,分别对应线性 call-by-push-value 的效应伴随和线性 continuations 的对话手性。线性经典 L-演算可在任意对话 duploid 中解释,并构成语法对话 duploid。作为应用,作者用语义和语法方式证明 Hasegawa-Thielecke 定理:中心映射与可 thunk 映射在任意对话 duploid 中一致。

问题
如何为带计算式对合否定的经典逻辑给出同时支持 call-by-value 与 call-by-name 的直接风格指称语义,并统一处理伴随模型与对话手性。
方法
使用极化效应演算线性经典 L-演算,在非结合范畴上定义图态射伴随,提出 duploid 与对话 duploid,并建立其与线性 call-by-push-value 效应伴随及线性 continuations 对话手性的对应。
评估
通过语义与语法两种方式证明 Hasegawa-Thielecke 定理,表明线性经典 L-演算可在任意对话 duploid 中解释,并覆盖对称幺半范畴上的双重否定 monad 等实例。
原文摘要(Abstract)

In the spirit of the Curry-Howard correspondence between proofs and programs, we define and study a syntax and semantics for classical logic equipped with a computationally involutive negation, using a polarised effect calculus, the linear classical L -calculus. A main challenge in designing a denotational semantics for the calculus is to accommodate both call-by-value and call-by-name evaluation strategies, which leads to a failure of associativity of composition. In order to tackle this issue, we define a notion of adjunction between graph morphisms on non-associative categories, which we use to formulate polarized and non-associative notions of symmetric monoidal closed duploid and of dialogue duploid. We show that they provide a direct style counterpart to adjunction models: linear effect adjunctions for the (linear) call-by-push-value calculus and dialogue chiralities for linear continuations, respectively. In particular, we show that the syntax of the linear classical L -calculus can be interpreted in any dialogue duploid, and that it defines in fact a syntactic dialogue duploid. As an application, we establish, by semantic as well as syntactic means, the Hasegawa-Thielecke theorem, which states that the notions of central map and of thunkable map coincide in any dialogue duploid (in particular, for any double negation monad on a symmetric monoidal category).

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@article{abs-2502-13033,
  title = {Classical Notions of Computation and the Hasegawa-Thielecke Theorem},
  author = {Éléonore Mangel and Paul-André Melliès and Guillaume Munch-Maccagnoni},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {10},
  number = {POPL},
  year = {2026},
  doi = {10.1145/3776715}
}