Extending ML with semi-explicit higher-order polymorphism

DOI10.1007/BFB0014546MaRDI QIDQ4364382zbMATH OpenFDO

Authors Jacques Garrigue, Didier Rémy

Publication date 17 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0014546

zbMATH Keywords

conservative extension of MLsemi-explicit higher-order polymorphism

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15)

Recommendations

• Semi-explicit first-class polymorphism for ML.
• Extending the type checker of Standard ML by polymorphic recursion
• ML ^F
• Type inference with rank 1 polymorphism for type-directed compilation of ML
• Functorial ML

Cited in

(5)

• The definition of Extended ML: A gentle introduction
• Semi-explicit first-class polymorphism for ML.
• Modular typechecking for hierarchically extensible datatypes and functions
• scientific article; zbMATH DE number 1231611 (Why is no real title available?)
• Programming objects with ML-ART. An extension to ML with abstract and record

This page was built for publication: Extending ML with semi-explicit higher-order polymorphism

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