paperbot · PL 论文追踪

全部论文 待读 收藏

P2 On type-cases, union elimination, and occurrence typing

论类型分支、联合消除与出现类型(occurrence typing)
POPL 6(POPL)2022匹配度 3/10 · 该论文属于类型系统与occurrence typing的形式化研究,涉及类型重建和联合/交集类型,可作为静态分析的理论基础;但它不涉及LLM/Agent、机器学习、浮点程序分析或贝叶斯程序分析,与用户当前核心研究问题没有直接交叉。引用 13 inbox
Giuseppe Castagna, Mickaël Laurent, Kim Nguyễn, Matthew Lutze
crossref: 2026-09-10

AI 速览

一句话:扩展联合/交集类型系统加入 type-case,证明其与联合消除可涵盖 occurrence typing,并给出类型重建算法。

论文研究经典联合与交集类型系统如何涵盖 occurrence typing,并解决其实际类型化问题。作者在系统中加入 type-case 构造,证明联合消除规则与 type-case 定型规则的组合可表达 occurrence typing。为落地,他们定义扩展表达式的规范形式 MSC-form,证明表达式可类型化当且仅当其 MSC-form 可类型化,从而将类型化归约为重建 MSC-form 中的标注。最后给出一个可靠的重建算法,并提供概念验证实现。

问题
如何将 occurrence typing 纳入经典 union/intersection 类型系统,并为其提供可操作的类型化与标注重建方法。
方法
扩展类型系统加入 type-case,组合 union elimination 与 type-case 定型规则;定义 MSC-form 规范形式,将可类型性归约为标注重建,并设计可靠算法。
评估
通过理论证明(可类型化当且仅当 MSC-form 可类型化)和概念验证实现来评估算法的可靠性与可行性。
原文摘要(Abstract)

We extend classic union and intersection type systems with a type-case construction and show that the combination of the union elimination rule of the former and the typing rules for type-cases of our extension encompasses occurrence typing . To apply this system in practice, we define a canonical form for the expressions of our extension, called MSC-form. We show that an expression of the extension is typable if and only if its MSC-form is, and reduce the problem of typing the latter to the one of reconstructing annotations for that term. We provide a sound algorithm that performs this reconstruction and a proof-of-concept implementation.

链接与引用

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

BibTeX
@article{paperbot1563,
  title = {On type-cases, union elimination, and occurrence typing},
  author = {Giuseppe Castagna and Mickaël Laurent and Kim Nguyễn and Matthew Lutze},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {6},
  number = {POPL},
  year = {2022},
  doi = {10.1145/3498674}
}