Lecture 5 - Page 17 : 26

Functional Programming in Scheme The Order of Evaluation * Referential transparency Referential transparency An illustration of referential transparency * Introduction to evaluation order Arbitrary evaluation order - with some limits A motivating example A motivating example - clarification * Rewrite rules, reduction, and normal forms Rewrite rules The alpha rewrite rule The beta rewrite rule The eta rewrite rule Normal forms The ordering of reductions An example of normal versus applicative evaluation Theoretical results Practical implications Conditionals and sequential boolean operators Lazy evaluation * Delayed evaluation and infinite lists in Scheme Delayed evaluation in Scheme Examples of delayed evaluation Infinite lists in Scheme: Streams Example streams Stream example: The sieve of Eratosthenes Applications of The sieve of Eratosthenes

Normal-order reduction is more powerful than the applicative-order reduction Scheme and ML uses applicative-order reduction Haskell is an example of a functional programming language with normal-order reduction