16. A finite language of executable methods

A program can branch, stop after failure, invoke operations, and consume resources along its actual path. Primitive commuting equations must extend to these control decisions. We use finite syntax trees with partial primitives, sequencing and Boolean branching, without loops or recursive calls.