Proposition: Simulation under tail routing

Suppose the selected program has a finite input interface and a finite complete evaluation, and its gates belong to the specified library. On a tail-routing schedule with sufficient finite capacity, its instrument can be realized by a syntactically admissible run.

Proof. Choose a target site. Route the program's input names and classical input records to that site, using a state-independent transport plan. Transport is a wire-address change and leaves their joint logical state unchanged.

At a later tick, evaluate the generating program inside the block containing the target site. All required fresh slots are reserved there. The block's denotation is the instrument of the original program. If a prescribed final placement is required, route the returned names and records after evaluation.