| name | 0.5.8-understand-collapse_principle |
| description | [0.5.8] every planned integration is first a certified KB region, not code — the long-wise reification is skipped unti |
understand-collapse_principle
CALL NUMBER: law.collapse_principle
DEFINITION: every planned integration is first a certified KB region, not code — the long-wise reification is skipped until the law fires
Invoke this skill to understand collapse_principle 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
- recompilation_law (d1): bind a KB region to code only when its output is needed without lookup — reproduce with specialization
- futamura_tower (d2): the projection ladder: specializing an interpreter to a program yields a compiler; specializing the specializer compounds
CONSUMERS (what needs this)
dogfooding_loop
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.)
