Computational Higher Type Theory III: Univalent Universes and Exact Equality
نویسندگان
چکیده
This is the third in a series of papers extending Martin-Löf’s meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higherdimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types; exact equality and other pretypes lacking Kan structure; and a cumulative hierarchy of pretype universes. As in Parts I and II, the main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false. This establishes the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.
منابع مشابه
Two-Level Type Theory and Applications
We define and develop two-level type theory, a version of MartinLöf type theory which is able to combine two type theories. In our case of interest, the first of these two theories is homotopy type theory (HoTT) which may include univalent universes and higher inductive types. The second is a traditional form of type theory validating uniqueness of identity proofs (UIP) and may be understood as...
متن کاملOn the complexities of polymorphic stream equation systems, isomorphism of finitary inductive types, and higher homotopies in univalent universes
This thesis is composed of three separate parts. The first part deals with definability and productivity issues of equational systems defining polymorphic stream functions. The main result consists of showing such systems composed of only unary stream functions complete with respect to specifying computable unary polymorphic stream functions. The second part deals with syntactic and semantic no...
متن کاملThe universe U n is not an n - type Nicolai Kraus Christian Sattler
We show that, in Martin-Löf Type Theory with a hierarchy of univalent universes, the universe Un is not an n-type. At the same time, our construction leads to an n+1-type that is not an n-type, solving one of the open problems of the Univalent Foundations Program in Princeton. A formalized version of the proof is available. Background to these Notes One of the most basic consequences of the uni...
متن کاملCartesian Cubical Type Theory
We present a cubical type theory based on the Cartesian cube category (faces, degeneracies, symmetries, diagonals, but no connections or reversal) with univalent universes, each containing Π, Σ, path, identity, natural number, boolean, pushout, and glue (equivalence extension) types. The type theory includes a syntactic description of a uniform Kan operation, along with judgemental equality rul...
متن کاملFrom Reversible Programs to Univalent Universes and Back
We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming language to paths in the univalent universe; and combinator optimizations in the programming language to 2-paths in the univalent universe. The result suggests a si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.01800 شماره
صفحات -
تاریخ انتشار 2017