DeepAI AI Chat
Log In Sign Up

Parametricity and Semi-Cubical Types

by   Hugo Moeneclaey, et al.

We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not only for parametricity, but also for similar interpretations of type theory and in fact similar interpretations of any generalized algebraic theory. To be precise we consider a functor forgetting unary operations and equations defining them recursively in a generalized algebraic theory. We show that it has a right adjoint. We use techniques from locally presentable category theory, as well as from quotient inductive-inductive types.


page 1

page 2

page 3

page 4


About Opposition and Duality in Paraconsistent Type Theory

A paraconsistent type theory (an extension of a fragment of intuitionist...

Stable factorization from a fibred algebraic weak factorization system

We present a construction of stable diagonal factorizations, used to def...

An inductive-recursive universe generic for small families

We show that it is possible to construct a universe in all Grothendieck ...

Computational Higher Type Theory IV: Inductive Types

This is the fourth in a series of papers extending Martin-Löf's meaning ...

Structured Handling of Scoped Effects: Extended Version

Algebraic effects offer a versatile framework that covers a wide variety...

Domain Theory in Constructive and Predicative Univalent Foundations

We develop domain theory in constructive univalent foundations without V...

Strictly Associative and Unital ∞-Categories as a Generalized Algebraic Theory

We present the first definition of strictly associative and unital ∞-cat...