Related papers: Guarded Traced Categories
We study the classification of submodules of module categories over monoidal categories, extending ideas of Coulembier on the classification of tensor ideals in monoidal categories. We develop a framework that applies to module categories…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
Given a finite tensor category $\mathcal{C}$, we prove that a modified trace on the tensor ideal of projective objects can be obtained from a suitable trivialization of the Nakayama functor as right $\mathcal{C}$-module functor. Using a…
Directed topology is a refinement of standard topology, where spaces may have non-reversible paths. It has been put forward as a candidate approach to the analysis of concurrent processes. Recently, a wealth of different frameworks for,…
Informally speaking, the categoricity of an axiom system means that its non-logical symbols have only one possible interpretation that renders the axioms true. Although non-categoricity has become ubiquitous in the second half of the 20th…
We show that a certain class of categorical operads give rise to $E_n$-operads after geometric realization. The main arguments are purely combinatorial and avoid the technical topological assumptions otherwise found in the literature.
Originally introduced in the context of the algebraic approach to term graph rewriting, the notion of gs-monoidal category has surfaced a few times under different monikers in the last decades. They can be thought of as symmetric monoidal…
We define operations that give the set of all Pythagorean triples a structure of commutative monoid. In particular, we define these operations by using injections between integer triples and $3 \times 3$ matrices. Firstly, we completely…
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been…
We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semantics of program locations and captures loop semantics by…
We consider a pivotal monoidal functor whose domain is a modular tensor category (MTC). We show that the trace of such a functor naturally extends to a representation of the corresponding tube category. As irreducible representations of the…
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…
Constructor theory is a meta-theoretic approach that seeks to characterise concrete theories of physics in terms of the (im)possibility to implement certain abstract "tasks" by means of physical processes. Process theory, on the other hand,…
Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…
This work studies collections of Hilbert space operators which possess a strict monoid structure under composition. These collections can be thought of as discrete unital semigroups for which no subset of the collection is closed under…
This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite…
Let $\mathcal C$ be closed symmetric monoidal Grothendieck category. We define the pure derived category with respect to the monoidal structure via a relative injective model category structure on the category $\mathbf{C}(\mathcal C)$ of…
We study and relate categories of modules, comodules and contramodules over a representation of a small category taking values in (co)algebras, in a manner similar to modules over a ringed space. As a result, we obtain a categorical…