The systematic construction of a one-combinator basis for lambda-terms

DOI10.1007/BF03180572MaRDI QIDQ1203131zbMATH OpenFDO

Authors Jeroen Fokker

Publication date 4 February 1993

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03180572

zbMATH Keywords

single-combinator basesSKI-combinators

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) General topics in the theory of software (68N01)

Recommendations

• A construction of one-point bases in extended lambda calculi
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Lambda terms definable as combinators
• scientific article; zbMATH DE number 4045707
• The basis decision problem in λ‐calculus

Cites work

• Combinatory logic. With two sections by William Craig.
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(6)

• A construction of one-point bases in extended lambda calculi
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Lambda terms definable as combinators
• scientific article; zbMATH DE number 4085616 (Why is no real title available?)
• THEORETICAL PEARLS
• On repetitive right application of \(B\)-terms

This page was built for publication: The systematic construction of a one-combinator basis for lambda-terms

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