Lecture 4 - Page 6 : 27
Programming Paradigms
Evaluation Order and Infinite Lists
* Referential Transparency
Referential transparency
An illustration of referential transparency
* Introduction to Evaluation Order
Arbitrary evaluation order - with some limits
Infinite evaluations and error evaluations
Infinite evaluations and error evaluations - 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
Exercises
Infinite evaluations and error evaluations
What is the value of the following expressions?
((lambda (x) 1)
some-infinite-calculation
) ((lambda (x) 1)
(/ 5 0)
)
Constant functions with problematic actual parameter expressions.
A more concrete version of the infinite calculation from above.
The function
infinite-calculation
just calls itself without ever terminating.
