Reduction Strategies

• ((lx. e1) e2) is a “reducible expression” or “redex”

• An expression containing no redexes is in “Normal Form” or NF

  • Execution = successive b-reduction to NF

• Whether an arbitrary e has a NF is undecidable (Halting Problem)

• Many different sequences of b -reduction are possible – how does this affect the result?

Previous slide

Next slide

Back to first slide

View graphic version