FPH: First-class Polymorphism for Haskell, by Dimitrios Vytiniotis, Stephanie Weirich and Simon Peyton Jones:
Languages supporting polymorphism typically have ad-hoc restrictions on where polymorphic types may occur. Supporting “firstclass†polymorphism, by lifting those restrictions, is obviously desirable, but it is hard to achieve this without sacrificing type inference. We present a new type system for higher-rank and impredicative polymorphism that improves on earlier proposals: it is an extension of Damas-Milner; it relies only on System F types; it has a simple, declarative specification; it is robust to program transformations; and it enjoys a complete and decidable type inference algorithm.
Under Related Work, the authors provide a detailed comparison of their system with MLF, and HMF.
Recent comments
10 weeks 4 days ago
10 weeks 5 days ago
10 weeks 5 days ago
32 weeks 6 days ago
37 weeks 1 day ago
38 weeks 5 days ago
38 weeks 5 days ago
41 weeks 3 days ago
46 weeks 13 hours ago
46 weeks 14 hours ago