PAG Well-Formedness Validation
Kind: algorithm
Record: algorithms:pag-well-formedness-validation
Canonical: Algorithms
Closure: Dependencies in load order
Scan a PAG document for structural and epistemic defects, each named for the shape it catches — a retired unit head, a node without a gate, a check without evidence, a gate without a population or with an empty one, an unknown left unrouted, a write without a refusal, an artifact without freshness, a node declared twice, an input naming no source, an invariant missing its set, parties or objector, a bare invariant block, a lowercase keyword, a bare FOR, a missing colon, a vague condition — and emit a token-based, regex-free verdict.
Listed in Algorithm contracts, after PAG Authoring Kernel and before <PAG Instruction Concern>.