nLab
Kelly-Mac Lane graph

Contents

Idea

A diagrammatic calculus for closed categories, akin to proof nets in linear logic and more generally string diagrams for monoidal categories and related categorical structures of “linear” type.

References

The concept was actually introduced in

They have come to be known as “Kelly–Mac Lane graphs” principally on account of their application to coherence problems for closed categories in the treatment

Reviews include

  • Dominic Hughes, Simple free star-autonomous categories and full coherence (2005) (web)

  • John Baez, Classical versus quantum lambda-calculus. From lambda-terms to string diagrams, Nov. 2006 (pdf)

  • Eugenia Cheng, section 1 of A relationship between trees and Kelly–Mac Lane graphs, Math. Proc. Camb. Phil. Soc. (2006), 141, 33 (pdf)

Last revised on April 15, 2014 at 04:04:30. See the history of this page for a list of all contributions to it.