Skip to main content
Article thumbnail
Location of Repository

FPH: First-class Polymorphism for Haskell Declarative, constraint-free type inference for impredicative polymorphism

By Dimitrios Vytiniotis, Stephanie Weirich and Simon Peyton Jones

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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.160.8627
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www2.lifl.fr/~lasou/UEs... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.