Mathematical logic and foundations Definition
Eta conversion
Builds on Lambda calculusBeta reduction
Definition
Let be the set of terms of the lambda calculus, up to renaming of bound variables. An -redex is a term in which the variable has no free occurrence in .
One-step -reduction is the least relation on with these properties.
- whenever is not free in .
- If , then , and .
-conversion is the least equivalence relation that contains . -conversion is the least equivalence relation that contains both and the one-step beta reduction .
Remarks
Example: , since is not free in . The same term also -reduces to , which is the same term up to renaming.
Non-example: is not an -redex. It has the form with , but is free in .
Adding to is equivalent to adding the extensionality rule: if for a variable free in neither nor , then . So is the least equivalence relation that contains , is compatible with application and abstraction, and is closed under this rule.
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
- Eta conversion definition
Further reading
- Web https://en.wikipedia.org/wiki/Lambda_calculus, η-reduction
About this page
| Tag | 58TYSMQDA4 |
|---|---|
| URI | m2://58TYSMQDA4 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03B40, 68N18 |
| Defines | Eta conversion |
| 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)
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.