>>107138688
>This allows for statements that are invalid in untyped lambda calculus such as X outside a lambda, or LSX which refers to a hypothetical but non-existent enclosing lambda
>AXL = (x)lambda ... = apply(operand X, operad lambda with yet-to-be-defined body...)
x evaluates to x in lambda calculus. Let's use conventional notation like lx.x for abstraction, what does lx. (without a body) evaluate to? Is the idea it can represent suspended computation like halt in a turing machine?