Related papers: Reversible monadic computing
The theory of monads on categories equipped with a dagger (a contravariant identity-on-objects involutive endofunctor) works best when everything respects the dagger: the monad and adjunctions should preserve the dagger, and the monad and…
Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional…
A dagger category is a category equipped with a functorial way of reversing morphisms, i.e. a contravariant involutive identity-on-objects endofunctor. Dagger categories with additional structure have been studied under different names e.g.…
We describe how dagger-Frobenius monoids give the correct categorical description of certain kinds of finite-dimensional 'quantum algebras'. We develop the concept of an involution monoid, and use it to construct a correspondence between…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…
We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg--Moore monoids, which combine monoids with algebras for strong…
Using the symmetric monoidal closed category structure of the category of measurable spaces, in conjunction with the Giry monad which we show is a strong monad, we analyze Bayesian inference maps and their construction in relation to the…
We study the monoidal dagger category of Hilbert C*-modules over a commutative C*-algebra from the perspective of categorical quantum mechanics. The dual objects are the finitely presented projective Hilbert C*-modules. Special dagger…
We show that the canonical equivalences of categories between 2-dimensional (unoriented) topological quantum field theories valued in a symmetric monoidal category and (extended) commutative Frobenius algebras in that symmetric monoidal…
We define Frobenius-Eilenberg-Moore objects for a dagger Frobenius monad in an arbitrary dagger 2-category, and extend to the dagger context a well-known universal property of the formal theory of monads. We show that the free completion of…
We show that an orthogonal basis for a finite-dimensional Hilbert space can be equivalently characterised as a commutative dagger-Frobenius monoid in the category FdHilb, which has finite-dimensional Hilbert spaces as objects and continuous…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
Traced monoidal categories are used to model processes that can feed their outputs back to their own inputs, abstracting iteration. The category of finite dimensional Hilbert spaces with the direct sum tensor is not traced. But…
We define a Frobenius algebra over fusion categories of the form Rep$(G)\boxtimes$Rep$(G)$ which generalizes the diagonal subgroup of $G\times G$. This allows us to extend field theoretical constructions which depend on the existence of a…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…
We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations.…
This paper provides geometrical descriptions of the Frobenius monad freely generated by a single object. These descriptions are related to results connecting Frobenius algebras and topological quantum field theories. In these descriptions,…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…