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'  Help page about these notes  Alphabetic index  Course home  Lecture 4 - Page 15 : 27
Programming Paradigms
Evaluation Order and Infinite Lists
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

c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/fib-fak.scmThe necessary Scheme stuff to evaluate the expression.


Normal-order reduction can lead to repeated evaluation of the same subexpression