paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Call-by-name Gradual Type Theory

传名调用的渐进类型论
LMCS vol.Volume 16, Issue 12020匹配度 2/10 · 该论文属于纯类型论与形式语义研究,讨论传名调用渐进类型论及范畴语义模型,与用户关注的 LLM/Agent、面向 ML 系统的静态分析、浮点程序分析、贝叶斯程序分析等方向均无直接交叉。虽属 PL 理论,但未涉及 AI/LLM 或工业落地问题,匹配度低。引用 14 inbox
Max S. New, Daniel R. Licata
dblp: 2026-09-10crossref: 2026-09-10arxiv: 2026-09-10

AI 速览

一句话:提出传名调用渐进类型论,用泛性质刻画动态类型、类型转换与类型错误,并由渐进保证唯一确定转换行为。

本文提出传名调用(call-by-name)渐进类型论,为渐进类型化提供逻辑与类型论基础。作者引入渐进类型和项动态性的新判断,以相对它们的泛性质定义动态类型、类型转换(cast)与类型错误,而非直接给出操作规则;结合外延性(η)原则,证明多数标准 cast 行为由渐进保证唯一决定,从而为 cast 定义提供语义依据,并说明非标准定义会违反这些原则。该理论是一类预序范畴 equipment 的内部语言;作者还从表示非渐进类型与程序的 2-范畴构造相应 equipment,并建立具体域论模型。

问题
如何为传名调用的渐进类型化给出统一的逻辑与类型论基础,并从语义上刻画动态类型、类型转换和类型错误?
方法
引入渐进类型与项动态性的判断,以泛性质定义核心构造;结合外延性原则证明渐进保证唯一决定多数 cast 行为,并用预序范畴 equipment 及由 2-范畴构造的语义模型解释该理论。
评估
通过语义论证和具体域论模型进行理论评估:展示标准 cast 行为由渐进保证唯一确定,并给出解释渐进类型论的 equipment 构造及其域论实例。
原文摘要(Abstract)

We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism, which were developed in blame calculi and to state the "gradual guarantee" theorem of gradual typing. Combined with the ordinary extensionality ($\eta$) principles that type theory provides, we show that most of the standard operational behavior of casts is uniquely determined by the gradual guarantee. This provides a semantic justification for the definitions of casts, and shows that non-standard definitions of casts must violate these principles. Our type theory is the internal language of a certain class of preorder categories called equipments. We give a general construction of an equipment interpreting gradual type theory from a 2-category representing non-gradual types and programs, which is a semantic analogue of Findler and Felleisen's definitions of contracts, and use it to build some concrete domain-theoretic models of gradual typing.

链接与引用

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

BibTeX
@article{NewL19,
  title = {Call-by-name Gradual Type Theory},
  author = {Max S. New and Daniel R. Licata},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 16, Issue 1},
  year = {2020},
  doi = {10.23638/lmcs-16(1:7)2020}
}