Lecture overview -- Keyboard shortcut: 'u'  Previous page: Rewrite rules, reduction, and normal forms [Section] -- Keyboard shortcut: 'p'  Next page: The alpha rewrite rule -- Keyboard shortcut: 'n'  Lecture notes - all slides together  Annotated slide -- Keyboard shortcut: 't'  Alphabetic index  Help page about these notes  Course home    Evaluation Order and Infinite Lists - slide 9 : 27

Rewrite rules

The rewrite rules define semantics preserving transformations of expressions

The goal of applying the rewrite rules is normally to reduce an expression to the simplest possible form, called a normal form