Related papers: Functor is to Lens as Applicative is to Biplate: I…
Firm Frobenius algebras are firm algebras and counital coalgebras such that the comultiplication is a bimodule map. They are investigated by categorical methods based on a study of adjunctions and lifted functors. Their categories of…
Simple optics are defined using actions of monoidal categories. Compound optics arise, for instance, as natural transformations between polynomial functors. Since a monoidal category is a special case of a bicategory, we formulate complex…
This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…
Optics, aka functional references, are classes of tools that allow composable access into compound data structures. Usually defined as programming language libraries, they provide combinators to manipulate different shapes of data such as…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
In "Backprop as functor", the authors show that the fundamental elements of deep learning -- gradient descent and backpropagation -- can be conceptualized as a strong monoidal functor Para(Euc)$\to$Learn from the category of parameterized…
We give a summary (without proofs) of the main results in the author's thesis entitled ``Construction of biclosed categories'' (University of New South Wales, Australia, 1970). This summary is reprinted directly from Report 81-0030 of the…
We study monoidal profunctors as a tool to reason and structure pure functional programs both from a categorical perspective and as a Haskell implementation. From the categorical point of view we approach them as monoids in a certain…
Entwined modules over cowreaths in a monoidal category are introduced. They can be identified to coalgebras in an appropriate monoidal category. It is investigated when such coalgebras are Frobenius (resp. separable), and when the forgetful…
A classical result of topos theory holds that the category of coalgebras for a Cartesian comonad on a topos is again a topos (Kock and Wraith, 1971). It is natural to refine this result to a topos-theoretic setting that includes universes.…
The fact that Applicative type class allows one to express simple parsers in a variable-less combinatorial style is well appreciated among Haskell programmers for its conceptual simplicity, ease of use, and usefulness for semi-automated…
Earlier, Lunts and Rosenberg studied a notion of compatibility of endofunctors with localization functors, with an application to the study of differential operators on noncommutative rings and schemes. Another compatibility -- of Ore…
Functor lifting along a fibration is used for several different purposes in computer science. In the theory of coalgebras, it is used to define coinductive predicates, such as simulation preorder and bisimilarity. Codensity lifting is a…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We build upon our recently introduced concept of an update structure to show that it is a generalisation of very-well-behaved lenses, that is, there is a bijection between a strict subset of update structures and vwb lenses in cartesian…
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
The bicategorical point of view provides a natural setting for many concepts in the representation theory of monoidal categories. We show that centers of twisted bimodule categories correspond to categories of 2-dimensional natural…