Practical compositional diagramming
summary
Diagrams are rare in programming and theorem-proving environments because current tools are non‑compositional; this work proposes compositional diagramming and implements a compiler that turns structured objects (trees, tree maps, series-parallel graphs) into layouts. The compiler has a three-step compiler pipeline—vertical alignment, wrapping (the only step posed as an optimization), and horizontal justification—and reproduces practical railroad diagram layouts without global layout reasoning, with code and an online playground available to validate that the approach actually works.
AI-written summary · about
chapters (12)
- 0:00Diagrams theory and practice
- 1:06What diagramming is for
- 2:53Practical diagramming features
- 4:39Canonicity and continuity
- 7:07Compositional diagramming explained
- 9:57Composition ensures continuity
- 11:19Beyond trees with SP graphs
- 12:01Railroad diagrams layout
- 14:48Compiling railroad diagrams
- 17:36Future of diagramming systems
- 19:43Open questions research
- 20:24Summary and closing
related talks
34mDiagram as Code - Decoding Architectural Diagrams
22mA diagram editor to mechanize categorical proofs
18mDiagramming Program Values by Spatial Refinement
07mCan software developers draw pictures?
04mLT Erich Studer
01h 00mVisualise, document and explore your software architecture
54mC4 models as code
01h 00mC4 models as code