On combinatory complete sets of proper combinators

DOI10.1017/S0956796897002888MaRDI QIDQ4234770zbMATH OpenOpenAlexFDO

Authors Sabine Broda, Luís Damas

Publication date 17 August 1999

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796897002888

zbMATH Keywords

\(\lambda I\)-calculusaffine lambda calculuscombinatory completenesscombinatory systemdecision problemlinear \(\lambda\)-calculusproper combinator basespure lambda calculus

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Recommendations

• On principal types of combinators
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• scientific article; zbMATH DE number 860037

Cited in

(9)

• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• On principal types of combinators
• Finite generation and presentation problems for lambda calculus and combinatory logic
• scientific article; zbMATH DE number 1615239 (Why is no real title available?)
• A combinatory account of internal structure
• On the interpretation of combinators with weak reduction
• scientific article; zbMATH DE number 4127172 (Why is no real title available?)
• scientific article; zbMATH DE number 2211926 (Why is no real title available?)
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic

This page was built for publication: On combinatory complete sets of proper combinators

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