English
Related papers

Related papers: Strictification of weakly stable type-theoretic st…

200 papers

We employ the resource theory of generalized contextuality as a tool for analyzing the structure of prepare-and-measure scenarios. We argue that this framework simplifies proofs of quantum contextuality in complex scenarios and strengthens…

Quantum Physics · Physics 2023-11-29 Rafael Wagner , Roberto D. Baldijão , Alisson Tezzin , Bárbara Amaral

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

Functional Analysis · Mathematics 2023-10-26 Ángel Chávez , Stephan Ramon Garcia , Jackson Hurley

Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…

Applied Physics · Physics 2021-08-26 Michel Fruchart , Claudia Yao , Vincenzo Vitelli

Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…

Logic · Mathematics 2021-02-23 Farida Kachapova

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

Logic in Computer Science · Computer Science 2024-02-05 Thibaut Benjamin , Eric Finster , Samuel Mimram

Stable event structures, and their duality with prime algebraic domains arising as partial orders of configurations, are a landmark of concurrency theory, providing a clear characterisation of causality in computations. They have been used…

Logic in Computer Science · Computer Science 2020-11-19 Paolo Baldan , Andrea Corradini , Fabio Gadducci

We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…

Category Theory · Mathematics 2024-07-08 Eric Finster , Alex Rice , Jamie Vicary

We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…

Logic in Computer Science · Computer Science 2010-09-16 Herman Geuvers , Robbert Krebbers , James McKinna , Freek Wiedijk

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…

Logic · Mathematics 2019-08-20 Saharon Shelah , Alexander Usvyatsov

We prove that the category $\textbf{G-Cat}$ of small categories with $G$-action forms a model of unstable $G$-global homotopy theory for every discrete group $G$, generalizing Schwede's global model structure on $\textbf{Cat}$. As a…

Algebraic Topology · Mathematics 2024-10-03 Tobias Lenz

Let $G$ be a connected reductive group acting on a complex vector space $V$ and projective space ${\mathbb P}V$. Let $x\in V$ and ${\cal H}\subseteq {\cal G}$ be the Lie algebra of its stabilizer. Our objective is to understand points…

Representation Theory · Mathematics 2022-01-04 Bharat Adsul , Milind Sohoni , K V Subrahmanyam

The dependently-typed lambda calculus LF is often used as a vehicle for formalizing rule-based descriptions of object systems. Proving properties of object systems encoded in this fashion requires reasoning about formulas over LF typing…

Logic in Computer Science · Computer Science 2025-10-01 Chase Johnson , Gopalan Nadathur

Session types employ a linear type system that ensures that communication channels cannot be implicitly copied or discarded. As a result, many mechanizations of these systems require modeling channel contexts and carefully ensuring that…

Programming Languages · Computer Science 2023-09-25 Chuta Sano , Ryan Kavanagh , Brigitte Pientka

We propose a novel method for modeling data by using structural models based on economic theory as regularizers for statistical models. We show that even if a structural model is misspecified, as long as it is informative about the…

Econometrics · Economics 2020-06-15 Jiaming Mao , Zhesheng Zheng

We study a new type of higher categorical structure, called weakly globular n-fold category, previously introduced by the author. We show that this structure is a model of weak n-categories by proving that it is suitably equivalent to the…

Category Theory · Mathematics 2016-09-15 Simona Paoli

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

We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…

Optimization and Control · Mathematics 2022-08-02 Alexander Davydov , Saber Jafarpour , Francesco Bullo

Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…

Category Theory · Mathematics 2010-02-05 M. R. Gould

Contextual type theory distinguishes between bound variables and meta-variables to write potentially incomplete terms in the presence of binders. It has found good use as a framework for concise explanations of higher-order unification,…

Logic in Computer Science · Computer Science 2011-11-02 Mathieu Boespflug , Brigitte Pientka

Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…

Logic in Computer Science · Computer Science 2024-12-18 C. B. Aberlé
‹ Prev 1 3 4 5 6 7 10 Next ›