Fall 99, CSE 520: Lecture 7

From the lambda calculus to real programming languages

The Lambda Calculus is the basis of the functional languages. These usually have a "core" corresponding to the Lambda Calculus, plus:

Order of evaluation

In Lambda Calculus every reducible subterm (beta redex) can be selected for reduction. This gives rise to nondeterminism. In real languages, on the contrary, the choice is fixed.

Some programming languages based on the lambda calculus

Several languages have been proposed. For instance: