Semi-explicit first-class polymorphism for ML.

DOI10.1006/inco.1999.2830zbMath1045.68526OpenAlexW2043188316MaRDI QIDQ1854319

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)

Related Items (4)

Ambivalent Types for Principal Type Inference with GADTs ⋮ 1ML – Core and modules united ⋮ A certified implementation of ML with structural polymorphism and recursive types ⋮ Recasting ML\(^{\text F}\)

Cites Work

• Simplifying subtyping constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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