Parametric type inferencing for Helium (2002)
| Venue: | Utrecht University |
| Citations: | 7 - 3 self |
BibTeX
@TECHREPORT{Heeren02parametrictype,
author = {Bastiaan Heeren and Jurriaan Hage},
title = {Parametric type inferencing for Helium},
institution = {Utrecht University},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Helium is a compiler for a large subset of Haskell under development at Universiteit Utrecht. A major design criterion is the ability to give superb error messages. This is especially needful for novice functional programmers. In this paper we document the implementation of the Helium type inferencer. For purposes of experimentation with various methods of type inferencing, the type inferencer can be parameterized in a number of ways. Among the instances we find not only standard algorithms such as M and W, but also more global type inferencers based on type graphs. 1
Citations
| 221 | Principal type schemes for functional programs - Damas, Milner - 1982 |
| 56 | Parsec: Direct style monadic parser combinators for the real world - Leijen, Meijer - 2001 |
| 49 | Proofs about a folklore let-polymorphic type inference algorithm - Lee, Yi - 1998 |
| 38 | A maximum flow approach to anomaly isolation in unificationbased incremental type inference - Walz, Johnson - 1986 |
| 10 | A simple approach to finding the cause of non-unifiability - Port - 1988 |
| 6 | Attribute Grammar System. http://www.cs.uu.nl/groups/ST/Center/AttributeGrammarSystem - Baars - 2004 |
| 3 | Doaitse Swierstra. Generalizing Hindley-Milner type inference algorithms - Heeren, Hage - 2002 |
