Related papers: Functor is to Lens as Applicative is to Biplate: I…

The classifying spaces of handlebody groups form a modular operad. Algebras over the handlebody operad yield systems of representations of handlebody groups that are compatible with gluing. We prove that algebras over the modular operad of…

A PROP is a symmetric monoidal category, whose set of objects is the set of natural numbers and on objects the monoidal structure is given by the addition. An algebra over a PROP is a symmetric strict monoidal functor to the tensor category…

If all objects of a simplicial combinatorial model category \cat A are cofibrant, then there exists the homotopy model structure on the category of small functors $\sS^{\cat A}$, where the fibrant objects are homotopy functors, i.e.,…

We develop further the theory of monoidal bicategories by introducing and studying bicategorical counterparts of the notions of a linear exponential comonad, as considered in the study of linear logic, and of a codereliction transformation,…

This paper introduces an inherently strict presentation of categories with products, coproducts, or symmetric monoidal products that is inspired by file systems and directories. Rather than using nested binary tuples to combine objects or…

The cartesian structure possessed by relations, spans, profunctors, and other such morphisms is elegantly expressed by universal properties in double categories. Though cartesian double categories were inspired in part by the older program…

We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…

This paper is the first step in a general program for defining cocalculus towers of functors via sequences of compatible monads. Goodwillie's calculus of homotopy functors inspired many new functor calculi in a wide range of contexts in…

We show that the category of algebraically cofibrant objects in a combinatorial and simplicial model category A has a model structure that is left-induced from that on A. In particular it follows that any presentable model category is…

We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…

Lenses are a category theoretic construct and are used in a wide variety of applications. Symmetric lenses compose to, of course, form new symmetric lenses. Symmetric lenses are usually represented as spans of asymmetric lenses. In many…

Delta lenses are an established mathematical framework for modelling and designing bidirectional model transformations. Following the recent observations by Fong et al, the paper extends the delta lens framework with a a new ingredient:…

We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…

In previous work, categories of algebras of endofunctors were shown to be enriched in categories of coalgebras of the same endofunctor, and the extra structure of that enrichment was used to define a generalization of inductive data types.…

We show that the category of simplicial sets is a co-reflective subcategory of the category of cubical sets with connections, with the inclusion given by a version of the straightening functor. We show that using the co-reflector, one can…

Several well known polytopal constuctions are examined from the functorial point of view. A naive analogy between the Billera-Sturmfels fiber polytope and the abelian kernel is disproved by an infinite explicit series of polytopes. A…

Bidirectional transformation, also called lens, has played important roles in maintaining consistency in many fields of applications. A lens is specified by a pair of forward and backward functions which relate to each other in a consistent…

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…

We point out that double categories provide a natural setting for modular functors obtained by a (bicategorical) string-net construction: The source of the modular functor -- which is now a double functor -- is a symmetric monoidal double…

This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…