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

zbMATH Open1530.18005arXiv2105.09257MaRDI QIDQ6153343FDOQ6153343

Authors: Paul W. Wilson, Fabio Zanasi 

Publication date: 13 February 2024

Full work available at URL: https://arxiv.org/abs/2105.09257

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

Mathematics Subject Classification ID

Graphs, diagram schemes, precategories (18A10)

Cites Work

• A survey of graphical languages for monoidal categories
• Title not available (Why is that?)
• Rewriting modulo symmetric monoidal structure
• Fast sparse matrix multiplication
• 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
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Title not available (Why is that?)

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)