Saved in:
Bibliographic Details
Main Authors: Benjamin, Thibaut, Markakis, Ioannis, Offord, Wilfred, Sarti, Chiara, Vicary, Jamie
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2501.11620
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913835952111616
author Benjamin, Thibaut
Markakis, Ioannis
Offord, Wilfred
Sarti, Chiara
Vicary, Jamie
author_facet Benjamin, Thibaut
Markakis, Ioannis
Offord, Wilfred
Sarti, Chiara
Vicary, Jamie
contents We define a naturality construction for the operations of weak omega-categories, as a meta-operation in a dependent type theory. Our construction has a geometrical motivation as a local tensor product with a directed interval, and behaves logically as a globular analogue of Reynolds parametricity. Our construction operates as a ``power tool'' to support construction of terms with geometrical structure, and we use it to define composition operations for cylinders and cones in omega-categories. The machinery can generate terms of high complexity, and we have implemented our construction in a proof assistant, which verifies that the generated terms have the correct type. All our results can be exported to homotopy type theory, allowing the explicit computation of complex path type inhabitants.
format Preprint
id arxiv_https___arxiv_org_abs_2501_11620
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Naturality for higher-dimensional path types
Benjamin, Thibaut
Markakis, Ioannis
Offord, Wilfred
Sarti, Chiara
Vicary, Jamie
Category Theory
Logic in Computer Science
We define a naturality construction for the operations of weak omega-categories, as a meta-operation in a dependent type theory. Our construction has a geometrical motivation as a local tensor product with a directed interval, and behaves logically as a globular analogue of Reynolds parametricity. Our construction operates as a ``power tool'' to support construction of terms with geometrical structure, and we use it to define composition operations for cylinders and cones in omega-categories. The machinery can generate terms of high complexity, and we have implemented our construction in a proof assistant, which verifies that the generated terms have the correct type. All our results can be exported to homotopy type theory, allowing the explicit computation of complex path type inhabitants.
title Naturality for higher-dimensional path types
topic Category Theory
Logic in Computer Science
url https://arxiv.org/abs/2501.11620