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 together  Annotated slide -- Keyboard shortcut: 't'  Alphabetic index  Help page about these notes  Course home    Evaluation Order and Infinite Lists - slide 19 : 27

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