Related papers: Constructing Infinitary Quotient-Inductive Types

Gradual dependent types can help with the incremental adoption of dependently typed code by providing a principled semantics for imprecise types and proofs, where some parts have been omitted. Current theories of gradual dependent types,…

Irreducible representations of both Leavitt and Cohn path algebras of an arbitrary digraph with coefficients in a commutative field is classified. They are constructed in several ways using both infinite paths on the right as well as direct…

We consider associative algebras with involution graded by a finite abelian group G over a field of characteristic zero. Suppose that the involution is compatible with the grading. We represent conditions permitting PI-representability of…

We consider irreducible representations of finite quandles over $\mathbb{C}$. For $Q$ a finite quandle whose inner automorphism group $Inn(Q)$ have trivial Schur multipliers, we prove that the irreducible representations of $Q$ can be…

Subfactor theory provides a tool to analyze and construct extensions of Quantum Field Theories, once the latter are formulated as local nets of von Neumann algebras. We generalize some of the results of [LR95] to the case of extensions with…

We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We introduce a new diagrammatic $\Bbbk$-linear monoidal supercategory $QWeb^\bullet$, the affine web supercategory of type $Q$, where $\Bbbk$ is a commutative ring of characteristic not two. This category is the affinization of the web…

We use the theory of q-characters to establish a number of short exact sequences in the category of finite-dimensional representations of the quantum affine groups of types A and B. That allows us to introduce a set of 3-term recurrence…

This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

We give a new Jacobi--Trudi-type formula for characters of finite-dimensional irreducible representations in type $C_n$ using characters of the fundamental representations and non-intersecting lattice paths. We give equivalent determinant…

We classify the irreducible representations of a family of finite-dimensional pointed liftings $H_\lambda$ of the Nichols algebra associated with the diagram $A_2$ with parameter $q=-1$. We show that these algebras have infinite…

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

We diagonalize the Hilbert space of some subclass of the quasifinite module of the \Winf algebra. States are classified according to their eigenvalues for infinitely many commuting charges and the Young diagrams. The parameter dependence of…

Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in…

It is well-known that a quiver Q of type A_n is representation-finite, and that its indecomposable representations are thin (all Jordan-Hoelder multiplicities are 0 or 1). By now, various methods of proof are known. The aim of this note is…

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

We define a simple dependent type theory and prove that its well-formed types correspond exactly to finite inverse categories.

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…