FPH: first-class polymorphism for Haskell

DOI10.1145/1411204.1411246MaRDI QIDQ5178770zbMATH OpenOpenAlexFDO

Authors Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-Jones

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.1411246

zbMATH Keywords

higher-rank typesimpredicativitytype inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• HMF: simple type inference for first-class polymorphism
• Flexible types, robust type inference for first-class polymorphism
• Type classes with more higher-order polymorphism
• Practical type inference for arbitrary-rank types
• Type Reconstruction for Type Classes

Cited in

(11)

• Recasting ML\(^{\text F}\)
• Semi-explicit first-class polymorphism for ML.
• Type classes with more higher-order polymorphism
• A static semantics for Haskell
• Practical type inference for arbitrary-rank types
• 1ML -- core and modules united
• COCHIS: stable and coherent implicits
• HMF: simple type inference for first-class polymorphism
• Flexible types, robust type inference for first-class polymorphism
• Programming Languages and Systems
• Boxy types, inference for higher-rank types and impredicativity

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: FPH: first-class polymorphism for Haskell

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