Manuscript En05-A@1 · En05-A.tex · definition · f076e703
Definition: Syntactic admissibility
Finite programs, syntactic admissibility, and routing › The compositional requirement · lines 696–702
En05-A@1#def:syntactic
A finite block-channel network is syntactically admissible when every block channel is the denotation of a selected generating program and the network is well typed under Assumption ass:programinterface. Interfaces, record dependencies, ownership, and branch continuations must match.
Nearby in this section
- assumption: Assumption: Finite compositional program interface
- section: The compositional requirement
- section: The compositional requirement
- proposition: Proposition: Finite path accounting
- section: The compositional requirement
- proposition: Proposition: Soundness of finite syntactic networks
- remark: Remark: Finite network versus one strongly normalizing term