Semi-explicit first-class polymorphism for ML.

DOI10.1006/INCO.1999.2830MaRDI QIDQ1854319zbMATH OpenOpenAlexFDO

Authors Jacques Garrigue, Didier Rémy

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0bee881558d1a543110b0030e3850864d3257b02

zbMATH Keywords

subtyping

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1088034
• HMF: simple type inference for first-class polymorphism
• Flexible types, robust type inference for first-class polymorphism
• ML ^F
• FPH: first-class polymorphism for Haskell

Cites work

• scientific article; zbMATH DE number 445160 (Why is no real title available?)
• scientific article; zbMATH DE number 3930968 (Why is no real title available?)
• scientific article; zbMATH DE number 1231454 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1088034 (Why is no real title available?)
• scientific article; zbMATH DE number 1479621 (Why is no real title available?)
• Simplifying subtyping constraints

Cited in

(6)

• Recasting ML\(^{\text F}\)
• Ambivalent types for principal type inference with GADTs
• scientific article; zbMATH DE number 1088034 (Why is no real title available?)
• 1ML -- core and modules united
• HMF: simple type inference for first-class polymorphism
• A certified implementation of ML with structural polymorphism and recursive types

This page was built for publication: Semi-explicit first-class polymorphism for ML.

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