Graphical and diagrammatic notations for logic and computation (proof nets, string diagrams, existential graphs, Petri nets, interaction nets, etc.) provide elegant, often canonical representations of proofs and processes that expose structure hidden in linear symbolic presentations. These representations have proven valuable both for foundational questions (identity of proofs, cut-elimination as rewriting, semantics of proofs/programs) and practical concerns (visual proof editors, automated graph rewriting, program compilation and optimisation).
The workshop aims at bringing together researchers with complementary perspectives on the topic—ranging from applied category theory and proof theory to the philosophy of diagrammatic reasoning—in order to encourage collaboration, cross-pollinate ideas, share ongoing work, and allow newcomers to explore current developments in the field.
We welcome contributions on all aspects of diagrams in logic and computation. A non-exhaustive list of topics includes:
All deadlines are AoE - Anywhere on Earth (UTC-12).