Related papers: Concrete categories and higher-order recursion (Wi…
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…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
We develop a theory of general sheaves over weighted projective lines. We define and study a canonical decomposition, analogous to Kac's canonical decomposition for representations of quivers, study subsheaves of a general sheaf, general…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
We study the cohomology theory of sheaf complexes for open embeddings of topological spaces and related subjects. The theory is situated in the intersection of the general Cech theory and the theory of derived categories. That is to say, on…
We give a detailed account of the theory of enrichment over a bicategory and show that it establishes a two-fold generalization of enrichment over both quantaloids and monoidal categories. We define complete B-categories, a generalization…
It has been common wisdom among mathematicians that Extended Topological Field Theory in dimensions higher than two is naturally formulated in terms of n-categories with n> 1. Recently the physical meaning of these higher categorical…
We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…
This book provides an inviting tour through sheaf theory, from the perspective of applied category theory and pitched at a less specialized audience than is typical with introductions to sheaves. The book makes it as easy as possible for…
For a relational Horn theory $\mathbb{T}$, we provide useful sufficient conditions for the exponentiability of objects and morphisms in the category $\mathbb{T}\text{-}\mathsf{Mod}$ of $\mathbb{T}$-models; well-known examples of such…
We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a…
A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the category DCPO. In this paper we present three such monads and a general…
We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…
Whereas formal category theory is classically considered within a $2$-category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of augmented virtual double categories, a notion…
In this paper we introduce constructible analogs of the discrete complexity classes $\mathbf{VP}$ and $\mathbf{VNP}$ of sequences of functions. The functions in the new definitions are constructible functions on $\mathbb{R}^n$ or…
Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
Given a graded monoid A with 1, one can construct a projective monoid scheme MProj(A) analogous to Proj(R) of a graded ring R. This paper is concerned with the study of quasicoherent sheaves (of pointed sets) on MProj(A), and we prove…
An elementary theory of strict $\infty $-categories with application to concrete duality is given. New examples of first and second order concrete duality are presented.
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…