English
Related papers

Related papers: Extensional concepts in intensional type theory, r…

200 papers

A model of Martin-L\"of extensional type theory with universes is formalized in Agda, an interactive proof system based on Martin-L\"of intensional type theory. This may be understood, we claim, as a solution to the old problem of modelling…

Logic · Mathematics 2019-09-18 Erik Palmgren

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.

Logic · Mathematics 2012-02-24 Fredrik Engström , Juha Kontinen

Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax. Zsid\'o proves an initiality result for…

Logic in Computer Science · Computer Science 2015-07-01 Benedikt Ahrens

We give new estimates of lengths of extremal rays of birational type for toric varieties. We can see that our new estimates are the best by constructing some examples explicitly. As applications, we discuss the nefness and…

Algebraic Geometry · Mathematics 2020-08-19 Osamu Fujino , Hiroshi Sato

The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation…

Programming Languages · Computer Science 2013-06-18 Guillaume Allais , Pierre Boutillier , Conor McBride

We show that the intuitionistic first-order theory of equality has continuum many complete extensions. We also study the Vitali equivalence relation and show there are many intuitionistically precise versions of it.

Logic · Mathematics 2019-11-22 Wim Veldman

In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…

Logic in Computer Science · Computer Science 2017-04-27 G. A. Kavvos

We introduce a new model construction for Martin-L\"{o}f intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines the syntactic model with a notion of realizability; it also…

Logic · Mathematics 2012-05-25 Pieter Hofstra , Michael A. Warren

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin. One level is given by an intensional type theory, called Minimal type theory. This theory extends the set-theoretic version…

Logic · Mathematics 2024-04-04 Maria Emilia Maietti

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…

Logic · Mathematics 2026-02-04 Daniel Quigley

We provide a simple proof of the existence of internal Homs in the localization of the category of dg categories with respect to all quasi-equivalences and of some of their main properties such as the so-called derived Morita theory. This…

Algebraic Geometry · Mathematics 2022-11-29 Alberto Canonaco , Paolo Stellari

Hausdorff Morita equivalence is an equivalence relation on singular foliations, which induces a bijection between their leaves. Our main statement is that linearizability along a leaf is invariant under Hausdorff Morita equivalence. The…

Differential Geometry · Mathematics 2026-02-19 Marco Zambon

Hrushovski's suggestion, given in ["Groupoids, imaginaries and internal covers," Turkish Journal of Mathematics , 2012], to capture the structure of the 1-analysable covers of a theory T using simplicial groupoids definable in T is realized…

Logic · Mathematics 2024-02-15 Paul Z. Wang

We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features including record subtyping and combination of case branches. Our goal is…

Programming Languages · Computer Science 2025-07-23 Alex Hubers , Apoorv Ingle , Andrew Marmaduke , J. Garrett Morris

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

Logic · Mathematics 2018-01-08 Michael Rathjen

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an…

Computer Science and Game Theory · Computer Science 2010-01-26 Tony Bourdier , Horatiu Cirstea , Daniel Dougherty , Hélène Kirchner

A paraconsistent type theory (an extension of a fragment of intuitionistic type theory by adding opposite types) is here extended by adding co-function types. It is shown that, in the extended paraconsistent type system, the opposite type…

Logic in Computer Science · Computer Science 2022-04-11 Juan C. Agudelo-Agudelo , Andrés Sicard-Ramírez

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

In this paper we split every basic propositional connective into two versions, one is called extensional and the other one intensional. The extensional connectives are semantically characterized by standard truth conditions that are…

Logic in Computer Science · Computer Science 2022-04-15 Vít Punčochář , Berta Grimau