Internal Parametricity for Cubical Type Theory
Abstract
We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory supports both univalence and its relational equivalent, which we call relativity. We demonstrate the use of the theory by analyzing polymorphic functions between higher inductive types, observe how cubical equality regularizes parametric type theory, and examine the similarities and discrepancies between cubical and parametric type theory, which are closely related. We also abstract a formal interface to the computational interpretation and show that this also has a presheaf model.
 Publication:

arXiv eprints
 Pub Date:
 May 2020
 DOI:
 10.48550/arXiv.2005.11290
 arXiv:
 arXiv:2005.11290
 Bibcode:
 2020arXiv200511290C
 Keywords:

 Computer Science  Logic in Computer Science;
 F.3.2;
 D.3.1
 EPrint:
 Logical Methods in Computer Science, Volume 17, Issue 4 (November 3, 2021) lmcs:6503