That’s it. And yet, the lambda calculus is —it can compute anything computable.
A rule has premises above the line and conclusion below: [ \fracJ_1 \quad J_2 \quad \dots \quad J_nJ ] 15312 foundations of programming languages
All these foundations—syntax, semantics, types, lambda calculus, continuations, state, concurrency—are not separate. They interlock. That’s it
To reason about state, 15312 introduces : That’s it. And yet