On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic

DOI10.4467/20842589RM.18.002.8835MaRDI QIDQ4627723zbMATH OpenFDO

Authors Łukasz Lachowski

Publication date 11 March 2019

Published in Reports on Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

functional programmingcombinatory logiclambda calculuscomplexity analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 4045707
• A correct-by-construction conversion from lambda calculus to combinatory logic
• scientific article; zbMATH DE number 2185659
• scientific article; zbMATH DE number 2038177
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• Binary lambda calculus and combinatory logic
• scientific article; zbMATH DE number 823591
• Lambda calculus and intuitionistic linear logic
• scientific article; zbMATH DE number 1222571
• scientific article; zbMATH DE number 3853055

Cited in

(3)

• scientific article; zbMATH DE number 4045707 (Why is no real title available?)
• A fast algorithm for translating combinator expressions with BC-chains
• scientific article; zbMATH DE number 3905831 (Why is no real title available?)

This page was built for publication: On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic

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