Mathematical logic and foundations Definition
Beta normal form
Builds on Lambda calculusBeta reduction
Definition
Let be a term of the lambda calculus. The term is in -normal form if no subterm of is a -redex, that is, a term of the form . Equivalently, there is no term with , where is one-step beta reduction. A term has a -normal form if is in -normal form and .
Remarks
The terms in -normal form are exactly the terms of the shape with , a variable , and terms in -normal form.
Example: is in -normal form. Each application in it has the variable in function position, so no subterm is a redex.
Non-example: is not in -normal form, since it contains the redex . It has the -normal form .
The term reduces in one step to itself and to nothing else, so it has no -normal form.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Beta reduction concept
- Lambda calculus concept
- Beta normal form definition
Further reading
About this page
| Tag | PQM3ENTT80 |
|---|---|
| URI | m2://PQM3ENTT80 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B40, 68N18 |
| Defines | Beta normal form |
| Uses | Lambda calculus, Beta reduction |
| 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.
What links here
No page links to this page yet.