English
Related papers

Related papers: Open Horn Type Theory

200 papers

The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…

Programming Languages · Computer Science 2025-11-21 Bohdan Liesnikov , David Binder , Tim Süberkrüb

The purpose of this paper is twofold: 1. we prove the triangulability of smooth orbifolds with corners, generalizing the same statement for orbifolds. 2. based on 1, we propose a new homology theory. We call it geometric homology theory…

Algebraic Topology · Mathematics 2023-05-30 Hao Yu

In this paper, we present a directed homotopy type theory for reasoning synthetically about (higher) categories, directed homotopy theory, and its applications to concurrency. We specify a new `homomorphism' type former for Martin-L\"of…

Logic in Computer Science · Computer Science 2018-07-30 Paige Randall North

In 1969 Artin and Mazur defined the \'etale homotopy type of an algebraic variety \cite{AMa69}. In this paper we define various obstructions to the local-global principle on a variety $X$ over a global field using the \'etale homotopy type…

Algebraic Geometry · Mathematics 2011-12-01 Yonatan Harpaz , Tomer M. Schlank

Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…

q-alg · Mathematics 2007-05-23 Martin Markl , Steve Shnider

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Computational Complexity · Computer Science 2026-05-28 Tristan Simas

We propose a framework for answering open domain multi-hop questions in which partial information is read and used to generate followup questions, to finally be answered by a pretrained single-hop answer extractor. This framework makes each…

Computation and Language · Computer Science 2020-02-28 Christopher Malon , Bing Bai

Given a suitable functor T:C -> D between model categories, we define a long exact sequence relating the homotopy groups of any X in C with those of TX, and use this to describe an obstruction theory for lifting an object G in D to C.…

Algebraic Topology · Mathematics 2007-05-23 David Blanc

Whilst mathematicians assume classical reasoning principles by default they often context switch when working, restricting themselves to various forms of subclassical reasoning. This pattern is especially common amongst logicians and set…

Logic in Computer Science · Computer Science 2023-02-21 Martin Berger , Dominic P. Mulligan

We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…

Category Theory · Mathematics 2017-04-26 Michael Shulman

Equivalence classes of gapped Hamiltonians compatible with given symmetry constraints, such as those underlying topological insulators, can be defined in many ways. For the non-chiral classes modelled by vector bundles over Brillouin tori,…

Mathematical Physics · Physics 2015-10-13 Guo Chuan Thiang

We explore an application of homological algebra to set theoretic objects by developing a cohomology theory for Hausdorff gaps. The cohomology theory is introduced with enough generality to be applicable to other questions in set theory.…

Logic · Mathematics 2016-09-06 Daniel Talayco

In this paper, we set up a rational homotopy theory for operads in simplicial sets whose term of arity one is not necessarily reduced to an operadic unit, extending results obtained by the author in the book "Homotopy of operads and…

Algebraic Topology · Mathematics 2018-10-19 Benoit Fresse

Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract…

Logic in Computer Science · Computer Science 2023-06-22 Bassel Mannaa , Rasmus Ejlers Møgelberg , Niccolò Veltri

We explore the ideas of open-closed-open triality within twisted holography. Starting from two transverse stacks of branes in the B-model on the resolved conifold, we obtain two equivalent open string descriptions. Both are full-fledged…

High Energy Physics - Theory · Physics 2026-05-05 Edward A. Mazenc , Debmalya Sarkar

The study of equality types is central to homotopy type theory. Characterizing these types is often tricky, and various strategies, such as the encode-decode method, have been developed. We prove a theorem about equality types of…

Logic · Mathematics 2019-05-16 Nicolai Kraus , Jakob von Raumer

We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…

Logic in Computer Science · Computer Science 2023-04-21 Rafaël Bocquet

We show that the Cantor-Schr\"oder-Bernstein Theorem for homotopy types, or $\infty$-groupoids holds in the following form: For any two types, if each one is embedded into the other, then they are equivalent. The argument is developed in…

Algebraic Geometry · Mathematics 2020-08-27 Martín Hötzel Escardó

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

Logic in Computer Science · Computer Science 2023-06-22 Vikraman Choudhury , Marcelo Fiore

Dual Horn clauses mirror key properties of Horn clauses. This paper explores the ``other side of the looking glass'' to reveal some expected and unexpected symmetries and their practical uses. We revisit Dual Horn clauses as enablers of a…

Computation and Language · Computer Science 2024-07-31 Paul Tarau