Related papers: Reversible monadic computing
We show that the category of $X$-generated $E$-unitary inverse monoids with greatest group image $G$ is equivalent to the category of $G$-invariant, finitary closure operators on the set of connected subgraphs of the Cayley graph of $G$.…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Tangent categories provide a categorical axiomatization of the tangent bundle. There are many interesting examples and applications of tangent categories in a variety of areas such as differential geometry, algebraic geometry, algebra, and…
Cartesian differential categories come equipped with a differential combinator which axiomatizes the fundamental properties of the total derivative from differential calculus. The objective of this paper is to understand when the Kleisli…
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 study internal structures in regular categories using monoidal methods. Groupoids in a regular Goursat category can equivalently be described as special dagger Frobenius monoids in its monoidal category of relations. Similarly,…
This article studies the categorical setting of Abramsky, Haghverdi, and Scott's untyped linear combinatory algebras, and relates this to more recent work of Abramsky and Heunen on Frobenius algebras in the infinitary setting. The key to…
The complex numbers are an important part of quantum theory, but are difficult to motivate from a theoretical perspective. We describe a simple formal framework for theories of physics, and show that if a theory of physics presented in this…
We develop filtered-graded techniques for algebras in monoidal categories with the main goal of establishing a categorical version of Bongale's 1967 result: A filtered deformation of a Frobenius algebra over a field is Frobenius as well.…
In this paper Hom-Lie algebras, Lie color algebras, Lie superalgebras and other type of generalized Lie algebras are recovered by means of an iterated construction, known as monadic decomposition of functors, which is based on…
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…
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…
Guarded recursion is a framework allowing for a formalisation of streams in classical programming languages. The latter take their semantics in cartesian closed categories. However, some programming paradigms do not take their semantics in…
Within the context of an involutive monoidal category the notion of a comparison relation is identified. Instances are equality on sets, inequality on posets, orthogonality on orthomodular lattices, non-empty intersection on powersets, and…
In the study of computational effects, it is important to consider the notion of computational effects with parameters. The need of such a notion arises when, for example, statically estimating the range of effects caused by a program, or…
It was shown by Ostrik (2003) and Natale (2017) that a collection of twisted group algebras in a pointed fusion category serve as explicit Morita equivalence class representatives of indecomposable, separable algebras in such categories. We…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
We present a diagrammatic approach to quantum dynamics based on the categorical algebraic structure of strongly complementary observables. We provide physical semantics to our approach in terms of quantum clocks and quantisation of time. We…
A categorical model of the multiplicative and exponential fragments of intuitionistic linear logic ($\mathsf{MELL}$), known as a \emph{linear category}, is a symmetric monoidal closed category with a monoidal coalgebra modality (also known…
We study monoidal categories that enjoy a certain weakening of the rigidity property, namely, the existence of a dualizing object in the sense of Grothendieck and Verdier. We call them Grothendieck-Verdier categories. Notable examples…