Related papers: Rewriting in Free Hypergraph Categories
The technique of \emph{equality saturation}, which equips graphs with an equivalence relation, has proven effective for program optimisation. We give a categorical semantics to these structures, called \emph{e-graphs}, in terms of Cartesian…
We introduce the dual notions of $\mathcal{E}(\mathcal{X},M,\mathcal{Y})$ and $\mathcal{M}(\mathcal{X},M,\mathcal{Y})$, and investigate when they have enough injective objects or projective objects, when they are resolving or co-resolving,…
Maps (left adjoint arrows) between Frobenius objects in a cartesian bicategory B are precisely comonoid homomorphisms and, for A Frobenius and any T in B, map(B)(T,A) is a groupoid.
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…
Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…
In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2-categories. In particular, we show that every Frobenius object in a monoidal category M arises from an ambijunction…
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…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. Bonchi et al. showed validity of critical pair analysis for…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
The goal of this paper is to give a new construction of the free monodromic categories defined by Yun. We then use this formalism to give simpler constructions of the free monodromic Hecke categories and then compute the trace of Frobenius…
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.…
Recently, there has been renewed interest in the theory and applications of de Paiva's dialectica categories and their relationship to the category of polynomial functors. Both fall under the theory of generalized polynomial categories,…
We present a term rewriting system that models the dynamic aspects of the free cornering with protocol choice of a monoidal category, which has been proposed as a categorical model of process interaction. This term rewriting system is…
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…
We give parallel algorithms for string diagrams represented as structured cospans of ACSets. Specifically, we give linear (sequential) and logarithmic (parallel) time algorithms for composition, tensor product, construction of diagrams from…
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…
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,…
We characterize Frobenius and separable monoidal algebra extensions $i: R\ra S$ in terms given by $R$ and $S$. For instance, under some conditions, we show that the extension is Frobenius, respectively separable, if and only if $S$ is a…