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

A normal form represents our intuition of the value of an expression

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

  • About normal forms

    • Some expressions have no normal form

    • 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 (reductions)

c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/infinite-expression.scmAn example of a Scheme expression without a normal form.


c:/Users/Kurt/Teaching-material/Pp-Scheme-17/notes/includes/normal-not-normal-form-examples.scmScheme expressions - some of which are in normal form.


Is a normal form always unique?