Related papers: Cubical Syntax for Reflection-Free Extensional Equ…

We offer an axiomatic definition of a differential algebra of generalized functions over an algebraically closed non-Archimedean field. This algebra is of {\em Colombeau type} in the sense that it contains a copy of the space of Schwartz…

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do…

Lookup tables (finite maps) are a ubiquitous data structure. In pure functional languages they are best represented using trees instead of hash tables. In pure functional languages within constructive logic, without a primitive integer…

This is a short survey illustrating some of the essential aspects of the theory of canonical extensions. In addition some topological results about canonical extensions of lattices with additional operations in finitely generated varieties…

We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Classical (or Boolean) type theory is the type theory that allows the type inference $\sigma \to \bot) \to \bot => \sigma$ (the type counterpart of double-negation elimination), where $\sigma$ is any type and $\bot$ is absurdity type. This…

We classify extended Abelian Chern-Simons theories with gauge group $U(1)^n$ as extended $(2+1)$-dimensional topological quantum field theories. For an even integral nondegenerate lattice $(\Lambda,K)$, let $(G_K,q_K)$ denote its…

In this article the author endows the functor category [B(Z2),Gpd] with the structure of a type-theoretic fibration category with a univalent universe using the so-called injective model structure. It gives us a new model of Martin-L\"of…

We give a new constructive proof of homotopy canonicity for homotopy type theory (HoTT). Canonicity proofs typically involve gluing constructions over the syntax of type theory. We instead use a gluing construction over a "strict Rezk…

We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

We write down a new "logarithmic" quasicoherent category $\operatorname{Qcoh}_{log}(U, X, D)$ attached to a smooth open algebraic variety $U$ with toroidal compactification $X$ and boundary divisor $D$. This is a (large) symmetric monoidal…

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

We develop a denotational semantics for general reference types in an impredicative version of guarded homotopy type theory, an adaptation of synthetic guarded domain theory to Voevodsky's univalent foundations. We observe for the first…

For a fixed finite group $Q$ and semi-simple finite dimensional algebra $S$, we examine an equivalence between strongly $Q$-graded algebras (extensions) with identity component $S$ and $S^1$-gerbes on action groupoids of $Q$ on the set of…

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type…