Lambda Calculus Reducer
Identity: (λx.x) y
Church 2 applied: (λf.λx.f(f x)) succ 0
Compose: (λf.λg.λx. f(g x))
Ω combinator: (λx.x x)(λx.x x)
2+3 (Church numerals)
β-reduce Step
Run
Reset
Reduction Steps
β-reduction: (λx.M) N → M[N/x] (substitute N for x in M). Normal order: reduce leftmost outermost redex first.