English
Related papers

Related papers: Open Horn Type Theory

200 papers

This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on the proof of the existence of free models of theories of Horn clauses over Rational Pavelka predicate logic. We define the…

Logic · Mathematics 2017-05-29 Vicent Costa , Pilar Dellunde

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

We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…

Category Theory · Mathematics 2026-02-19 Thibaut Benjamin , Camil Champin , Ioannis Markakis

In this paper we construct new categorical models for the identity types of Martin-L\"of type theory, in the categories Top of topological spaces and SSet of simplicial sets. We do so building on earlier work of Awodey and Warren, which has…

Logic · Mathematics 2011-10-17 Benno van den Berg , Richard Garner

Higher-order constrained Horn clauses (HoCHC) are a semantically-invariant system of higher-order logic modulo theories. With semi-decidable unsolvability over a semi-decidable background theory, HoCHC is suitable for safety verification.…

Formal Languages and Automata Theory · Computer Science 2021-09-13 Jerome Jochems

Horn clauses and first-order resolution are commonly used to implement type classes in Haskell. Several corecursive extensions to type class resolution have recently been proposed, with the goal of allowing (co)recursive dictionary…

Programming Languages · Computer Science 2016-12-09 František Farka , Ekaterina Komendantskaya , Kevin Hammond

The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the…

Logic in Computer Science · Computer Science 2012-10-26 Florent Madelaine , Barnaby Martin

We propose to study proof search from a coinductive point of view. In this paper, we consider intuitionistic logic and a focused system based on Herbelin's LJT for the implicational fragment. We introduce a variant of lambda calculus with…

Logic in Computer Science · Computer Science 2013-09-05 José Espírito Santo , Ralph Matthes , Luís Pinto

Let $K$ be a compact, connected, simply-connected simple Lie group. Given two conjugacy classes $\Orb_1$ and $\Orb_2$ in $K$, we consider the multiplicative Horn question: What conjugacy classes are contained in $\Orb_1\cdot\Orb_2$? It is…

Algebraic Geometry · Mathematics 2013-10-29 Nicolas Ressayre

Let $A$ be a separable $C^*$-algebra and $B$ a stable $C^*$-algebra containing a strictly positive element. We show that the group $\Ext(SA,B)$ of unitary equivalence classes of extensions of $SA$ by $B$, modulo the extensions which are…

Operator Algebras · Mathematics 2007-05-23 V. Manuilov , K. Thomsen

We propose a novel, path-based reasoning approach for the multi-hop reading comprehension task where a system needs to combine facts from multiple passages to answer a question. Although inspired by multi-hop reasoning over knowledge…

Computation and Language · Computer Science 2019-07-10 Souvik Kundu , Tushar Khot , Ashish Sabharwal , Peter Clark

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

Logic · Mathematics 2019-06-25 Egbert Rijke

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…

Logic in Computer Science · Computer Science 2017-03-31 Paweł Parys

We study the problem of existence and uniqueness of homotopy colimits in stable representation theory, where one typically does not have model category structures to guarantee that these homotopy colimits exist or have good properties. We…

Algebraic Topology · Mathematics 2013-03-18 A. Salch

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 2018-04-19 Bassel Mannaa , Rasmus Ejlers Møgelberg

Verification problems of programs written in various paradigms (such as imperative, logic, concurrent, functional, and object-oriented ones) can be reduced to problems of solving Horn clause constraints on predicate variables that represent…

Programming Languages · Computer Science 2016-10-24 Hiroshi Unno , Sho Torii

For a sequence of unital tracial $C^*$-algebras $(A_n,\tau_n),$ we construct a canonical central extension of the unitary group $U(\ell^\infty (\mathbb{N},A_n)/c_0(\mathbb{N},A_n))$ by…

Operator Algebras · Mathematics 2025-03-11 Marius Dadarlat , Forrest Glebe

The classical Hopf invariant is an invariant of homotopy classes of maps from $S^{4n-1} $ to $S^{2n}$, and is an important invariant in homotopy theory. The goal of this paper is to use the Koszul duality theory for $E_n$-operads to define…

Algebraic Topology · Mathematics 2020-12-16 Felix Wierstra

Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although…

Programming Languages · Computer Science 2017-08-02 Toby Cathcart Burn , C. -H. Luke Ong , Steven J. Ramsay

Cubical type theories are designed around an abstract unit interval from which types of paths, used to represent equalities, are defined. Varying the operations available on this interval yields different type theories. A reversal is an…

Logic in Computer Science · Computer Science 2026-05-15 Evan Cavallo , Christian Sattler
‹ Prev 1 8 9 10 Next ›