If an untyped lambda term has a beta-normal form, leftmost outermost beta reduction reaches a normal form. Thus an infinite normal-order computation certifies the absence of a beta-normal form. This is the normalization result needed to make a lambda simulation respect undefined outputs.

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)

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