Notions of parametricity as monoidal models for type theory

09/02/2022
by   Hugo Moeneclaey, et al.
0

This article gives a solid theoretical grounding to the observation that cubical structures arise naturally when working with parametricity. We claim that cubical models are cofreely parametric. We use categories, lex categories or clans as models of type theory. In this context we define notions of parametricity as monoidal models, and parametric models as modules. This covers not only the usual parametricity where any type comes with a relation, but also variants where it comes with a predicate, a reflexive relation, two relations, and many more. In this setting we prove that forgetful functors from parametric models to arbitrary ones have left and right adjoints. Moreover we give explicit compact descriptions for these freely and cofreely parametric models. Then we give many examples of notion of parametricity, allowing to build the following as cofreely parametric models: - Categories of cubical objects for any variant of cube. - Lex categories of truncated semi-cubical (or cubical with reflexivities only) objects. - Clans of Reedy fibrant semi-cubical (or cubical with reflexivities only) objects.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Arboreal Categories: An Axiomatic Theory of Resources

We introduce arboreal categories, which have an intrinsic process struct...
research
12/16/2022

The Formal Theory of Monads, Univalently

We study the formal theory of monads, as developed by Street, in univale...
research
07/25/2023

Parametric Subtyping for Structural Parametric Polymorphism

We study the interaction of structural subtyping with parametric polymor...
research
05/17/2018

Presheaf Models of Relational Modalities in Dependent Type Theory

This report is an extension of 'A Model of Parametric Dependent Type The...
research
03/27/2018

Univalent polymorphism

We show that Martin Hyland's effective topos can be exhibited as the hom...
research
06/27/2022

Definable and Non-definable Notions of Structure

Definability is a key notion in the theory of Grothendieck fibrations th...
research
11/22/2021

Functorial aggregation

Aggregating data in a database could also be called "integrating along f...

Please sign up or login with your details

Forgot password? Click here to reset