← 研踪 PaperTrailarXiv: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
摘要
Most type systems are designed to verify safety properties: the judgement holds if 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 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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 holds if 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 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.
查看此版本解读 →查看此版本原文 ↗