Lecture overview -- Keyboard shortcut: 'u'  Previous page: Conditionals and sequential boolean operators -- Keyboard shortcut: 'p'  Next page: Delayed evaluation and infinite lists in Scheme [Section] -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Help page about these notes  Alphabetic index  Course home    Lecture 5 - Page 19 : 26
Functional Programming in Scheme
The Order of Evaluation
Lazy evaluation

We will now deal with a practical variant of normal-order reduction

Lazy evaluation is an implementation of normal-order reduction which avoids repeated calculation of subexpressions

An illustration of lazy evaluation of a Scheme expression. Notice, that Scheme does not evaluate the expression in this way. Scheme uses applicative-order reduction.