Work

The Guarded Syntax: A Notation for Linear Resource Calculi

Year: 2026
Type: preprint
Abstract: String diagrams give linear proof theory a geometry, but the standard diagrams — proof nets, and the symmetric-monoidal calculus of Joyal and Street — build in a symmetry that ordered resource calculi do not have. This paper introduces the Guarded Syntax: a planar string-diagram notation for the Care Calculus, a multi-sorted ordered linear logic with coalgebraic generators and guarded recursion, mechanized in Lean 4. The notation separates into a core graphical language — planar directed wires in two gauges, boxes, a delay bead decorating a wire, and a feedback envelope whose loops must pass through at least one guard — and a signature of generators: the knower node, the one sort whose wires may branch; the reducer, archive and valuation boxes; and the trace sink, where content can legally go to die. The correspondence is stated precisely: well-formed diagrams translate to derivations and back, with claims carrying proof sketches and term-level anchors to machine-checked theorems; the linear cut is diagrammatically the splicing of a wire into the hole it closes, resolving the mutual promise of two abstractions each waiting on the other; and feedback is legal exactly when guarded. Well-formedness is compositional: there is no global correctness criterion, and the calculus's two linearity laws are not forbidden moves to be checked after drawing but shapes the grammar simply cannot generate — a linear wire has no junction, and a content wire has no bare end. Every diagram in the paper is drawn from a named, machine-checked derivation. The diagram-level correspondence is stated, not mechanized.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W7229700508
Cites: 1
Cited by:
Related to: 10