to SKI, semantically -- declarative pearl

DOI10.1007/978-3-319-90686-7_3OpenAlexW2801769268MaRDI QIDQ1648865FDOQ1648865

Authors: Oleg Kiselyov 

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90686-7_3

Recommendations

• scientific article; zbMATH DE number 4035776
• scientific article; zbMATH DE number 786542
• Abstraction problems in combinatory logic: A compositive approach
• Programming in the λ-Calculus: From Church to Scott and Back
• scientific article; zbMATH DE number 4068832

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (3)

• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
• A correct-by-construction conversion from lambda calculus to combinatory logic

This page was built for publication: \(\lambda\) to SKI, semantically -- declarative pearl

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