No label defined (Q3783263)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4045707 |
Statements
1987
0 references
lambda calculus
0 references
reduction
0 references
combinatory logic
0 references
BCK-lambda terms
0 references
0.7977410554885864
0 references
0.7961068153381348
0 references
0.7940729260444641
0 references
0.7908256649971008
0 references
The transformations, \(\lambda\), which transforms terms in combinatory logic into \(\lambda\)-terms, and H, which transforms \(\lambda\)-terms into terms in combinatory logic, are well known as is the reslt: For any \(\lambda\)-terms \(M: M_{H\lambda}=_{\beta}M.\) This paper shws that \(M_{H\lambda}>_{\beta}M,\) and that this result also holds for BCK-lambda terms (i.e. lambda terms in which no variable x (not part of a \(\lambda\) x) appears more than once).
0 references