Lecture overview -- Keyboard shortcut: 'u'  Previous page: Introduction to evaluation order [Section] -- Keyboard shortcut: 'p'  Next page: A motivating example -- 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 5 : 26
Functional Programming in Scheme
The Order of Evaluation
Arbitrary evaluation order - with some limits

In a functional program an expression is evaluated with the purpose of producing a value

An expression is composed of subexpressions

An illustration of an expression with subexpressions.

  • Subexpressions can be evaluated in an arbitrary order provided that

    • no errors occur in subexpressions

    • the evaluation of all subexpressions terminates

  • It is possible, and without problems, to evaluate subexpressions in parallel