Mathematical logic and foundations Concept
Beta normal form
Summary
A lambda term is in beta normal form when no beta reduction step can be applied to it. Such a term is a finished computation, its value. By the Church–Rosser theorem, a term has at most one beta normal form up to renaming of bound variables. Some terms, such as , have no normal form at all.
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | FPD6AN79QX |
|---|---|
| URI | m2://FPD6AN79QX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B40, 68N18 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.