Concluding Remarks
It is easy to implement a lambda calculus system in Lisp (esp. Scheme) or ML. The LET construct in these languages provides a binding method similar to that of LAMBDA, except for a change in order.
Both Lisp and ML themselves can be viewed as extensions of the Lambda Calculus.
Functional abstraction is an important programming concept not only in theory, but also in practice.