FPH: First-class Polymorphism for Haskell

Courtesy Lambda the Ultimate - Programming Languages Weblog  Sun, 04/20/2008 - 10:46

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


 

More related items

Generative Type Abstraction and Type-level Computation
Generative Type Abstraction and Type-level Computation (Extended Version), by Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Steve Zdancewic: Modular languages support...

Hoopl: Dataflow Optimization Made Simple
Hoopl: Dataflow Optimization Made Simple by Norman Ramsey, João Dias, and Simon Peyton Jones. We present Hoopl, a Haskell library that makes it easy for compiler writers to implement program...

Flexible types: Robust type inference for first-class...
Flexible types: Robust type inference for first-class polymorphism, by Dan Leijen: We present HML, a type inference system that supports full firstclass polymorphism where few annotations are...


 

Post new comment

The content of this field is kept private and will not be shown publicly.
computer-internet.marc8.com