Functorial Boxes in String Diagrams

DOI10.1007/11874683_1zbMath1225.03087OpenAlexW1583784885MaRDI QIDQ3613326

Paul-André Melliès

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_1

Mathematics Subject Classification ID

Related Items (18)

Completeness of Nominal PROPs ⋮ A covariant Stinespring theorem ⋮ Computation by interaction for space-bounded functional programming ⋮ Bimonoidal structure of probability monads ⋮ A Graphical Foundation for Schedules ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ Unnamed Item ⋮ Open Diagrams via Coend Calculus ⋮ Cyber Kittens, or Some First Steps Towards Categorical Cybernetics ⋮ String Diagrams for Layered Explanations ⋮ Categorical composable cryptography: extended version ⋮ Resource modalities in tensor logic ⋮ A graphical foundation for interleaving in game semantics ⋮ Traces for coalgebraic components ⋮ Unnamed Item ⋮ On paradoxes in normal form ⋮ On traced monoidal closed categories ⋮ Unitary transformations of fibre functors

This page was built for publication: Functorial Boxes in String Diagrams