Related papers: Constructing Infinitary Quotient-Inductive Types

It is common to model inductive datatypes as least fixed points of functors. We show that within the Cedille type theory we can relax functoriality constraints and generically derive an induction principle for Mendler-style lambda-encoded…

Let $W$ be a finite Weyl group of classical type which may not be irreducible, $F$ an algebraically closed field, $q$ an invertible element of $F$. We denote by $\mathcal H_W(q)$ the associated Hecke algebra. If $q=1$ then it is $FW$ and we…

We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…

We construct continuum many infinite, simple, characteristic quotients of non-abelian free groups, answering a 1978 question of James Wiegold. The method is very flexible, allowing to impose certain properties on the quotients, to…

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

We prove some basic results about irreducible components of varieties of modules for an arbitrary finitely generated associative algebra. Our work generalizes results of Kac and Schofield on representations of quivers, but our methods are…

We will introduce the notion of inductive limits of compact quantum groups as $W^*$-bialgebras equipped with some additional structures. We also formulate their unitary representation theories. Those give a more explicit…

We introduce a proof-theoretic approach to showing nondefinability of second-order intuitionistic connectives by quantifier-free schemata. We apply the method to prove that Taranovsky's "realizability disjunction" connective does not admit…

We present AlgCo (Algebraic Coinductives), a practical framework for inductive reasoning over commonly used coinductive types such as conats, streams, and infinitary trees with finite branching factor. The key idea is to exploit the notion…

The goals of this article are as follows: (1) To determine the irreducible components of the affine varieties parametrizing the representations of $ \Lambda $ with dimension vector d, where $ \Lambda $ traces a major class of finite…

We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

Let ${\bf G}$ be a connected reductive algebraic group defined over a finite field $\mathbb{F}_q$ of $q$ elements, and ${\bf B}$ be a Borel subgroup of ${\bf G}$ defined over $\mathbb{F}_q$. Let $\Bbbk$ be a field and we assume that…

In sequential functional languages, sized types enable termination checking of programs with complex patterns of recursion in the presence of mixed inductive-coinductive types. In this paper, we adapt sized types and their metatheory to the…

We study the character theory of inductive limits of $q$-deformed classical compact groups. In particular, we clarify the relationship between the representation theory of Drinfeld-Jimbo quantized universal enveloping algebras and our…

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has…

Invertibility is an important concept in category theory. In higher category theory, it becomes less obvious what the correct notion of invertibility is, as extra coherence conditions can become necessary for invertible structures to have…

Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…

In Martin-L\"of's Intensional Type Theory, identity type is a heavily used and studied concept. The reason for that is the fact that it's responsible for the recently discovered connection between Type Theory and Homotopy Theory. The main…

We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions…

We present a rich type system with subtyping for an extension of System F. Our type constructors include sum and product types, universal and existential quantifiers, inductive and coinductive types. The latter two size annotations allowing…