The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. |
scientific article; zbMATH DE number 6676780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. |
scientific article; zbMATH DE number 6676780 |
Statements
The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (English)
0 references
23 January 2017
0 references
\(\lambda\)-calculus
0 references
combinatory logic
0 references
\(\beta\)-reduction
0 references
\(\beta \eta\)-reduction
0 references
abstraction
0 references
irreducible terms
0 references
normal form
0 references
