Completeness and expressiveness for gs-monoidal categories
Completeness and expressiveness for gs-monoidal categories
Formalised in the study of symmetric monoidal categories, string diagrams are a graphical syntax that has found applications in many areas of Computer Science. Our work aims at systematising and expanding what could be thought of as the core of this visual formalism for dealing with relations and partial functions. …