English
Related papers

Related papers: The internal languages of univalent categories

200 papers

We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We…

Logic in Computer Science · Computer Science 2026-04-03 Alejandro Díaz-Caro , Octavio Malherbe

This article investigates duals for bimodule categories over finite tensor categories. We show that finite bimodule categories form a tricategory and discuss the dualities in this tricategory using inner homs. We consider inner-product…

Quantum Algebra · Mathematics 2014-05-23 Gregor Schaumann

To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are…

Logic in Computer Science · Computer Science 2015-07-01 Gianluigi Bellin

This paper is an extended version of our proceedings paper announced at LICS'16; in order to complement it, this version is written from a different viewpoint including topos-theoretic aspect on our work. Technically, this paper introduces…

Category Theory · Mathematics 2017-01-23 Takeo Uramoto

We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…

Logic in Computer Science · Computer Science 2025-04-16 Thomas Ehrhard , Aymeric Walch

We extend the model structure on the category $\mathbf{Cat}(\mathcal{E})$ of internal categories studied by Everaert, Kieboom and Van der Linden to an algebraic model structure. Moreover, we show that it restricts to the category of…

Category Theory · Mathematics 2025-06-03 Calum Hughes

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

Stone locales together with continuous maps form a coreflective subcategory of spectral locales and perfect maps. A proof in the internal language of an elementary topos was previously given by the second-named author. This proof can be…

Logic in Computer Science · Computer Science 2025-08-13 Igor Arrieta , Martín Hötzel Escardó , Ayberk Tosun

We define an elementary $\infty$-topos that simultaneously generalizes an elementary topos and Grothendieck $\infty$-topos. We then prove it satisfies the expected topos theoretic properties, such as descent, local Cartesian closure,…

Category Theory · Mathematics 2022-01-11 Nima Rasekh

Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…

Logic in Computer Science · Computer Science 2023-08-17 Kobe Wullaert , Ralph Matthes , Benedikt Ahrens

Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…

Category Theory · Mathematics 2024-12-18 Elies Harington , Samuel Mimram

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…

Category Theory · Mathematics 2019-02-20 Benedikt Ahrens , Chris Kapulkin , Michael Shulman

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal…

Computational Complexity · Computer Science 2023-09-19 Bianca Truthe

For coalgebras $C$ and $D$, Takeuchi proved that the category of linear functors from $\mathfrak{M}^C$ to $\mathfrak{M}^D$ preserving small coproducts is equivalent to the category of $C$-$D$-bicomodules, where $\mathfrak{M}^C$ for a…

Quantum Algebra · Mathematics 2025-10-10 Taiki Shibata , Kenichi Shimizu

We argue that locally Cartesian closed categories form a suitable doctrine for defining dependent type theories, including non-extensional ones. Using the theory of sketches, one may define syntactic categories for type theories in a style…

Logic in Computer Science · Computer Science 2021-03-11 Daniel Gratzer , Jonathan Sterling

To an exact endofunctor of a triangulated category with a split-generator, the notion of entropy is given by Dimitrov-Haiden-Katzarkov-Kontsevich, which is a (possibly negative infinite) real-valued function of a real variable. In this…

Algebraic Geometry · Mathematics 2017-07-19 Kohei Kikuta , Atsushi Takahashi

We introduce $\infty$-type theories as an $\infty$-categorical generalization of the categorical definition of type theories introduced by the second named author. We establish analogous results to the previous work including the…

Category Theory · Mathematics 2022-05-03 Hoang Kim Nguyen , Taichi Uemura

Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory. Numerous such correspondences are known…

Formal Languages and Automata Theory · Computer Science 2017-02-27 Henning Urbat , Jiří Adámek , Liang-Ting Chen , Stefan Milius

We attach to each weak model category $\mathcal{M}$ a class of first order formulas about the fibrant objects of $\mathcal{M}$ whose validity is invariant under homotopies and weak equivalences. This is a generalization of the classical…

Category Theory · Mathematics 2025-10-06 César Bardomiano Martínez , Simon Henry