Related papers: Cartesian effect categories are Freyd-categories
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
We introduce the abstract notions of "monadic operational semantics", a small-step semantics where computational effects are modularly modeled by a monad, and "type-and-effect system", including "effect types" whose interpretation lifts…
In Categorial Topology, given a category (as a "geometric object") we can consider its properties preserved under continuous action (a "deformation") of a comma-propagation operation. However, the Metacategory space, valid for all…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
Deductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by…
It is known that finite crossed modules provide premodular tensor categories. These categories are in fact modularizable. We construct the modularization and show that it is equivalent to the module category of a finite Drinfeld double.
Category theory is famous for its innovative way of thinking of concepts by their descriptions, in particular by establishing universal properties. Concepts that can be characterized in a universal way receive a certain quality seal, which…
We present a mathematical framework for quantum mechanics in which the basic entities and operations have physical significance. In this framework the primitive concepts are states and effects and the resulting mathematical structure is a…
We study categories whose objects are the braid representations, i.e. strict monoidal functors $F\colon B\rightarrow Mat$ from the braid category $B$ to the category of matrices $Mat$. Braid representations are equivalent to solutions to…
Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…
The category $\mathbf{Rel}$ is the category of sets (objects) and relations (morphisms). Equipped with the direct product of sets, $\mathbf{Rel}$ is a monoidal category. Moreover, $\mathbf{Rel}$ is a locally posetal 2-category, since every…
Using instruments comprising ordered responses to items are ubiquitous for studying many constructs of interest. However, using such an item response format may lead to items with response categories infrequently endorsed or unendorsed…
An original presentation of Categorical Quantum Physics, in the line of Abramsky and Coecke, tries to introduce only objects and assumptions that are clearly relevant to Physics and does not assume compact closure. Adjoint arrows, tensor…
This paper consists of three results on Frobenius categories: (1) we give sufficient conditions on when a factor category of a Frobenius category is still a Frobenius category; (2) we show that any Frobenius category is equivalent to an…
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…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
Actions of monoidal categories on categories, also known as actegories, have been familiar to category theorists for a long time, and yet a comprehensive overview of this topic seems to be missing from the literature. Recently, actegories…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…