betaredexes
Betaredexes are beta-redexes, or reducible expressions, in the lambda calculus. They are subterms that can be simplified by beta-reduction, replacing bound variables with their arguments. A typical beta-redex has the form (λx. M) N, which reduces to M[x := N].
The term betaredexes is a variant spelling; the standard term is beta-redexes. Both refer to the same
Examples illustrate the concept. The term ((λx. x) y) is a beta-redex; reducing yields y. In a
Evaluation strategies address how beta-redexes are chosen during reduction. Normal-order reduction reduces the leftmost outermost redex
Significance and context: beta-reduction is the fundamental computation step in untyped lambda calculus and underpins the