Related papers: A Diagrammatic Basis for Computer Programming
This is an overview of double categories of "open systems": systems that can interact with their environment. We focus on the variable sharing paradigm, where we compose open systems by identifying variables. This paradigm is often…
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…
We introduce DisCoPy, an open source toolbox for computing with monoidal categories. The library provides an intuitive syntax for defining string diagrams and monoidal functors. Its modularity allows the efficient implementation of…
We revisit the definition of Cartesian differential categories, showing that a slightly more general version is useful for a number of reasons. As one application, we show that these general differential categories are comonadic over…
From the Bayesian perspective, the category of conditional probabilities (a variant of the Kleisli category of the Giry monad, whose objects are measurable spaces and arrows are Markov kernels) gives a nice framework for conceptualization…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
Architecture styles characterise families of architectures sharing common characteristics. We have recently proposed configuration logics for architecture style specification. In this paper, we study a graphical notation to enhance…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
The geometric and algebraic properties of Gray categories with duals are investigated by means of a diagrammatic calculus. The diagrams are three-dimensional stratifications of a cube, with regions, surfaces, lines and vertices labelled by…
It is known that every monoidal bicategory has an associated braided monoidal category of scalars. In this thesis we show that every monoidal bicategory, which is closed both monoidally and compositionally, can be enriched over the monoidal…
The concept of category from mathematics happens to be useful to computer programmers in many ways. Unfortunately, all "good" explanations of categories so far have been designed by mathematicians, or at least theoreticians with a strong…
We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
In this paper, we give a geometric construction of string algebras and of their module categories. Our approach uses dissections of punctured Riemann surfaces with extra data at marked points, called labels. As an application, we give a…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we…
We introduce monoidal streams. Monoidal streams are a generalization of causal stream functions, which can be defined in cartesian monoidal categories, to arbitrary symmetric monoidal categories. In the same way that streams provide…
Given a small category $I$ and a closed symmetric monoidal category $\mm$, we show that the diagram category $\mm^I$ with the objectwise product is a closed symmetric monoidal category. We then prove that if $I$ is a Reedy category and…
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced by this…