Preprints

F. Bonchi, A. Di Giorgio, and E. Di Lavore - A Diagrammatic Basis for Computer Programming.
F. Bonchi, A. Di Giorgio, N. Haydon, and P. Sobocinski - The Calculus of Neo-Peircean Relations.
F. Bonchi, A. Di Giorgio, and D. Trotta - On Boolean Hyperdoctrines and Peircean Bicategories.

Papers

C. Reader and A. Di Giorgio - String Diagrams for Closed Symmetric Monoidal Categories. (Accepted at) CSL 2026
A. Di Giorgio, P. Sobocinski, and N. Voorneveld - Parametric Iteration in Resource Theories. (Accepted at) CSL 2026
F. Bonchi, C.J. Cioffo, A. Di Giorgio, and E. Di Lavore - Tape Diagrams for Monoidal Monads. CALCO 2025
A. Di Giorgio, D. R. Ghica, and F. Zanasi - Rewriting for Traced Monoidal Closed Categories. ICGT 2025
F. Bonchi, A. Di Giorgio, and E. Di Lavore - A Diagrammatic Algebra for Program Logics. FoSSaCS 2025
F. Bonchi, A. Di Giorgio, and D. Trotta - When Lawvere meets Peirce: an equational presentation of boolean hyperdoctrines. MFCS 2024
F. Bonchi, A. Di Giorgio, N. Haydon, and P. Sobocinski - Diagrammatic Algebra of First Order Logic. LICS 2024
F. Bonchi, A. Di Giorgio, and A. Santamaria - Deconstructing the Calculus of Relations with Tape Diagrams. POPL 2023
F. Bonchi, A. Di Giorgio, and P. Sobocinski - Diagrammatic Polyhedral Algebra. FSTTCS 2021
F. Bonchi, A. Di Giorgio, and F. Zanasi - From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra. CALCO 2021
A. Di Giorgio and M. Danelutto - Backus FP revisited: A parallel perspective on modern multicores. ParCo 2019

Thesis

A. Di Giorgio - Diagrammatic Algebras of Relations. PhD Thesis

See also my Google Scholar, dblp