A church-style intermediate language for ML^F

DOI10.1007/978-3-642-12251-4_4MaRDI QIDQ3558327zbMATH OpenOpenAlexFDO

Authors Didier Rémy, Boris Yakobowski

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12251-4_4

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A Church-style intermediate language for ML\(^{\text F}\)
• Recasting ML\(^{\text F}\)
• ML ^F
• Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions
• From ML to ML ^F

Cited in

(3)

• Recasting ML\(^{\text F}\)
• A Church-style intermediate language for ML\(^{\text F}\)
• Safe zero-cost coercions for Haskell

This page was built for publication: A church-style intermediate language for ML\(^{\text{F}}\)

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