ML F

DOI10.1145/944705.944709zbMath1315.68051OpenAlexW4250583525MaRDI QIDQ5261264

Didier Rémy, Didier Le Botlan

Publication date: 2 July 2015

Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/944705.944709

zbMATH Keywords

type inferenceMLSystem Ffirst-class polymorphismsecond-order polymorphismtype annotations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (8)

Refined Environment Classifiers ⋮ A Church-style intermediate language for ML\(^{\text F}\) ⋮ 1ML – Core and modules united ⋮ A language for generic programming in the large ⋮ Iteration and coiteration schemes for higher-order and nested datatypes ⋮ COCHIS: Stable and coherent implicits ⋮ Recasting ML\(^{\text F}\) ⋮ Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions

This page was built for publication: ML ^F