English
Related papers

Related papers: Internal Parametricity for Cubical Type Theory

200 papers

Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…

Category Theory · Mathematics 2024-07-26 Niels van der Weide , Nima Rasekh , Benedikt Ahrens , Paige Randall North

We introduce a framework for internal topological symmetries in quantum field theory, including "noninvertible symmetries" and "categorical symmetries". This leads to a calculus of topological defects which takes full advantage of…

High Energy Physics - Theory · Physics 2024-08-01 Daniel S. Freed , Gregory W. Moore , Constantin Teleman

We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.

Logic in Computer Science · Computer Science 2012-11-28 Chantal Keller , Marc Lasson

We formalize the quantum arithmetic, i.e. a relationship between number theory and operator algebras. Namely, it is proved that rational projective varieties are dual to the $C^*$-algebras with real multiplication. Our construction fits all…

Number Theory · Mathematics 2024-12-13 Igor V. Nikolaev

We define a variety of notions of cubical sets, based on sites organized using substructural algebraic theories presenting PRO(P)s or Lawvere theories. We prove that all our sites are test categories in the sense of Grothendieck, meaning…

Category Theory · Mathematics 2017-04-20 Ulrik Buchholtz , Edward Morehouse

The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…

Algebraic Topology · Mathematics 2023-10-03 Rolando Jimenez , Vladimir Vershinin , Yuri Muranov

This article is the first in a series of articles that explain the formalization of a constructive model of cubical type theory in Nuprl. In this document we discuss only the parts of the formalization that do not depend on the choice of…

Logic in Computer Science · Computer Science 2018-06-19 Mark Bickford

In this paper we determine the group of rational automorphisms of binary cubic and quartic forms with integer coefficients and non-zero discriminant in terms of certain quadratic covariants of cubic and quartic forms. This allows one to…

Number Theory · Mathematics 2019-11-12 Stanley Yao Xiao

The theory of matrix models is reviewed from the point of view of its relation to integrable hierarchies. Determinantal formulas, relation to conformal field models and the theory of Generalized Kontsevich model are discussed in some…

High Energy Physics - Theory · Physics 2016-09-06 A. Morozov

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

Logic in Computer Science · Computer Science 2017-03-16 Marcelo A. Aguilar , Rodolfo Conde

Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…

Logic in Computer Science · Computer Science 2015-07-01 Daniel M Leivant

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…

Logic · Mathematics 2011-11-10 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

In this note we show that Voevodsky's univalence axiom holds in the model of type theory based on symmetric cubical sets. We will also discuss Swan's construction of the identity type in this variation of cubical sets. This proves that we…

Logic · Mathematics 2017-10-31 Marc Bezem , Thierry Coquand , Simon Huber

In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…

Quantum Algebra · Mathematics 2007-05-23 Per K. Jakobsen , Valentin Lychagin

We pursue the view that quantum theory may be an emergent structure related to large space-time scales. In particular, we consider classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a…

General Relativity and Quantum Cosmology · Physics 2014-11-17 Hans-Thomas Elze

We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…

Quantum Physics · Physics 2010-05-27 Tomasz Paterek , Borivoje Dakic , Caslav Brukner

Typology is a subfield of linguistics that focuses on the study and classification of languages based on their structural features. Unlike genealogical classification, which examines the historical relationships between languages, typology…

Computation and Language · Computer Science 2025-04-30 Gerhard Jäger

Type qualifiers offer a lightweight mechanism for enriching existing type systems to enforce additional, desirable, program invariants. They do so by offering a restricted but effective form of subtyping. While the theory of type qualifiers…

Programming Languages · Computer Science 2024-02-27 Edward Lee , Yaoyu Zhao , James You , Kavin Satheeskumar , Ondřej Lhoták , Jonathan Brachthäuser