So far

Last modified on April 1, 2004 by rpj@cs.rit.edu.

	We should look at Haskell
	Mostly in lab4.

Last modified on April 1, 2004 by rpj@cs.rit.edu.

We should look at Haskell

	Brief digression
	We should also look briefly at the lambda calculus.

Last modified on April 1, 2004 by rpj@cs.rit.edu.

We should look at Haskell

Brief digression

	An expression is
	an identifier, or lambda id . exp, where id is an identifier and exp is an expression, or exp1 exp2, where both exp1 and exp2 are expressions

Last modified on April 1, 2004 by rpj@cs.rit.edu.

We should look at Haskell

Brief digression

An expression is

	Reduction rules
	Alpha reduction (consistent renaming of a formal parameter) Beta reduction -- evaluate the body of a lambda expression with the formal replaced by the actual when it is applied Eta reduction -- lambda id . foo id reduces to foo To what extent is Scheme an implementation of the lambda calculus?

Last modified on April 1, 2004 by rpj@cs.rit.edu.

We should look at Haskell

Brief digression

An expression is

Reduction rules

	Free and bound
	Look at these programs to test freedom and boundedness.

Last modified on April 1, 2004 by rpj@cs.rit.edu.