An Introduction to String Diagrams for Computer Scientists

2023/05/15 by Robin Piedeleu, Piedeleu, Robin, Fabio Zanasi +1 · 1 voice · 8 citations
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.LO

paper · pdf · doi:10.48550/arxiv.2305.08768

arxiv published 2023/05/15 · arxiv updated 2023/11/22

Abstract

This document is an elementary introduction to string diagrams. It takes a computer science perspective: rather than using category theory as a starting point, we build on intuitions from formal language theory, treating string diagrams as a syntax with its semantics. After the basic theory, pointers are provided to contemporary applications of string diagrams in various fields of science.

Cited by

• Graphical quadratic algebra: A complete calculus for convex optimisation and Gaussian probability
• Bayesian Networks, Markov Networks, Moralisation, Triangulation: a Categorical Perspective
• Compositional Inference for Bayesian Networks and Causality
• Parametric Iteration in Resource Theories
• Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction
• A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures
• Demystifying Codensity Monads via Duality
• The decohered ZX-calculus

Discussions

• An Introduction to String Diagrams for Computer Scientists [hn, 2 points, 0 comments]

Related

• Programs as Diagrams: From Categorical Computability to Computable Categories
• String Diagrams for λ-calculi and Functional Computation
• Syntax diagrams as a formalism for representation of syntactic relations of formal languages
• Diagrammatic category theory
• Categorical Tools for Natural Language Processing