Related papers: Against Cumulative Type Theory
Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…
Motivated by random evolutions which do not start from equilibrium, in a recent work, Peligrad and Voln\'{y} (2018) showed that the quenched CLT (central limit theorem) holds for ortho-martingale random fields. In this paper, we study the…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
The purpose of the present study is to search one-dimensional Cellular Automata (CA) rules which will solve the density classification task (DCT) perfectly. The mathematical analysis of number conserving functions over binary strings of…
We prove a Central Limit Theorem (CLT) in the non-commutative setting of random matrix products where the underlying process is driven by a subshift of finite type (SFT) with Markov measure. We use the martingale method introduced by Y.…
We present XTT, a version of Cartesian cubical type theory specialized for Bishop sets \`a la Coquand, in which every type enjoys a definitional version of the uniqueness of identity proofs. Using cubical notions, XTT reconstructs many of…
In this work, we show that uniform integrability is not a necessary condition for central limit theorems (CLT) to hold for normalized multilevel Monte Carlo (MLMC) estimators and we provide near optimal weaker conditions under which the CLT…
In the impredicative type theory of System F ({\lambda}2), it is possible to create inductive data types, such as natural numbers and lists. It is also possible to create coinductive data types such as streams. They work well in the sense…
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…
Type theory can be described as a generalised algebraic theory. This automatically gives a notion of model and the existence of the syntax as the initial model, which is a quotient inductive-inductive type. Algebraic definitions of type…
In this paper, we introduce a Ketonen-type Gentzen-style classical simple type theory $\bf KCT$. Also the tableau system $\bf KCTT$ corresponding to $\bf KCT$ is introduced. Further inference-preserving Gentzen system $\bf KCT_h$…
A quantum analogue of the Central Limit Theorem (CLT) for bosonic system, first introduced by Cushen and Hudson (1971), states that the $n$-fold convolution $\rho^{\boxplus n}$ of an $m$-mode quantum state $\rho$, with zero first moments…
Let $\{(A_i,B_i)\}_{i=1}^{m}$ be a collection of pairs of sets with $|A_i|=a$ and $|B_i|=b$ for $1\leq i\leq m$. Suppose that $A_i\cap B_j=\emptyset$ if and only if $i=j$, then by the famous Bollob\'{a}s theorem, we have the size of this…
Gradually typed languages are designed to support both dynamically typed and statically typed programming styles while preserving the benefits of each. While existing gradual type soundness theorems for these languages aim to show that…
We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…
The problem of defining Semi-Simplicial Types (SSTs) in Homotopy Type Theory (HoTT) has been recognized as important during the Year of Univalent Foundations at the Institute of Advanced Study. According to the interpretation of HoTT in…
The hamiltonian BRST-anti-BRST theory is developed in the general case of arbitrary reducible first class systems. This is done by extending the methods of homological perturbation theory, originally based on the use of a single resolution,…
This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…
We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group $\text{SO}_m(\mathbb{C})$, given the FFT for $\text{O}_m(\mathbb{C})$. We then define, by means…
Traditional implementations of strongly-typed functional programming languages often miss the root cause of type errors. As a consequence, type error messages are often misleading and confusing - particularly for students learning such a…