An algebraic foundation for graph-based diagrams in computing
From MaRDI portal
Recommendations
Cites work
- A characterization of pie limits
- Algebraic categories with few monoidal biclosed structures or none
- Elementary observations on 2-categorical limits
- scientific article; zbMATH DE number 46995 (Why is no real title available?)
- scientific article; zbMATH DE number 1841817 (Why is no real title available?)
- Premonoidal categories and notions of computation
- Statecharts: a visual formalism for complex systems
Cited in
(9)- Zooming-out on higraph-based diagrams: syntactic and semantic issues
- On GS-monoidal theories for graphs with nesting
- A recipe for black box functors
- scientific article; zbMATH DE number 3956410 (Why is no real title available?)
- scientific article; zbMATH DE number 4085875 (Why is no real title available?)
- scientific article; zbMATH DE number 1841817 (Why is no real title available?)
- The algebra of directed acyclic graphs
- scientific article; zbMATH DE number 1452990 (Why is no real title available?)
- Open graphs and computational reasoning
This page was built for publication: An algebraic foundation for graph-based diagrams in computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917065)