Lecture 5 - Page 18 : 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
Conditionals and sequential boolean operators
There are functional language constructs - special forms - for which applicative order reduction would not make sense
(if b x y)
Depending on the value of
b
, either
x
or
y
are evaluated
It would often be harmful to evaluate both
x
and
y
before the selection
(define (fak n) (if (= n 0) 1 (* n (fak (- n 1)))))
(and x y z)
and
evaluates its parameter from left to right
In case
x
is false, there is no need to evaluate
y
and
z
Often, it would be harmful to evaluate
y
and
z
(and (not (= y 0)) (even? (quotient x y)))
