Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
FPH: First-class polymorphism for Haskell

Dimitrios Vytiniotis, Simon Peyton Jones, and Stephanie Weirich

Abstract

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.

Details

Publication typeInproceedings
Published inProceedings of the 13th ACM SIGPLAN International Conference on Functional Programming
PublisherAssociation for Computing Machinery, Inc.
> Publications > FPH: First-class polymorphism for Haskell