Related papers: Delta lenses as coalgebras for a comonad
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…
Fix a monoidal category C. The 2-category of monads in the 2-category of C-actegories, colax C-equivarant functors, and C-equivariant natural transformations of colax functors, may be recast in terms of pairs consisting of a usual monad and…
We provide bar and cobar constructions as functors between some categories of curved algebras and curved augmented coalgebras over a graded commutative ring. These functors are adjoint to each other.
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We introduce an enriched notion of a coalgebra over an operad P in a symmetric monoidal V-category C. When C is semicartesian and P is unital, we construct a V-endofunctor on C associated to P and give conditions under which it is a…
Temporal logics are an obvious high-level descriptive companion formalism to dynamical systems which model behavior as deterministic evolution of state over time. A wide variety of distinct temporal logics applicable to dynamical systems…
Categorical deep learning (CDL) has recently emerged as a framework that leverages category theory to unify diverse neural architectures. While geometric deep learning (GDL) is grounded in the specific context of invariants of group…
We describe a fully faithful embedding of the category of (reflexive) globular sets into the category of counital cosymmetric $R$-coalgebras when $R$ is an integral domain. This embedding is a lift of the usual functor of $R$-chains and the…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
We introduce the notion of Rota-Baxter coalgebra which can be viewed as the dual notion of Rota-Baxter algebra. We provide some concrete examples and establish various properties of this new object. We also consider comodules over…
Let M be a bicomplete, closed symmetric monoidal category. Let P be an operad in M, i.e., a monoid in the category of symmetric sequences of objects in M, with its composition monoidal structure. Let R be a P-co-ring, i.e., a comonoid in…
In this paper, we study the machine learning elements which we are interested in together as a machine learning system, consisting of a collection of machine learning elements and a collection of relations between the elements. The…
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…
Bidirectional data accessors such as lenses, prisms and traversals are all instances of the same general 'optic' construction. We give a careful account of this construction and show that it extends to a functor from the category of…
Any finite-dimensional commutative (associative) graded algebra with all nonzero homogeneous subspaces one-dimensional is defined by a symmetric coefficient matrix. This algebraic structure gives a basic kind of $A$-graded algebras…
We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Optics are bidirectional data accessors that capture data transformation patterns such as accessing subfields or iterating over containers. Profunctor optics are a particular choice of representation supporting modularity, meaning that we…
The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…