paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Taylor Expansion as a Monad in Models of DiLL

DiLL 模型中作为单子的泰勒展开
LICS 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2023匹配度 2/10 · 该论文属于微分线性逻辑与范畴语义的纯理论研究,讨论 codigging 规则、泰勒展开与单子结构,与用户的静态分析、Agentic/LLM 程序分析、浮点程序分析及贝叶斯程序分析等核心方向没有直接交叉。仅在“定量语义”这一抽象层面可能与概率/贝叶斯程序的语义基础有微弱间接联系,但论文本身既无静态分析也无论证/LLM 相关内容。引用 12 inbox
Marie Kerjean, Jean-Simon Pacaud Lemay
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:为 DiLL 引入 codigging 规则,证明 ! 在范畴语义中构成单子,且每条证明等于其泰勒展开,模型因此定量。

微分线性逻辑(DiLL)通过对称化指数规则中的三条,使线性逻辑能够表达微分。本文为 DiLL 引入 codigging 推理规则,使指数规则完全对称,并借助 differential categories 研究其范畴语义。作者用指数函数 ex 解释 codigging,在特定情形下用卷积指数解释;证明含 codigging 时每条证明都等于其泰勒级数,因此每个模型都是定量的。文章给出关系模型、博弈逻辑与量子编程相关模型中的实例,并构造分级模型,其中指标见证指数增长。关键结论是 of-course 模态 ! 成为单子,其单子公理强制泰勒展开,从而开启编程语言中定量特征的单子式重构与范畴推广。

问题
如何为 DiLL 引入 codigging 规则以补全指数规则的对称性,并刻画其范畴语义及与泰勒展开、定量模型的关系。
方法
在 differential categories 框架下为 DiLL 加入 codigging 规则,用指数函数 ex 或卷积指数解释该规则,并构造关系、博弈/量子及分级模型进行分析。
评估
通过范畴语义证明与具体模型实例(关系模型、博弈逻辑、量子编程相关模型、分级模型)进行理论评估,表明每条证明等于其泰勒级数且 ! 构成单子。
原文摘要(Abstract)

Differential Linear Logic (DiLL) adds to Linear Logic (LL) a symmetrization of three out of the four exponential rules, which allows the expression of a natural notion of differentiation. In this paper, we introduce a codigging inference rule for DiLL and study the categorical semantics of DiLL with codigging using differential categories. The addition of codigging makes the rules of DiLL completely symmetrical. We will explain how codigging is interpreted thanks to the exponential function ex, and in certain cases by the convolutional exponential. In a setting with codigging, every proof is equal to its Taylor series, which implies that every model of DiLL with codigging is quantitative. We provide examples of codigging in relational models, as well as models related to game logic and quantum programming. We also construct a graded model of DiLL with codigging in which the indices witness exponential growth. Codigging makes the exponential of-course connective ! in LL into a monad, where the monad axioms enforce Taylor expansion. As such, codigging opens the door to monadic reformulations of quantitative features in programming languages, as well as further categorical generalizations.

链接与引用

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

BibTeX
@inproceedings{KerjeanL23,
  title = {Taylor Expansion as a Monad in Models of DiLL},
  author = {Marie Kerjean and Jean-Simon Pacaud Lemay},
  booktitle = {LICS},
  year = {2023},
  doi = {10.1109/lics56636.2023.10175753}
}