arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.03744cs.LO
收藏

保护依赖类型论的指称语义

Denotational semantics for guarded dependent type theory

Aleš Bizjak, Rasmus Ejlers Møgelberg

摘要:

我们提出了一个新的模型的保护依赖类型论(GDTT),一个类型论与保护递归和多个时钟,其中一个可以编程,共归纳类型的原因。递归定义的共归纳程序和证明的生产力是使用保护递归编码在类型中的,因此可以模块化地检查,不像现代证明助手中实现的语法检查。该模型基于一类时间对象的协变预层,并使用时钟的预层对时钟进行量化建模。为了模拟时钟无关性公理,这对于使用共归纳类型进行编程至关重要,类型必须被解释为与时钟对象正交的预层。在依赖类型的情况下,这转化为提升条件,类似于在类型论的同伦理论模型中发现的提升条件,但在这里具有提升唯一性的额外要求。由于在这个模型中标准的Hofmann-Streicher构造定义的宇宙不满足这个性质,GDTT中的宇宙必须通过时钟变量的上下文来索引。我们展示了如何模拟这些宇宙的方式,时钟上下文的夹杂物引起的夹杂物的宇宙与类型操作的鼻子。

英文摘要:

We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs is encoded in types using guarded recursion, and can therefore be checked modularly, unlike the syntactic checks implemented in modern proof assistants. The model is based on a category of covariant presheaves over a category of time objects, and quantification over clocks is modelled using a presheaf of clocks. To model the clock irrelevance axiom, crucial for programming with coinductive types, types must be interpreted as presheaves orthogonal to the object of clocks. In the case of dependent types, this translates to a lifting condition similar to the one found in homotopy theoretic models of type theory, but here with an additional requirement of uniqueness of lifts. Since the universes defined by the standard Hofmann-Streicher construction in this model do not satisfy this property, the universes in GDTT must be indexed by contexts of clock variables. We show how to model these universes in such a way that inclusions of clock contexts give rise to inclusions of universes commuting with type operations on the nose.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑