English
Related papers

Related papers: Open Horn Type Theory

200 papers

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types)…

Logic in Computer Science · Computer Science 2021-04-30 Toby Cathcart Burn , Luke Ong , Steven Ramsay , Dominik Wagner

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

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

Logic in Computer Science · Computer Science 2024-02-05 Thibaut Benjamin , Eric Finster , Samuel Mimram

Holographic strange metals are known to have a power law resistivity rising with temperature, which is reminiscent of the strange metal phases in condensed matter systems. In some holographic models, however, the exponent of the power law…

High Energy Physics - Theory · Physics 2019-06-26 Tomas Andrade , Alexander Krikun

Gradual dependent types can help with the incremental adoption of dependently typed code by providing a principled semantics for imprecise types and proofs, where some parts have been omitted. Current theories of gradual dependent types,…

Programming Languages · Computer Science 2022-05-04 Joseph Eremondi , Ronald Garcia , Éric Tanter

The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the…

Logic · Mathematics 2017-10-17 Christopher J. Eagle , Franklin D. Tall

We describe the categorical semantics for a simply typed variant and a simplified dependently typed variant of Cocon, a contextual modal type theory where the box modality mediates between the weak function space that is used to represent…

Logic in Computer Science · Computer Science 2023-06-06 Jason Z. S. Hu , Brigitte Pientka , Ulrich Schöpp

A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…

Logic · Mathematics 2026-01-14 James Carr

We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of…

Logic in Computer Science · Computer Science 2017-05-02 Andrej Bauer , Jason Gross , Peter LeFanu Lumsdaine , Mike Shulman , Matthieu Sozeau , Bas Spitters

In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element.…

Category Theory · Mathematics 2017-01-27 Egbert Rijke

In 2008, Loday shed light on the existence of Hopf-Boreltheorems for operads. Using the vocabulary of category theory, Livernet,Mesablishvili and Wisbauer extended such theorems to monads. In bothcases, the reasoning was to start from a…

Combinatorics · Mathematics 2019-01-09 Emily Burgunder , Bérénice Delcroix-Oger

We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…

Representation Theory · Mathematics 2022-03-18 Tashi Walde

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

Combinatorics · Mathematics 2024-03-28 Jan Dreier , Nikolas Mählmann , Szymon Toruńczyk

A procedure for constructing bivariant theories by means of Grothendieck duality is developed. This produces, in particular, a bivariant theory of Hochschild (co)homology on the category of schemes that are flat, separated and essentially…

Algebraic Geometry · Mathematics 2015-11-20 Leovigildo Alonso Tarrío , Ana Jeremías López , Joseph Lipman

In this paper, we show that two constructions form stacks: Firstly, as one varies the $\infty$-topos, $\mathcal{X}$, Lurie's homotopy theory of higher categories internal to $\mathcal{X}$ varies in such a way as to form a stack over the…

Symplectic Geometry · Mathematics 2015-07-01 David Li-Bland

The program of internal type theory seeks to develop the categorical model theory of dependent type theory using the language of dependent type theory itself. In the present work we study internal homotopical type theory by relaxing the…

Logic in Computer Science · Computer Science 2025-08-08 Joshua Chen

We propose to use orthologic as the basis for designing type systems supporting intersection, union, and negation types in the presence of subtyping assumptions. We show how to extend orthologic to support monotonic and antimonotonic…

Programming Languages · Computer Science 2025-07-15 Simon Guilloud , Viktor Kunčak

We prove a general version of the homological perturbation lemma which works in the presence of curvature, and without the restriction to strong deformation retracts, building on work of Markl. A key observation is that the notion of strong…

Algebraic Topology · Mathematics 2020-02-05 Matthew Hogancamp

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…

Category Theory · Mathematics 2024-12-18 Thibaut Benjamin , Ioannis Markakis , Chiara Sarti