A parametricity-based formalization of semi-simplicial and semi-cubical sets

Abstract Semi-simplicial and semi-cubical sets are commonly defined as presheaves over, respectively, the semi-simplex or semi-cube category. Homotopy type theory then popularized an alternative definition, where the set of $n$ -simplices or $n$ -cubes are instead regrouped into the families of the fibers over their faces, leading to a characterization we call indexed . Moreover, it is known that semi-simplicial and semi-cubical sets are related to iterated Reynolds parametricity, respectively, in their unary and binary variants. We exploit this correspondence to develop an original uniform indexed definition of both augmented semi-simplicial and semi-cubical sets, and fully formalize it in Coq.

Authors

Institutions

Publication Details

Journal
Mathematical Structures in Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1017/s096012952500009x
Citations
1
Primary Topic
Homotopy and Cohomology in Algebraic Topology
Type
article
Field-Weighted Citation Impact
3.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A parametricity-based formalization of semi-simplicial and semi-cubical sets

Ramkumar Ramachandra, Hugo Herbelin
1 citations
Mathematical Structures in Computer Science
Homotopy and Cohomology in Algebraic Topology
3.69
article

A parametricity-based formalization of semi-simplicial and semi-cubical sets

Ramkumar Ramachandra, Hugo Herbelin
article en
1 citations

Abstract

Abstract Semi-simplicial and semi-cubical sets are commonly defined as presheaves over, respectively, the semi-simplex or semi-cube category. Homotopy type theory then popularized an alternative definition, where the set of $n$ -simplices or $n$ -cubes are instead regrouped into the families of the fibers over their faces, leading to a characterization we call indexed . Moreover, it is known that semi-simplicial and semi-cubical sets are related to iterated Reynolds parametricity, respectively, in their unary and binary variants. We exploit this correspondence to develop an original uniform indexed definition of both augmented semi-simplicial and semi-cubical sets, and fully formalize it in Coq.

Mathematical Structures in Computer ScienceVol. 35
Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Université Paris Cité (FR), Sorbonne Paris Cité (FR), Institut de Recherche en Informatique Fondamentale (FR)
Sustainable cities and communities
Openalex Percentile: Top 9%
Homotopy and Cohomology in Algebraic Topology
3.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.