From ML to ML F

DOI10.1145/1411204.1411216MaRDI QIDQ5178756zbMATH OpenOpenAlexWikidataFDO

Authors Didier Rémy, Boris Yakobowski

Publication date 16 March 2015

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

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

zbMATH Keywords

bindersgraphsMLSystem Ftype constraintstype generalizationtype inferencetype instantiationtypesunification

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Types as graphs: Continuations in type logical grammar
• Graphical and incremental type inference. A graph transformation approach
• Compositional and lightweight dependent type inference for ML
• scientific article; zbMATH DE number 2080217
• A general framework for types in graph rewriting
• scientific article; zbMATH DE number 2043546
• Type inference for light affine logic via constraints on words

Cited in

(5)

• Recasting ML\(^{\text F}\)
• Type inference with rank 1 polymorphism for type-directed compilation of ML
• A church-style intermediate language for ML\(^{\text{F}}\)
• A Church-style intermediate language for ML\(^{\text F}\)
• OCaml + XDuce

This page was built for publication: From ML to ML ^F

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