> Probably even easier to put together the lambda calculus expression to evaluate all possible lambda calculus expressions To wit, T = (λ 1 1) (λ (λ λ λ 1 (2

> Probably even easier to put together the lambda calculus expression to evaluate all possible lambda calculus expressions To wit, T = (λ 1 1) (λ (λ λ λ 1 (2 (λ λ λ 3 1 (2 (λ 2)))) (3 (λ 4 (λ 4 (2 1))))) (1 1)) (λ 1) is (denoted with de Bruijn indices) a binary tree containing all closed lambda terms. For example identity may be found at T 1 1 0 1 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0, where 0 = \x\y.x and 1 = \x\y.y move to the left and right subtree respectively.