Related papers: Large and Infinitary Quotient Inductive-Inductive …
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,…
Algebraic quantum field theory, or AQFT for short, is a rigorous analysis of the structure of relativistic quantum mechanics. It is formulated in terms of a net of operator algebras indexed by regions of a Lorentzian manifold. In several…
In recent papers and books, a global quantization has been developed for unimodular groups of type I. It involves operator-valued symbols defined on the product between the group $\mathsf{G}$ and its unitary dual $\widehat{\mathsf{G}}$,…
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
This note introduces the theory of quasimaps to GIT quotients with intuition and concrete examples, with the goal of explaining a closed formula for the quasimap $I$-function. Along the way, it emphasizes aspects of this story that…
Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…
${\rm CTT}_{\rm qe}$ is a version of Church's type theory that includes quotation and evaluation operators that are similar to quote and eval in the Lisp programming language. With quotation and evaluation it is possible to reason in ${\rm…
Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing…
Rewriting Induction (RI) is a principle to prove that an equation over terms is an inductive theorem of a rewrite system, i.e., that any ground instance of the equation is a theorem of the rewrite system. RI has been adapted to several…
A $Q$-manifold $M$ is a supermanifold endowed with an odd vector field $Q$ squaring to zero. The Lie derivative $L_Q$ along $Q$ makes the algebra of smooth tensor fields on $M$ into a differential algebra. In this paper, we define and study…
In recent years, languages like Haskell have seen a dramatic surge of new features that significantly extends the expressive power of their type systems. With these features, the challenge of kind inference for datatype declarations has…
The fitting problem for conjunctive queries (CQs) is the problem to construct a CQ that fits a given set of labeled data examples. When a fitting CQ exists, it is in general not unique. This leads us to proposing natural refinements of the…
This paper extends the dual calculus with inductive types and coinductive types. The paper first introduces a non-deterministic dual calculus with inductive and coinductive types. Besides the same duality of the original dual calculus, it…
A new approach to the semantics of identity types in intensional Martin-L\"of type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original…
This is a continuation of our earlier works \cite{KhrypchenkoWei, Yang20211, Yang20212} with respect to (non-)linear Lie-type derivations of finitary incidence algebras. Let $X$ be a pre-ordered set, $\mathcal{R}$ be a $2$-torsionfree and…
We introduce a category of $q$-oscillator representations over the quantum affine superalgebras of type $D$ and construct a new family of its irreducible representations. Motivated by the theory of super duality, we show that these…
In this short note we construct two families of examples of large stratifying systems in module categories of algebras. The first examples consists on stratifying systems of infinite size in the module category of an algebra $A$. In the…
EI-categories are a simultaneous generalisation of finite groups and finite quivers without oriented cycles. It is therefore a natural question to ask for a characterisation of finite representation type. For special classes of…
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and…