Lecture overview -- Keyboard shortcut: 'u'  Previous page: The ordering of reductions -- Keyboard shortcut: 'p'  Next page: Theoretical results -- 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 15 : 26
Functional Programming in Scheme
The Order of Evaluation
An example of normal versus applicative evaluation

Reduction of the expression ((lambda(x y) (+ (* x x) (* y y))) (fak 5) (fib 10))

Normal vs. applicative reduction of a Scheme expression

y:/Kurt/Files/courses/prog3/prog3-03/sources/notes/includes/fib-fak.scmThe necessary Scheme stuff to evaluate the expression.

It appears to be the case that normal order reduction can lead to repeated evaluation of the same subexpression