English
Related papers

Related papers: A parametricity-based formalization of semi-simpli…

200 papers

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…

Logic · Mathematics 2022-01-26 Hugo Moeneclaey

We introduce a new cubical model for homotopy types. More precisely, we'll define a category Qs with the following features: Qs is a PROP containing the classical box category as a subcategory, the category Qs-Set of presheaves of sets on…

Algebraic Topology · Mathematics 2009-10-27 Samuel B. Isaacson

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

Logic in Computer Science · Computer Science 2017-01-24 Patricia Johann , Kristina Sojakova

We introduce a general notion of $J$-tribe, and construct the $J$-tribe of $J$-frames in a given tribe $\mathcal{T}$, where $J$ a suitable generalized direct category. This construction applies to semi-cubical diagrams for a category of…

Category Theory · Mathematics 2026-02-25 El Mehdi Cherradi

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…

Logic in Computer Science · Computer Science 2022-09-05 Hugo Moeneclaey

This is an exposition of homotopical results on the geometric realization of semi-simplicial spaces. We then use these to derive basic foundational results about classifying spaces of topological categories, possibly without units. The…

Algebraic Topology · Mathematics 2019-08-21 Johannes Ebert , Oscar Randal-Williams

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…

Algebraic Topology · Mathematics 2025-12-23 Daniel Carranza , Chris Kapulkin

The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…

Category Theory · Mathematics 2016-10-24 Emily Riehl

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

Algebraic Topology · Mathematics 2021-09-20 Sanjeevi Krishnan , Crichton Ogle

A simplicial set is said to be non-singular if its non-degenerate simplices are embedded. Let $sSet$ denote the category of simplicial sets. We prove that the full subcategory $nsSet$ whose objects are the non-singular simplicial sets…

Algebraic Topology · Mathematics 2020-01-16 Vegard Fjellbo

We introduce Displayed Type Theory (dTT), a multi-modal homotopy type theory with discrete and simplicial modes. In the intended semantics, the discrete mode is interpreted by a model for an arbitrary $\infty$-topos, while the simplicial…

Category Theory · Mathematics 2026-01-14 Astra Kolomatskaia , Michael Shulman

Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…

Logic in Computer Science · Computer Science 2016-10-19 Bas Spitters

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

We prove a version of Quillen's theorems for a map of semi-Segal spaces. We construct a bi-semi-simplicial resolution similar to the one associated to a functor of non-unital topological categories. As a consequence we can represent the…

Algebraic Topology · Mathematics 2024-11-19 Yuxun Sun

We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…

Algebraic Geometry · Mathematics 2026-05-27 Cesar Hilario , Stefan Schröer

We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…

Algebraic Topology · Mathematics 2026-05-18 Melissa Wei

To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…

Category Theory · Mathematics 2007-05-23 Lucian M. Ionescu

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

Group Theory · Mathematics 2025-03-10 Philip Hackney , Justin Lynd

Simplicial sets generalise many categories of graphs. In this paper, we give a complete characterisation of the Lawvere-Tierney topologies on (semi-)simplicial sets, on bicolored graphs, and on fuzzy sets. We apply our results to establish…

Logic in Computer Science · Computer Science 2024-11-11 Aloïs Rosset , Helle Hvid Hansen , Jörg Endrullis
‹ Prev 1 2 3 10 Next ›