Related papers: Normalization for Cubical Type Theory

An approach to Schubert calculus is to realize Schubert classes as concrete combinatorial objects such as Schubert polynomials. Using the polytope ring of the Gelfand-Tsetlin polytopes, Kiritchenko-Smirnov-Timorin realized each Schubert…

We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories. The algorithm has a type-directed phase for applying extensionality rules and a normalization phase based on…

Traditional category theory is typically based on set-theoretic principles and ideas, which are often non-constructive. An alternative approach to formalizing category theory is to use E-category theory, where hom sets become setoids. Our…

We classify canonical algebras such that for every dimension vector of a regular module the corresponding module variety is normal (respectively, a complete intersection). We also prove that for the dimension vectors of regular modules…

We give a new construction of free distributive p-algebras. Our construction relies on a detailed description of completely meet-irreducible congruences, so it is purely universal algebraic. It yields a normal form theorem for p-algebra…

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and…

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…

The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential…

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Certain quantization problems are equivalent to the construction of morphisms from "quantum" to "classical" props. Once such a morphism is constructed, Hensel's lemma shows that it is in fact an isomorphism. This gives a new, simple proof…

The calculus of constructions (CC) is a core theory for dependently typed programming and higher-order constructive logic. Originally introduced in Coquand's 1985 thesis, CC has inspired 25 years of research in programming languages and…

We introduce a universe of regular datatypes with variable binding information, for which we define generic formation and elimination (i.e. induction /recursion) operators. We then define a generic alpha-equivalence relation over the types…

We introduce pseudocubical objects with pseudoconnections in an arbitrary category, obtained from the Brown-Higgins structure of a cubical object with connections by suitably relaxing their identities, and construct a cubical analog of the…

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

We introduce the notion of Q-filtrable varieties: projective varieties with a torus action and a finite number of fixed points, such that the cells of the associated Bialynicki-Birula decomposition are all rationally smooth. Our main…

In the present paper, we propose a new axiomatic approach to nonstandard analysis and its application to the general theory of spatial structures in terms of category theory. Our framework is based on the idea of internal set theory, while…