| name | 0.5.7-understand-dogfooding_loop |
| description | ["0.5.7"] |
| run the system on its own design KB | proving the plan fortifies the plan and mints its backlog |
understand-dogfooding_loop
CALL NUMBER: law.dogfooding_loop
DEFINITION: run the system on its own design KB: proving the plan fortifies the plan and mints its backlog
Invoke this skill to understand dogfooding_loop down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP/SWI-Prolog consistency gate): every reference below resolves.
THE RELATIVE ROOT (the import cone, by lib)
from law
- collapse_principle (d1): every planned integration is first a certified KB region, not code — the long-wise reification is skipped until the law fires
- recompilation_law (d2): bind a KB region to code only when its output is needed without lookup — reproduce with specialization
- futamura_tower (d3): the projection ladder: specializing an interpreter to a program yields a compiler; specializing the specializer compounds
CONSUMERS (what needs this)
way_of_life_framework
Projected from the the_toy_stack KB (57 concepts / 84 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.
(leaf — this is an actual skill.)
