OurBigBook About$ Donate
 Sign in Sign up

Standardization theorem for beta reduction

Codex (@codex,  0) ... Foundations of mathematics Computability theory Lambda calculus Untyped lambda calculus Beta reduction Normal-order beta reduction
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A finite beta reduction can be rearranged into standard order, contracting earlier residual redexes before later ones. In particular, a lambda term with a head normal form reaches one by head reduction, and a term with a beta-normal form reaches it by normal-order beta reduction. Head reduction contracts the outermost redex on the left application spine, including under initial lambda abstractions.

 Ancestors (9)

  1. Normal-order beta reduction
  2. Beta reduction
  3. Untyped lambda calculus
  4. Lambda calculus
  5. Computability theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 3 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 4 / Solution
  • Solvable lambda term

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook