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

An example of normal versus applicative evaluation

Reduction of the expression

((lambda(x y) (+ (* x x) (* y y))) (fak 5) (fib 10))


The necessary Scheme stuff to evaluate the expression.
Normal-order reduction can lead to repeated evaluation of the same subexpression