A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We discuss the foundations of 2-dimensional graphical languages, with a view towards their computer implementation in a 'compiler' for monoidal categories. In particular, we discuss the close relationship between string diagrams, pasting diagrams, linear logic proof trees and k-d trees, the last being a data structure from computational geometry and computer graphics that recursively partitions a space. We introduce a minor variant of cubical pasting diagrams, which we call 'brick diagrams',arXiv:1908.10660v1 fatcat:d7yrk5ms4neqplnmguqxq5kgyu