English
Related papers

Related papers: Constructing Higher Inductive Types as Groupoid Qu…

200 papers

The groupoid of finite sets has a "canonical" structure of a symmetric 2-rig with the sum and product respectively given by the coproduct and product of sets. This 2-rig $\widehat{\mathbb{F}\mathbb{S} et}$ is just one of the many…

Category Theory · Mathematics 2020-04-21 Josep Elgueta

We develop realizability models of intensional type theory, based on groupoids, wherein realizers themselves carry non-trivial (non-discrete) homotopical structure. In the spirit of realizability, this is intended to formalize a homotopical…

Logic in Computer Science · Computer Science 2024-05-30 Sam Speight

Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain…

Logic in Computer Science · Computer Science 2022-06-06 Magnus Baunsgaard Kristensen , Rasmus Ejlers Møgelberg , Andrea Vezzosi

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…

Algebraic Topology · Mathematics 2010-09-28 Ali Pakdaman , Hamid Torabi , Behrooz Mashayekhy

We first revisit the construction of Quinn's finite total homotopy TQFT, which depends on the choice of a homotopy finite space, $\boldsymbol{B}$. This constitutes a vast generalisation of the Dijkgraaf-Witten TQFT, with a trivial cocycle,…

Category Theory · Mathematics 2025-05-30 João Faria Martins , Timothy Porter

We present our library for Universal Algebra in the UniMath framework dealing with multi-sorted signatures, their algebras, and the basics for equation systems. We show how to implement term algebras over a signature without resorting to…

Logic in Computer Science · Computer Science 2025-02-12 Gianluca Amato , Matteo Calosci , Marco Maggesi , Cosimo Perini Brogi

This paper constructs a novel Hopf algebra $\mathsf{cf}(\mathrm{UT}_{\bullet})$ on the class functions of the unipotent upper triangular groups $\mathrm{UT}_{n}(\mathbb{F}_{q})$ over a finite field. This construction is representation…

Combinatorics · Mathematics 2022-11-17 Lucas Gagnon

Let $H$ and $L$ be quantum groupoids. If $H$ has a quasitriangular structure, then we show that $L$ induces a Hopf algebra $C_{L}(L_s)$ in the category $_{H}\mathcal{M}$, which generalizes the transmutation theory introduced by Majid.…

Rings and Algebras · Mathematics 2015-01-13 Xuan Zhou , Tao Yang

Let $A$ and $H$ be two Hopf algebras. We shall classify up to an isomorphism that stabilizes $A$ all Hopf algebras $E$ that factorize through $A$ and $H$ by a cohomological type object ${\mathcal H}^{2} (A, H)$. Equivalently, we classify up…

Quantum Algebra · Mathematics 2014-02-24 A. L. Agore , C. G. Bontea , G. Militaru

We study induced model structures on Frobenius categories. In particular we consider the case where $\mathcal{C}$ is the category of comodules of a supercommutative Hopf algebra $A$ over a field $k$. Given a graded Hopf algebra quotient $A…

Representation Theory · Mathematics 2021-02-05 Thorsten Heidersdorf , Rainer Weissauer

Real numbers in constructive mathematics have always seemed to require compromises of one form or another. Classical proofs of Cauchy completeness require countable choice, Bishop's setoid construction introduces persistent bookkeeping…

Logic in Computer Science · Computer Science 2026-04-29 Jackson Brough

We develop the usage of certain type theories as specification languages for algebraic theories and inductive types. We observe that the expressive power of dependent type theories proves useful in the specification of more complicated…

Logic in Computer Science · Computer Science 2023-09-12 András Kovács

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

We present a method for computing $\mathbb{A}^1$-homotopy invariants of singularity categories of rings admitting suitable gradings. Using this we describe any such invariant, e.g. homotopy K-theory, for the stable categories of…

K-Theory and Homology · Mathematics 2020-05-19 Sira Gratz , Greg Stevenson

We construct a category $\mathrm{HomCob}$ whose objects are {\it homotopically 1-finitely generated} topological spaces, and whose morphisms are {\it cofibrant cospans}. Given a manifold submanifold pair $(M,A)$, we prove that there exists…

Mathematical Physics · Physics 2022-09-01 Fiona Torzewska

We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…

Logic · Mathematics 2015-04-22 Steve Awodey , Nicola Gambino , Kristina Sojakova

Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-L\"of Type Theory include Quotient Inductive Types (QITs), which exist as instances of Higher Inductive Types, and functional extensionality,…

Programming Languages · Computer Science 2025-11-27 Yee-Jian Tan , Andreas Nuyts , Dominique Devriese

We generalise the construction of the Lie algebroid of a Lie groupoid so that it can be carried out in any tangent category. First we reconstruct the bijection between left invariant vector fields and source constant tangent vectors based…

Category Theory · Mathematics 2017-11-28 Matthew Burke

The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…

Category Theory · Mathematics 2021-10-07 Chaitanya Leena Subramaniam

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau