Related papers: Constructing Infinitary Quotient-Inductive Types

We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving…

We give a new interpretation of representation theory of the finite-dimensional half-integer weight modules over the queer Lie superalgebra $\mathfrak{q}(n)$. It is given in terms of Brundan's work of finite-dimensional integer weight…

The notion of quantized characters is introduced in our previous paper as a natural quantization of characters in the context of asymptotic representation theory for compact quantum groups. As in the case of ordinary groups, the…

The Dependent Object Types (DOT) calculus incorporates concepts from functional languages (e.g. modules) with traditional object-oriented features (e.g. objects, subtyping) to achieve greater expressivity (e.g. F-bounded polymorphism).…

We study the Jacobi-Trudi-type determinant which is conjectured to be the q-character of a certain, in many cases irreducible, finite-dimensional representation of the quantum affine algebra of type D_n. Unlike the A_n and B_n cases, a…

In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory, and spatial and cohesive type theory. In this…

The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…

An elementary proof is given for the existence of infinite dimensional abelian subalgebras in quantum W-algebras. In suitable realizations these subalgebras define the conserved charges of various quantum integrable systems. We consider all…

We develop an analog of the exponential families of Wilf in which the label sets are finite dimensional vector spaces over a finite field rather than finite sets of positive integers. The essential features of exponential families are…

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory. Our normalization result is reduction-free, in the sense of yielding a bijection…

Bernardy et al. [2018] proposed a linear type system $\lambda^q_\to$ as a core type system of Linear Haskell. In the system, linearity is represented by annotated arrow types $A \to_m B$, where $m$ denotes the multiplicity of the argument.…

For a classical group over a non-archimedean local field of odd residual characteristic p, we construct all cuspidal representations over an arbitrary algebraically closed field of characteristic different from p, as representations induced…

We will introduce an $\mathbb{N}$-filtration on the negative part of a quantum group of type $A_n$, such that the associated graded algebra is a q-commutative polynomial algebra. This filtration is given in terms of the representation…

We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…

We investigate the injective types and the algebraically injective types in univalent mathematics, both in the absence and in the presence of propositional resizing. Injectivity is defined by the surjectivity of the restriction map along…

We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…

We use the theory of reduced determinant functors from [24] to give a new, computationally useful, description of the relative $K_0$-groups of orders in finite dimensional separable algebras that need not be commutative. By combining this…

A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer…

We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…