• Corpus ID: 57373903

Parametric Cubical Type Theory

  title={Parametric Cubical Type Theory},
  author={Evan Cavallo and Robert Harper},
We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions between the two along the way. The combined theory supports both univalence and its relational equivalent, which we call relativity. We demonstrate the use of the theory by analyzing polymorphic types, including functions between higher inductive types, and we… 

Figures from this paper

Internal Parametricity for Cubical Type Theory

A computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives is defined, which supports both univalence and its relational equivalent, which is called relativity.

Higher Inductive Types and Parametricity in Cubical Type Theory

Cubical type theory is a novel extension of dependent type theory with a form of equality called a path. Path equality enjoys extensionality properties missing from traditional treatments of

Freedom for Proofs!

Representation independence allows programmers to give different implementations for an abstract interface. Reynolds’ characterization of representation independence for System F uses parametricity,

A Constructive Model of Directed Univalence in Bicubical Sets

This paper gives a constructive model of a directed type theory with directed univalence in bicubical, rather than bisimplicial, sets, and formalizes much of this model using Agda as the internal language of a 1-topos, following Orton and Pitts.

Gradualizing the Calculus of Inductive Constructions

A crucial trade-off is observed between graduality and the key properties of normalization and closure of universes under dependent product that CIC enjoys, which informs and paves the way towards the development of malleable proof assistants and dependently-typed programming languages.

The Marriage of Univalence and Parametricity

This work first clarifies the limitations of these two concepts when considered in isolation and then devises a fruitful marriage between both, which is an extension of parametricity strengthened with univalence that fully realizes programming and proving modulo equivalences.

Cubical Categories for Higher-Dimensional Parametricity Extended Version

A generalization of cubical sets is introduced, which is called cubical categories, and used to develop a framework for higher-dimensional parametricity, all the way up to and including infinity, which has the crucial property that if a model is p-parametric according to this definition, then it is l- parametric for every l < p.

Leibniz equality is isomorphic to Martin-Löf identity, parametrically

It is shown that the two definitions of equality are isomorphic: any proof of Leibniz equality can be converted to one of Martin-Löf identity and vice versa, and each conversion followed by the other is the identity.

Computational Semantics of Cartesian Cubical Type Theory

Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations

Principles of Program Verification for Arbitrary Monadic Effects. (Principes de la Vérification de Programmes à Effets Monadiques Arbitraires)

The goal of this thesis is to devise a principled semantic framework for verifying programs with arbitrary monadic effects in a generic way with respect to rich specifications, for properties such as program equivalence.



Higher inductive types in cubical computational type theory

This work extends the cartesian cubical computational type theory introduced by Angiuli et al. with a schema for indexed cubical inductive types (CITs), an adaptation of higher induction types to the cubical setting, and proves a canonicity theorem with respect to these values.

Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom

A type theory in which it is possible to directly manipulate n-dimensional cubes based on an interpretation of dependenttype theory in a cubical set model that enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system.

Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities

A dependent type theory organized around a Cartesian notion of cubes, supporting both fibrant and non-fibrant types, and is the first two-level type theory to satisfy the canonicity property: all closed terms of boolean type evaluate to either true or false.

Computational Higher Type Theory III: Univalent Universes and Exact Equality

The main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false, establishing the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.

A Model of Type Theory in Cubical Sets

A model of type theory with dependent product, sum, and identity, in cubical sets is presented, and is a step towards a computational interpretation of Voevodsky's Univalence Axiom.

A Computational Interpretation of Parametricity

This paper describes an extension of the Pure Type Systems with a special parametricity rule (with computational content), and proves fundamental properties such as Church-Rosser's and strong normalization.

Cubical Categories for Higher-Dimensional Parametricity

This paper shows that Reynolds' theory can be seen as the instantiation at dimension 1 of a theory of relational parametricity for System F that holds at all higher dimensions, including infinite dimension.

Computational higher-dimensional type theory

This work provides a direct, deterministic operational interpretation for a representative higher-dimensional dependent type theory with higher inductive types and an instance of univalence, and concludes that closed programs of boolean type evaluate to true or false.

Axioms for Modelling Cubical Type Theory in a Topos

This work clarifies the definition and properties of the notion of uniform Kan filling that lies at the heart of the constructive interpretation of Voevodsky's univalence axiom and shows that there is a range of topos-theoretic models of homotopy type theory in this style.

A Presheaf Model of Parametric Type Theory