paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Axioms for Modelling Cubical Type Theory in a Topos

在拓扑斯中建模立方类型理论的公理
LMCS vol.Volume 14, Issue 42018匹配度 1/10 · 该论文属于同伦类型论、立方类型论与拓扑斯语义的形式化研究,与用户关注的静态分析、LLM/Agent、浮点程序分析和贝叶斯程序分析均无直接关联。虽然形式化验证是其相关领域,但论文核心并非 AI 与 PL 交叉或程序分析。引用 19 inbox
Ian Orton, Andrew M. Pitts
crossref: 2026-09-10

AI 速览

一句话:给出一组弱公理,刻画可在任意拓扑斯内构造基于路径的立方类型理论模型所需条件,并澄清均匀 Kan 填充。

本文研究内涵类型理论的同伦式解释,即把等式证明视为路径。作者追问:在一个拓扑斯中,对象 I 需要满足哪些条件,才能给出以 I 为定义域的函数作为路径的类型论模型。Cohen、Coquand、Huber 与 Mörtberg 曾利用特定预层范畴构造此类模型;本文则考察这一构造在任意拓扑斯的内部类型论中可表达到何种程度,并为此识别出一组相当弱的公理。该公理化刻画澄清了均匀 Kan 填充的定义与性质,而均匀 Kan 填充正是他们构造性解释 Voevodsky 单值公理的核心。本文是发表于 CSL 2016 的同名论文的修订扩充版。

问题
如何以尽可能弱的公理,在任意拓扑斯内部描述基于路径的立方类型理论模型,从而刻画对象 I 应满足的条件。
方法
在拓扑斯的内部类型论中形式化分析 CCHM 预层模型构造,抽象出构造均匀 Kan 填充与路径模型所需的公理。
评估
通过公理化推导与模型构造说明公理的充分性,澄清均匀 Kan 填充及单值公理的构造性解释;属于形式化语义分析而非实验评估。
原文摘要(Abstract)

The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$. Cohen, Coquand, Huber and M\"ortberg give such a model using a particular category of presheaves. We investigate the extent to which their model construction can be expressed in the internal type theory of any topos and identify a collection of quite weak axioms for this purpose. This clarifies the definition and properties of the notion of uniform Kan filling that lies at the heart of their constructive interpretation of Voevodsky's univalence axiom. (This paper is a revised and expanded version of a paper of the same name that appeared in the proceedings of the 25th EACSL Annual Conference on Computer Science Logic, CSL 2016.)

链接与引用

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

BibTeX
@article{paperbot347,
  title = {Axioms for Modelling Cubical Type Theory in a Topos},
  author = {Ian Orton and Andrew M. Pitts},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 14, Issue 4},
  year = {2018},
  doi = {10.23638/lmcs-14(4:23)2018}
}