Related papers: Concrete categories and higher-order recursion (Wi…
We collect in one place a variety of known and folklore results in enriched model category theory and add a few new twists. The central theme is a general procedure for constructing a Quillen adjunction, often a Quillen equivalence, between…
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
Quantitative logic reasons about the degree to which formulas are satisfied. This paper studies the fundamental reasoning principles of higher-order quantitative logic and their application to reasoning about probabilistic programs and…
We show that metric abstract elementary classes (mAECs) are, in the sense of [LR] (i.e. arXiv:1404.2528), coherent accessible categories with directed colimits, with concrete $\aleph_1$-directed colimits and concrete monomorphisms. More…
We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
Models for categorical sequences typically assume exchangeable or first-order dependent sequence elements. These are common assumptions, for example, in models of computer malware traces and protein sequences. Although such simplifying…
In this paper, we try to realize the unbounded derived category of an abelian category as the homotopy category of a Quillen model structure on the category of unbounded chain complexes. We construct such a model structure based on…
We describe a semidefinite programming framework for proving upper bounds on concrete sifting problems, and show that the Large Sieve can be interpreted as a special case of this framework. With a small tweak, the Larger Sieve also falls…
In complex materials, numerous intertwined phenomena underlie the overall response at macroscale. These phenomena can pertain to different engineering fields (mechanical , chemical, electrical), occur at different scales, can appear as…
We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…
Let $R$ be a ring and Ch($R$) the category of chain complexes of $R$-modules. We put an abelian model structure on Ch($R$) whose homotopy category is equivalent to $K(Proj)$, the homotopy category of all complexes of projectives. However,…
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
In this article we construct a categorical resolution of singularities of an excellent reduced curve $X$, introducing a certain sheaf of orders on $X$. This categorical resolution is shown to be a recollement of the derived category of…
This manuscript presents a novel framework that integrates higher-order symmetries and category theory into machine learning. We introduce new mathematical constructs, including hyper-symmetry categories and functorial representations, to…
Modeling generics in object-oriented programming languages such as Java and C# is a challenge. Recently we proposed a new order-theoretic approach to modeling generics. Given the strong relation between order theory and category theory, in…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…