Related papers: Concrete categories and higher-order recursion (Wi…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
We generalise sheaf models of intuitionistic logic to univalent type theory over a small category with a Grothendieck topology. We use in a crucial way that we have constructive models of univalence, that can then be relativized to any…
Category theory is famous for its innovative way of thinking of concepts by their descriptions, in particular by establishing universal properties. Concepts that can be characterized in a universal way receive a certain quality seal, which…
We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…
Let X be a quasi-compact scheme, equipped with an open covering by affine schemes. A quasi-coherent sheaf on X gives rise, by taking sections over the covering sets, to a diagram of modules over the various coordinate rings. The resulting…
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,…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…
The higher direct image complex of a coherent sheaf (or finite complex of coherent sheaves) under a projective morphism is a fundamental construction that can be defined via a Cech complex or an injective resolution, both inherently…
We extend Langton's valuative criterion for families of coherent algebraic sheaves to a complex analytic set-up. As a consequence we derive a set of sufficient conditions for the compactness of a moduli space of semistable sheaves over a…
Selinger gave a superoperator model of a first-order quantum programming language and proved that it is fully definable and hence fully abstract. This paper proposes an extension of the superoperator model to higher-order programs based on…
The purpose of this paper is to develop an efficient computational model for Abelian categories of coherent sheaves over certain classes of varieties. These categories are naturally described as Serre quotient categories. Hence, our…
Dependent pattern matching is a key feature in dependently typed programming. However, there is a theory-practice disconnect: while many proof assistants implement pattern matching as primitive, theoretical presentations give semantics to…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the notion of guardedness classifies well-behavedness of cycles…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We consider smooth algebraic varieties with ample either canonical or anticanonical sheaf. We prove that such a variety is uniquely determined by its derived category of coherent sheaves. We also calculate the group of exact…
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
We prove that the bounded derived category of coherent sheaves with proper support is equivalent to the category of locally-finite, cohomological functors on the perfect derived category of a quasi-projective scheme over a field. We…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…