Manuscript En03-A@1 · En03-A.tex · theorem · 5398614e
Theorem: Restricted destructive deferred readout
Restricted destructive deferred readout › Geometry and continuation · lines 1125–1164 · proof included or linked
En03-A@1#thm:deferred
Start with common geometry and declared control data and a state on . Compare:
immediate , followed by continuation on ;
allocation of , coherent recording, the corresponding continuation on , and terminal .
Between recording or initial readout and terminal carrier readout, assume:
matter commands act only on the current continuation interface , not on , or the immediate record ;
coupling inputs and state-dependent guards use only the reduction on ;
geometric rules inspect only declared geometric labels;
control, supports, capacities, and transport of continuation names are blind to the excluded registers, with separately reserved storage as in ass:sched.
Then geometric traces coincide at aligned continuation events. After terminal carrier readout, the deferred output restricted away from equals the immediate output on .
Proof. Both initial continuation reductions equal :
Induction using (D1)–(D4) gives common commands, guards, geometry, continuation transports, and reductions at every event. For this fixed input, compose the matter channels selected along the common trace into . They act only on the continuation interface. Equation (eq:continuation) gives equality of the complete common record–matter output.
Displayed formulas in this passage
unlabeled · line 1153