scientific article; zbMATH DE number 4045707

From MaRDI portal
Publication:3783263





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).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783263)