The cost of compositionality: a high-performance implementation of string diagram composition

MaRDI QIDQ6153343zbMATH OpenFDO

Authors Paul W. Wilson, Fabio Zanasi

Publication date 13 February 2024

Full work available at URL https://arxiv.org/abs/2105.09257, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?ACT2021.19

Mathematics Subject Classification ID

Graphs, diagram schemes, precategories (18A10)

Recommendations

• String diagram rewrite theory. I: Rewriting with Frobenius structure
• Open-graphs and monoidal theories
• Equational reasoning with context-free families of string diagrams
• scientific article; zbMATH DE number 7471699
• Quantomatic: a proof assistant for diagrammatic reasoning

Cites work

• scientific article; zbMATH DE number 2125662 (Why is no real title available?)
• scientific article; zbMATH DE number 7649903 (Why is no real title available?)
• A survey of graphical languages for monoidal categories
• Fast sparse matrix multiplication
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Rewriting modulo symmetric monoidal structure
• Towards an algebraic theory of Boolean circuits.
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
• Wiring diagrams as normal forms for computing in symmetric monoidal categories

This page was built for publication: The cost of compositionality: a high-performance implementation of string diagram composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153343)