n. (Logic) the study of abstraction in terms of the operator lambda (λ). This formulation is equivalent to combinatorial logic, and was originated by the American computer pioneer Alonzo Church in 1940; it was important in the development of computer languages.