English
Related papers

Related papers: Canonicity and normalisation for Dependent Type Th…

200 papers

It has long been recognized that lattice gauge theory formulations, when applied to general relativity, conflict with the invariance of the theory under diffeomorphisms. Additionally, the traditional lattice field theory approach consists…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Rodolfo Gambini , Jorge Pullin

In this paper we formalize some foundation concepts and theorems of group theory in a variant of type theory called the Calculus of Constructions with Definitions. In this theory we introduce definition of a group, which is both general and…

Logic · Mathematics 2021-02-19 Farida Kachapova

We present Voevodsky's construction of a model of univalent type theory in the category of simplicial sets. To this end, we first give a general technique for constructing categorical models of dependent type theory, using universes to…

Logic · Mathematics 2026-02-06 Chris Kapulkin , Peter LeFanu Lumsdaine

The causal perturbation theory is an axiomatic perturbative theory of the S-matrix. This formalism has as its essence the following axioms: causality, Lorentz invariance and asymptotic conditions. Any other property must be showed via the…

High Energy Physics - Theory · Physics 2017-09-25 R. Bufalo , B. M. Pimentel , D. E. Soto

Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors…

Category Theory · Mathematics 2021-05-17 Iosif Petrakis

G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…

Logic in Computer Science · Computer Science 2023-11-01 Gilles Dowek , Alexandre Miquel

We study rack and quandle coverings from a universal algebraic viewpoint and we show how they can be understood using the notion of strongly abelian congruences. We provide an abstract characterization of several particular types of…

Group Theory · Mathematics 2021-01-18 Marco Bonatto , David Stanovský

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…

Logic · Mathematics 2023-06-22 Benedikt Ahrens , Peter LeFanu Lumsdaine , Vladimir Voevodsky

Ulrich Berger presented a powerful proof of strong normalisation using domains, in particular it simplifies significantly Tait's proof of strong normalisation of Spector's bar recursion. The main contribution of this paper is to show that,…

Logic in Computer Science · Computer Science 2015-07-01 Thierry Coquand , Arnaud Spiwack

We describe a Martin-L\"of style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

Programming Languages · Computer Science 2019-01-14 Brigitte Pientka , Andreas Abel , Francisco Ferreira , David Thibodeau , Rebecca Zucchini

The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…

General Mathematics · Mathematics 2017-02-16 Esse Koudam

We apply the ``consistent discretization'' technique to the Regge action for (Euclidean and Lorentzian) general relativity in arbitrary number of dimensions. The result is a well defined canonical theory that is free of constraints and…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Rodolfo Gambini , Jorge Pullin

We adapt the commutator theory of universal algebra to the particular setting of racks and quandles, exploiting a Galois connection between congruences and certain normal subgroups of the displacement group. Congruence properties such as…

Group Theory · Mathematics 2020-03-19 Marco Bonatto , David Stanovský

We derive for generally covariant theories the generic dependency of observables on the original fields, corresponding to coordinate-dependent gauge fixings. This gauge choice is equivalent to a choice of intrinsically defined coordinates…

General Relativity and Quantum Cosmology · Physics 2009-10-29 J. M. Pons , D. C. Salisbury , K. A. Sundermeyer

This short note is devoted to the Hamiltonian analysis of the normalized general relativity and recently proposed model of vacuum energy sequestering. The common property of these models is the presence of the global variables. We discuss…

High Energy Physics - Theory · Physics 2015-06-23 J. Kluson

We develop a notion of causal order on a generic manifold as independent of the underlying differential and topological structure. We show that sufficiently regular causal orders can be recovered from a distinguished algebra of sets, which…

Mathematical Physics · Physics 2024-03-06 Antonio Capolupo , Aniello Quaranta

We examine the connections between deterministic, complete, and general global optimisation of continuous functions and a general concept of regression from the perspective of constructive type theory via the concept of 'searchability'. We…

Logic in Computer Science · Computer Science 2020-06-24 Dan R. Ghica , Todd Waugh Ambridge

Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…

Quantum Physics · Physics 2015-06-04 John R. Klauder

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…

Logic in Computer Science · Computer Science 2017-01-11 Lars Birkedal , Rasmus E. Møgelberg , Rasmus Lerchedahl Petersen

We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type…

Logic in Computer Science · Computer Science 2021-12-14 Deivid Vale , Niels van der Weide