A language for programs made of effects, written as JSON documents, with a compiler that judges the whole tree before anything runs. You describe the shapes, the contracts between the parts, how data flows through them, what may enter and what gates it. The compiler reads every file and proves they fit together. A small engine runs what it approved, and everything that touches the world, a route, a command, a file, a database, is a plugin behind a port the tree declares. The language never learns what HTTP is.
Every document of the example tree, read as the compiler reads it: routes, ports, bindings, graphs, policies, invariants, and how a refusal is answered from both ends. Nothing runs behind this page.
The route written a year later: an agent adds a write route without having read the rule, and the compiler talks back until the route is honest about every way it can end. Every output on the page is what that run printed; the page is written only when every step passes.
Three models given the same unsupervised task in identical copies of the example, with an acceptance test as the gate. What each decided, what it cost, the gate's verdict on each, and the same nine calls against each result. Run again with one command.
One agent, one task, every step timed: what the compiler catches, what the agent read before its first write, and what rehearsal and regression replace. Ends with the service drawn, its plugins on the edges.