Manuscript En05-A@1 · En05-A.tex · section · f076e703
The compositional requirement
Finite programs, syntactic admissibility, and routing › The compositional requirement · lines 736–742
This is the finite-program accounting in Landmark I, En04-A, Hawk04-B, and En02-C CheungI,CheungEn04,CheungHawk04B,CheungEn02C; the proof is included to make the present fragment self-contained.
Nearby in this section
- assumption: Assumption: Finite compositional program interface
- section: The compositional requirement
- definition: Definition: Syntactic admissibility
- section: The compositional requirement
- proposition: Proposition: Finite path accounting
- proposition: Proposition: Soundness of finite syntactic networks
- remark: Remark: Finite network versus one strongly normalizing term