English
Related papers

Related papers: An Equational Logical Framework for Type Theories

200 papers

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

To adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them, as well as inferences drawn about these objects and relationships as the…

Computation and Language · Computer Science 2018-07-17 Joseph Corneli , Ursula Martin , Dave Murray-Rust , Gabriela Rino Nesin , Alison Pease

Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…

Category Theory · Mathematics 2025-12-05 Drew Flieder

Bayesian probability theory is used as a framework to develop a formalism for the scientific method based on principles of inductive reasoning. The formalism allows for precise definitions of the key concepts in theories of physics and also…

Data Analysis, Statistics and Probability · Physics 2011-09-12 Roberto C. Alamino

Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…

Quantum Physics · Physics 2015-06-05 E. D. Vol

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…

Logic in Computer Science · Computer Science 2016-09-09 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

The semantics of extensional type theory has an elegant categorical description: models of extensional =-types, 1-types, and Sigma-types are biequivalent to finitely complete categories, while adding Pi-types yields locally Cartesian closed…

Logic · Mathematics 2026-03-03 Daniël Otten , Matteo Spadetto

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

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

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

This is an introduction to Homotopy Type Theory and Univalent Foundations for philosophers, written as a chapter for the book "Categories for the Working Philosopher" (ed. Elaine Landry)

Logic · Mathematics 2016-01-28 Michael Shulman

Humans can generate reasonable answers to novel queries (Schulz, 2012): if I asked you what kind of food you want to eat for lunch, you would respond with a food, not a time. The thought that one would respond "After 4pm" to "What would you…

Artificial Intelligence · Computer Science 2022-10-05 Felix A. Sosa , Tomer Ullman

We apply a framework developed by C. S. Peirce to analyze the concept of clarity, so as to examine a pair of rival mathematical approaches to a typical result in analysis. Namely, we compare an intuitionist and an infinitesimal approaches…

Logic · Mathematics 2014-04-24 Karin U. Katz , Mikhail G. Katz , Taras Kudryk

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

Logic in Computer Science · Computer Science 2013-05-06 Christian Retoré

We introduce $\infty$-type theories as an $\infty$-categorical generalization of the categorical definition of type theories introduced by the second named author. We establish analogous results to the previous work including the…

Category Theory · Mathematics 2022-05-03 Hoang Kim Nguyen , Taichi Uemura

Futrell and Mahowald (2025) frame the success of neural language models (LMs) as supporting gradient, usage-based linguistic theories. I argue that LMs can also instantiate theories based on formal structures - the types of theories seen in…

Computation and Language · Computer Science 2026-05-12 R. Thomas McCoy

The classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then it is placed into the framework of evidence theory. Several authors like Laskey, Lehner (1989) and Provan (1990) already…

Artificial Intelligence · Computer Science 2013-03-08 Jurg Kohlas , Paul-Andre Monney

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…

Logic in Computer Science · Computer Science 2025-12-22 Chris Kapulkin , Yufeng Li

The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…

Logic in Computer Science · Computer Science 2011-02-08 Bas Spitters , Eelis van der Weegen