Related papers: Constructing Infinitary Quotient-Inductive Types
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
In recent work we have shown how it is possible to define very precise type systems for object-oriented languages by abstractly compiling a program into a Horn formula f. Then type inference amounts to resolving a certain goal w.r.t. the…
In the first part of this paper, we prove the existence of torsion free covers in the category of representations of quivers, $(Q,R-Mod)$, for a wide class of quivers included in the class of the so-called source injective representation…
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 define the concept of an affinized projective variety and show how one can, in principle, obtain q-identities by different ways of computing the Hilbert series of such a variety. We carry out this program for projective varieties…
We study the representation theory of quantizations of Gieseker moduli spaces. Namely, we prove the localization theorems for these algebras, describe their finite dimensional representations and two-sided ideals as well as their categories…
In this paper we study finite W-algebras for basic classical superalgebras and Q(n) associated to the regular even nilpotent coadjoint orbits. We prove that this algebra satisfies the Amitsur-Levitzki identity and therefore all its…
Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), which is the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…
Dependent types allow us to express precisely what a function is intended to do. Recent work on Quantitative Type Theory (QTT) extends dependent type systems with linearity, also allowing precision in expressing when a function can run.…
This article first provides an algorithm W based type inference algorithm for an affine type system. Then the article further assumes the language equipped with the above type system uses lazy evaluation, and explores the possibility of…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…
This paper uses previous results of the authors on vector-valued modular forms to study certain non-congruence modular forms. We prove that these forms have unbounded denominators, and in certain cases we verify congruences of…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
This paper deals with sufficiency conditions for irreducibility of certain induced modules. We also construct irreducible representations for a group $G$ over a field ${\mathbb K}$ where the group $G$ is a semidirect product of a normal…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Let Q be a connected directed quiver with n vertices. We show that Q is representation-infinite if and only if there do exist n isomorphism classes of exceptional modules of some fixed length at least 2.