paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Substructural Abstract Syntax with Variable Binding and Single-Variable Substitution

带变量绑定与单变量替换的子结构抽象语法
LICS 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2025匹配度 1/10 · 该论文属于纯范畴论/形式语义基础研究,讨论子结构抽象语法与变量绑定,与用户关注的静态分析、LLM/Agent、浮点程序分析、贝叶斯程序分析等方向没有直接交集;虽属PL理论,但不涉及AI或程序分析工具与benchmark。引用 0 inbox
Marcelo Fiore, Sanjiv Ranchod
crossref: 2026-09-12

AI 速览

一句话:为线性、仿射、相关和笛卡尔子结构下的带变量绑定抽象语法建立统一的范畴论,并刻画单变量替换。

本文针对带变量绑定的抽象语法,在交换、弱化、收缩及其组合所对应的线性、仿射、相关和笛卡尔四种上下文结构规则下,发展统一的范畴论理论。作者将抽象语法定义为变量上 binding-signature 自函子的自由代数,并给出替换律的有限代数公理化。在此基础上,通过广义结构递归统一构造避免捕获的单变量替换操作,证明其正确性,并证明所得结构具有初始替换代数的普遍抽象特征。该工作为不同子结构设置中的语法与替换提供统一语义框架。

问题
如何在四种子结构上下文(线性、仿射、相关、笛卡尔)中统一处理带变量绑定的抽象语法及其避免捕获的单变量替换。
方法
采用范畴论方法,将语法视为 binding-signature 自函子在变量上的自由代数,以有限代数公理刻画替换律,并用广义结构递归构造单变量替换。
评估
通过数学证明验证替换操作的正确性,并建立其作为初始替换代数的普遍抽象特征;评估覆盖四种结构规则场景。
原文摘要(Abstract)

We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory) with weakening (affine theory) or with contraction (relevant theory) and with both (cartesian theory). Specifically, in all four scenarios, we uniformly: define abstract syntax with variable binding as free algebras for binding-signature endofunctors over variables; provide finitary algebraic axiomatisations of the laws of substitution; construct single-variable substitution operations by generalised structural recursion; and prove their correctness, establishing their universal abstract character as initial substitution algebras.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot8616,
  title = {Substructural Abstract Syntax with Variable Binding and Single-Variable Substitution},
  author = {Marcelo Fiore and Sanjiv Ranchod},
  booktitle = {LICS},
  year = {2025},
  doi = {10.1109/lics65433.2025.00022}
}