Qualified types for MLF

12 September 2005

proceedings article
Published by Association for Computing Machinery (ACM)

Vol. 40 (9) , 144-155
https://doi.org/10.1145/1086365.1086385

Abstract

MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a local type annotation is required. Qualified types are a general concept that can accommodate a wide range of type systems extension, for example, type classes in Haskell. We show how the theory of qualified types can be used seamlessly with the higher-ranked impredicative polymorphism of MLF, and give a solution to the non-trivial problem of evidence translation in the presence of impredicative datatypes.

Keywords

This publication has 4 references indexed in Scilit:

Sexy types in action
ACM SIGPLAN Notices, 2004
ML ^F
Published by Association for Computing Machinery (ACM) ,2003
Implicit parameters
Published by Association for Computing Machinery (ACM) ,2000
The Definition of Standard ML
Published by MIT Press ,1997