Lecture overview -- Keyboard shortcut: 'u'  Previous page: The eta rewrite rule -- Keyboard shortcut: 'p'  Next page: The ordering of reductions -- 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 13 : 26
Functional Programming in Scheme
The Order of Evaluation
Normal forms

Normal forms represent our intuition of the value of an expression

An expressions is on normal form if it cannot be reduced further by use of beta and eta conversions

  • About normal forms

    • Alpha conversions can be used infinitely, and as such they do not play any role in the formulation of a normal form

    • A normal form is a particular simple expression, which is equivalent to the original expression, due to the application of the conversions

Is a normal form always unique?