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

The theoretical results mentioned on this page assure some very satisfactory properties of functional programming

The rewriting => is confluent if for all e, e1 and e2, for which e => e1 and e => e2, there exists an e3 such that e1 => e3 and e2 => e3

The first Church-Rosser theorem. Rewriting with beta and eta conversions are confluent.

The second Church-Rosser theorem. If e0 => ... => e1, and if e1 is on normal form, then there exists a normal order reduction of e0 to e1