跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.13471 · v1

Context Types: Bunched Modalities for Unifying Safety and Reachability

首次提交 2026-11-10 10:31
版本更新 2026-11-10 10:31
雷达观测 2026-11-11 11:04
arXiv ↗PDF ↗

摘要

Most type systems are designed to verify safety properties: the judgement e:τe : τ holds if ee may evaluate to any value contained in the denotation of ττ, but nothing more. More recent type systems have considered the complementary class of reachability properties: in these systems, the typing judgment holds if ee must be able to evaluate to every value denoted by ττ, and possibly more. This paper introduces a refinement type system for higher-order functional programs where types can capture both safety and reachability properties. Simultaneously supporting both is challenging because each imposes different constraints on how variable bindings in a typing context are interpreted. We address this challenge by treating typing contexts as a kind of resource that mediates which capabilities are available when typing a program. We formalize this notion by developing a resource algebra of contextual capabilities and a bunched modal context logic over this algebra. We then interpret our type system in this logic, establishing soundness with respect to a denotational semantics that unifies safety and reachability guarantees within a single typing judgement.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 10:31 · 最新观测版本

Context Types: Bunched Modalities for Unifying Safety and Reachability

Most type systems are designed to verify safety properties: the judgement e:τe : τ holds if ee may evaluate to any value contained in the denotation of ττ, but nothing more. More recent type systems have considered the complementary class of reachability properties: in these systems, the typing judgment holds if ee must be able to evaluate to every value denoted by ττ, and possibly more. This paper introduces a refinement type system for higher-order functional programs where types can capture both safety and reachability properties. Simultaneously supporting both is challenging because each imposes different constraints on how variable bindings in a typing context are interpreted. We address this challenge by treating typing contexts as a kind of resource that mediates which capabilities are available when typing a program. We formalize this notion by developing a resource algebra of contextual capabilities and a bunched modal context logic over this algebra. We then interpret our type system in this logic, establishing soundness with respect to a denotational semantics that unifies safety and reachability guarantees within a single typing judgement.

查看此版本解读 →查看此版本原文 ↗