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).
Recommendations
- On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
- Lambda terms definable as combinators
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
- Abstraction problems in combinatory logic: A compositive approach
- The search for a reduction in combinatory logic equivalent to -reduction. II.
Cited in
(17)- Combinatory weak reduction in lambda calculus
- The systematic construction of a one-combinator basis for lambda-terms
- Abstraction problems in combinatory logic: A compositive approach
- Finite generation and presentation problems for lambda calculus and combinatory logic
- Weak consequence relation between -terms
- scientific article; zbMATH DE number 3885865 (Why is no real title available?)
- scientific article; zbMATH DE number 4147470 (Why is no real title available?)
- A direct proof of the finite developments theorem
- The basis decision problem in λ‐calculus
- scientific article; zbMATH DE number 2038177 (Why is no real title available?)
- On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
- Preface
- Applications of Plotkin-terms: partitions and morphisms for closed terms
- Sequent combinators: a Hilbert system for the lambda calculus
- The search for a reduction in combinatory logic equivalent to -reduction. II.
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
- Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
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)