This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis papers/275Boxy Types: Inference for Higher-Rank Types and
Cached
BibTeX
@MISC{Vytiniotis_thispaper,
author = {Dimitrios Vytiniotis and Stephanie C. Weirich and Simon Peyton Jones and Dimitrios Vytiniotis and Stephanie Weirich and Simon Peyton Jones},
title = {This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis papers/275Boxy Types: Inference for Higher-Rank Types and},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annotations. In this paper we show, for the first time, how to combine the virtues of two well-established ideas: unification-based inference, and bidirectional propagation of type annotations. The result is a type system that conservatively extends Hindley-Milner, and yet supports both higher-rank types and impredicativity. Categories and Subject Descriptors D.3.3 [PROGRAMMING
