paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Models of Type Theory Based on Moore Paths

基于 Moore 路径的类型论模型
LMCS Volume 15, Issue 1(Type theory and constructive...)2019匹配度 1/10 · 该论文属于纯类型论与形式语义基础研究,讨论 Moore 路径上的 Martin-Löf 类型论模型,未涉及静态分析、程序分析、LLM/Agent 或浮点/贝叶斯程序分析;与用户研究方向仅有非常间接的形式化验证理论基础关联。引用 0 inbox
Ian Orton, Andrew M. Pitts
crossref: 2026-09-10

AI 速览

一句话:提出基于 Moore 路径的内涵 Martin-Löf 类型论模型,构造非截断模型且无需 Kan 填充条件。

本文为内涵 Martin-Löf 类型论引入一类新的模型。作者在 topos 中使用构造性有序代数,并用 Moore 路径的概念解释 identity types(同一类型)。通过考察一个特定的 gros topos,他们构造出一个非截断模型:任意深度的嵌套 identity type 都可以包含多于一个元素,而不仅仅在低维处有非平凡结构。与基于单纯集合和立方集合的既有非截断模型相比,该模型的主要特点是类型语义完全不需要 Kan 填充条件。该工作为类型论的高维模型提供了新视角,并展示了在无需 Kan 填充条件的情况下获得非截断语义的可能性。

问题
如何为内涵 Martin-Löf 类型论构造非截断模型,即所有维度都含非平凡结构,同时避免单纯/立方集合模型中的 Kan 填充条件。
方法
在 topos 中使用构造性有序代数,用 Moore 路径概念给出 identity types 的解释,并通过选取特定 gros topos 构造具体模型。
评估
通过在该 gros topos 中构造模型,证明其非截断性:任意嵌套深度的 identity type 都可有多个元素;并说明类型语义无需 Kan 填充条件。
原文摘要(Abstract)

This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos, we show that there is such a model that is non-truncated, i.e. contains non-trivial structure at all dimensions. In other words, in this model a type in a nested sequence of identity types can contain more than one element, no matter how great the degree of nesting. Although inspired by existing non-truncated models of type theory based on simplicial and cubical sets, the notion of model presented here is notable for avoiding any form of Kan filling condition in the semantics of types. Comment: This is a revised and expanded version of a paper with the same name that appeared in the proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)

链接与引用

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

BibTeX
@article{paperbot837,
  title = {Models of Type Theory Based on Moore Paths},
  author = {Ian Orton and Andrew M. Pitts},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 15, Issue 1},
  number = {Type theory and constructive...},
  year = {2019},
  doi = {10.23638/lmcs-15(1:2)2019}
}