Towards a Meta-Extensible Contextual Calculus: Typed lexicons, cross-register integrity and governed recombinant expression

Can context, warrant, uncertainty, authority and temporal continuation be expressed through a small compositional language without allowing syntax to manufacture evidence or permission? We develop a bounded contextual calculus from an existing 30-category, 523-candidate atlas and an earlier 28-entry experimental lexicon. PETAL Native supplies a historical three-register design: symbolic rendering, controlled phrase and formal expression. We reconstruct that design around typed meanings and externally referenced qualification. A finite Boolean constructor reaches all sixteen two-input meanings from NAND and two input leaves, while most contextual candidates remain unreduced. In 2,401 register fixtures, 42 have pairwise-compatible interpretations but no joint interpretation. A 216-case paragraph census contains 137 cases feasible sentence-by-sentence but infeasible jointly. Across 1,296 temporal fixtures, the intact interpreter produces no invalid release; a clock-reset ablation produces 182. A persistent five-event example preserves expression content while evidence standing and permission change. Four attack families across sixteen constructed expressions produce 64 admission refusals. Typed unified and federated role bridges tie on the tested domain. The resulting artifact supports governed recombination within a supplied grammar; it does not discover arbitrary primitives, revise its own constructor, prove universal alignment or establish a universal minimal basis. We provide ground-up category guidance, scoped laws, worked examples, exact raw data and standalone reproduction materials. Memory accretion and selective forgetting are formalised as a subsequent research programme rather than reported as achieved results.