Lecture overview -- Keyboard shortcut: 'u'  Previous page: Theoretical results -- Keyboard shortcut: 'p'  Next page: Conditionals and sequential boolean operators -- 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 17 : 27

Practical implications
We will here describe the practical consequences of the theoretical results mentioned on the previous page

Normal-order reduction is more powerful than the applicative-order reduction

Scheme and ML uses applicative-order reduction

Haskell is an example of a functional programming language with normal-order reduction