Flexible types, robust type inference for first-class polymorphism

DOI10.1145/1480881.1480891MaRDI QIDQ5261506zbMATH OpenOpenAlexFDO

Authors Daan Leijen

Publication date 3 July 2015

Published in Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

first-class polymorphismMLFSystem F

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• HMF: simple type inference for first-class polymorphism
• FPH: first-class polymorphism for Haskell
• Polymorphism, subtyping, and type inference in MLsub
• ML ^F
• Polymorphic type inference with overloading and subtyping

Cited in

(11)

• Recasting ML\(^{\text F}\)
• Polymorphic type inference and containment
• Corrigendum: Polymorphic type assignment and CPS conversion
• Semi-explicit first-class polymorphism for ML.
• Type inference with rank 1 polymorphism for type-directed compilation of ML
• Polymorphic functions with set-theoretic types. II: Local type inference and type reconstruction
• scientific article; zbMATH DE number 1487941 (Why is no real title available?)
• TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
• HMF: simple type inference for first-class polymorphism
• FPH: first-class polymorphism for Haskell
• Programming Languages and Systems

This page was built for publication: Flexible types, robust type inference for first-class polymorphism

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