Lecture 4
LECTURE 4:
Evaluation Order and Infinite Lists
Kurt Nørmark
Department of Computer Science, Aalborg University, Denmark
Title page
Abstract
References from this lecture
Exercises in this lecture
Source programs in this lecture
Page 1
Referential Transparency
Page 15
An example of normal versus applicative evaluation
Page 2
Referential transparency
Page 16
Theoretical results
Page 3
An illustration of referential transparency
Page 17
Practical implications
Page 4
Introduction to Evaluation Order
Page 18
Conditionals and sequential boolean operators
Page 5
Arbitrary evaluation order - with some limits
Page 19
Lazy evaluation
Page 6
Infinite evaluations and error evaluations
Page 20
Delayed evaluation and infinite lists in Scheme
Page 7
Infinite evaluations and error evaluations - clarification
Page 21
Delayed evaluation in Scheme
Page 8
Rewrite rules, reduction, and normal forms
Page 22
Examples of delayed evaluation
Page 9
Rewrite rules
Page 23
Infinite lists in Scheme: Streams
Page 10
The alpha rewrite rule
Page 24
Example streams
Page 11
The beta rewrite rule
Page 25
Stream example: The Sieve of Eratosthenes
Page 12
The eta rewrite rule
Page 26
Applications of The sieve of Eratosthenes
Page 13
Normal forms
Page 27
Exercises
Page 14
The ordering of reductions
Generated: Friday August 13, 2021, 14:52:00