OurBigBook About$ Donate
 Sign in Sign up

Strong normalization theorem for simply typed lambda calculus

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Computability theory Lambda calculus Normal form (abstract rewriting)
Created 2026-09-24 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
This theorem establishes strong normalization in the normal form sense. Every well-typed simply typed lambda term admits no infinite beta-reduction sequence.

 Ancestors (7)

  1. Normal form (abstract rewriting)
  2. Lambda calculus
  3. Computability theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Normal form (abstract rewriting)
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 20 / 4 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 120 / 3 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 120 / 3 / g / Solution

 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