English
Related papers

Related papers: Typal Heterogeneous Equality Types

200 papers

We introduce the notion of a logical model category which is a Quillen model category satisfying some additional conditions. Those conditions provide enough expressive power that one can soundly interpret dependent products and sums in it.…

Logic · Mathematics 2012-08-30 Peter Arndt , Chris Kapulkin

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

Category Theory · Mathematics 2022-05-16 Iosif Petrakis

We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…

Logic · Mathematics 2020-07-08 Håkon Robbestad Gylterud

We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic…

Logic in Computer Science · Computer Science 2021-02-02 Benno van den Berg , Martijn den Besten

Types over a discrete valued field $(K,v)$ are computational objects that parameterize certain families of monic irreducible polynomials in $K_v[x]$, where $K_v$ is the completion of $K$ at $v$. Two types are considered to be equivalent if…

Number Theory · Mathematics 2015-07-27 Enric Nart

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do…

Logic in Computer Science · Computer Science 2019-03-14 Nicolai Kraus , Martín Escardó , Thierry Coquand , Thorsten Altenkirch

We contribute XTT, a cubical reconstruction of Observational Type Theory which extends Martin-L\"of's intensional type theory with a dependent equality type that enjoys function extensionality and a judgmental version of the unicity of…

Logic in Computer Science · Computer Science 2021-04-20 Jonathan Sterling , Carlo Angiuli , Daniel Gratzer

This paper investigates Voevodsky's univalence axiom in intensional Martin-L\"of type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various…

Logic in Computer Science · Computer Science 2019-11-20 Ian Orton , Andrew M. Pitts

We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…

Logic · Mathematics 2017-09-26 Adam Kwela , Jacek Tryba

We translate properties of the Sigma-type in Martin-L\"of Type Theory (MLTT) to properties of the Grothendieck construction in category theory. Namely, equivalences in MLTT that involve the Sigma-type motivate isomorphisms between…

Category Theory · Mathematics 2021-09-10 Iosif Petrakis

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened "homotopy type theory". In this…

Logic · Mathematics 2012-10-23 Álvaro Pelayo , Michael A. Warren

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

Logic · Mathematics 2007-05-23 Wayne Aitken , Jeffrey A. Barrett

We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…

Category Theory · Mathematics 2021-07-13 Michael Shulman

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

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

We discuss how canonical and universal constructions, properties and characterizations interact with equality in the framework of Homotopy Type Theory, comparing it with Grothendieck's use of equality and shedding further light on…

Logic · Mathematics 2026-04-02 Thomas Eckl

The mainstream approach to the development of ontologies is merging ontologies encoding different information, where one of the major difficulties is that the heterogeneity motivates the ontology merging but also limits high-quality merging…

Artificial Intelligence · Computer Science 2023-04-26 Daqian Shi , Fausto Giunchiglia