Related papers: A monad for full ground reference cells
For a small involutive quantaloid $\mathcal{Q}$, it is shown that the category of separated complete $\mathcal{Q}$-categories and left adjoint $\mathcal{Q}$-functors is strictly monadic over the category of symmetric…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the…
This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic and non-deterministic computation. The FMC…
The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to combine the delay monad with the monads of these effects.…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…
The functor that takes a ring to its category of modules has an adjoint if one remembers the forgetful functor to abelian groups: the endomorphism ring of linear natural transformations. This uses the self-enrichment of the category of…
Recent advancements in foundation models have transformed computer vision, driving significant performance improvements across diverse domains, including digital histopathology. However, the advantages of domain-specific histopathology…
In the first part of this article, we give an analysis of the free monad sequence in non-cocomplete categories, with the needed colimits explicitly parametrized. This enables us to state a more finely grained functoriality principle for…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition…
In this paper we give sufficient conditions for lifting an enhanced factorization system $ (\mathcal{E}, \mathcal{M}) $ on a $ 2 $-category $ \mathbf{D} $ to the functor $ 2 $-category $ \mathbf{D}^{\mathbf{C}} $, where $ \mathbf{C} $ is a…
We introduce a method to lift monads on the base category of a fibration to its total category. This method, which we call codensity lifting, is applicable to various fibrations which were not supported by its precursor, categorical…
For a 2-category $\mathcal{K}$, we consider Street's 2-category Mnd($\mathcal{K}$) of monads in $\mathcal{K}$, along with Lack and Street's 2-category EM($\mathcal{K}$) and the identity-on-objects-and-1-cells 2-functor Mnd($\mathcal{K}$)…
Inference algorithms for probabilistic programming are complex imperative programs with many moving parts. Efficient inference often requires customising an algorithm to a particular probabilistic model or problem, sometimes called…
We introduce Hopf polyads in order to unify Hopf monads and group actions on monoidal categories. A polyad is a lax functor from a small category (its source) to the bicategory of categories, and a Hopf polyad is a comonoidal polyad whose…
In order to classify concordance classes of codimension 2 embeddings in a manifold M, we need to determine the complement of such an embedding. These complements are spaces over M well defined up to some homology equivalence. We construct a…