jschoubben 9290cdda4d The checking program judges the module graph's cycles from the edges the running checker gathers (issue 1921, B0 review round 1) ...

ADR 0656 §5 has every check judged by parts built from the change's heads, and no record keeps the cycle rule in the
running checker. The facts carry each ordering edge's two modules and kind, never manifests: the whole catalogue's
graph is 50 edges, 3195 bytes.

Claude-Session: https://claude.ai/code/session_01NcbgfFSnn24M3GcqttoU7i

2026-11-06 23:28:20 +01:00

..

facts.go

The checking program judges the module graph's cycles from the edges the running checker gathers (issue 1921, B0 review round 1)

2026-11-06 23:28:20 +01:00

graph.go

The checking program judges the module graph's cycles from the edges the running checker gathers (issue 1921, B0 review round 1)

2026-11-06 23:28:20 +01:00

judged.go

The manifests, compiled-programs and composition rules judge facts in the checker's rules (issue 1921)

2026-11-06 22:31:22 +01:00

program.go

Every check is judged by the checking program built from its heads (issue 1921)

2026-11-06 22:58:15 +01:00

results.go

Move the level rules and the failure words into the checker's rules package (issue 1921)

2026-11-06 22:12:47 +01:00

seats.go

Read seat definitions once: the indexer's reading becomes a module the checker requires (issue 1921)

2026-11-06 22:39:31 +01:00

words.go

Move the level rules and the failure words into the checker's rules package (issue 1921)

2026-11-06 22:12:47 +01:00