Related papers: Quotients, inductive types, and quotient inductive…
We identify Whittaker vectors for $\mathcal{W}_k(\mathfrak{g})$-modules with partition functions of higher Airy structures. This implies that Gaiotto vectors, describing the fundamental class in the equivariant cohomology of a suitable…
We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…
In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which the…
Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…
We classify the quasifinite highest weight modules over a family of subalgebras W_{\infty}^{n} of the central extension W_{1+\infty} of the Lie algebra of differential operators on the circle consisting of operators of order \geq n. We…
We develop a cofibrantly generated model category structure in the category of topological spaces in which weak equivalences are A-weak equivalences and such that the generalized CW(A)-complexes are cofibrant objects. With this structure…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
De Concini, Kac, and Procesi defined a family of subalgebras Uq[w] of the quantized enveloping algebra Uq(g) associated to elements w in the Weyl group of a simple Lie algebra g. These algebras are called quantum Schubert cell algebras. We…
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…
There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…
We introduce a dependent type theory whose models are weak {\omega}-categories, generalizing Brunerie's definition of {\omega}-groupoids. Our type theory is based on the definition of {\omega}-categories given by Maltsiniotis, himself…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
For a finite acyclic quiver $Q$ and the corresponding preprojective algebra $\Pi$, we study the factor algebra $\Pi_w$ associated with a element $w$ in the Coxeter group introduced by Buan-Iyama-Reiten-Scott. The algebra $\Pi_w$ has a…
Logical frameworks can be used to translate proofs from a proof system to another one. For this purpose, we should be able to encode the theory of the proof system in the logical framework. The Lambda Pi calculus modulo theory is one of…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
We introduce the notion of a $(\Pi,\lambda)$-structure on a C-system and show that C-systems with $(\Pi,\lambda)$-structures are constructively equivalent to contextual categories with products of families of types. We then show how to…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…
We have determined composition series of a class of induced representations appearing in Moeglin Tadi\'c classification of discrete series. The result is further used to determine composition series of certain representations induced from…
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…