Related papers: On Structuring Functional Programs with Monoidal P…
We lift the standard equivalence between fibrations and indexed categories to an equivalence between monoidal fibrations and monoidal indexed categories, namely weak monoidal pseudofunctors to the 2-category of categories. In doing so, we…
We develop a rigorous, equation-free category-theoretic foundation for fungal organisation. A fungal organism is formalised as a functor from a category $\Env$ of structured environmental states and admissible transformations to a category…
Modularity is the fundamental aspect of modern software engineering, however many advanced modularity techniques requires prospective technologies as part of development and operation process. In this paper, we present Refinable Function,…
This is the first of a pair of papers where we construct and investigate a closed monoidal structure on the category of generalized algebraic theories (in the sense of Cartmell). In the present text, as a starting point, we define the…
McBride and Paterson introduced Applicative functors to Haskell, which are equivalent to the lax monoidal functors (with strength) of category theory. Applicative functors F are presented via idiomatic application $\_\circledast\_ : F (A…
In a triangulated symmetric monoidal closed category, there are natural dualities induced by the internal Hom. Given a monoidal functor f^* between two such catgories and adjoint couples (f^*,f_*) and (f_*,f^!), we prove the necessary…
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…
We introduce an exact functor defined on multigraded modules which we call the expansion functor and study its homological properties. The expansion functor applied to a monomial ideal amounts to substitute the variables by monomial prime…
Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…
We provide conditions on a monoidal model category $\mathcal{M}$ so that the category of commutative monoids in $\mathcal{M}$ inherits a model structure from $\mathcal{M}$ in which a map is a weak equivalence or fibration if and only if it…
We construct an exact tensor functor from the category $\mathcal{A}$ of finite-dimensional graded modules over the quiver Hecke algebra of type $A_\infty$ to the category $\mathscr C_{B^{(1)}_n}$ of finite-dimensional integrable modules…
We study the notion of a "differential 2-rig", a category R with coproducts and a monoidal structure distributing over them, also equipped with an endofunctor D : R -> R that satisfies a categorified analogue of the Leibniz rule. This is…
In this article, we characterize convexity in terms of algebras over a PROP, and establish a tensor-product-like symmetric monoidal structure on the category of convex sets. Using these two structures, and the theory of $\scr{O}$-monoidal…
We demonstrate how methods in Functional Programming can be used to implement a computer algebra system. As a proof-of-concept, we present the computational-algebra package. It is a computer algebra system implemented as an embedded…
Consider a coring with exact rational functor, and a finitely generated and projective right comodule. We construct a functor (\emph{coinduction functor}) which is right adjoint to the hom-functor represented by this comodule. Using the…
We give an explicit construction of the free monoid in monoidal abelian categories when the monoidal product does not necessarily preserve coproducts. We apply it to several new monoidal categories that appeared recently in the theory of…
We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…
We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…
We provide a multiplicative classification of polynomial endofunctors on spectra in terms of their Mackey functors of cross--effects. More precisely, we prove that various categories of multivariable excisive functors from spectra to…
Category theory provides a compact method of encoding mathematical structures in a uniform way, thereby enabling the use of general theorems on, for example, equivalence and universal constructions. In this article we develop the method of…