Constraint based type inferencing in Helium

Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierstra

Research output: Chapter in Book/Report/Conference proceedingConference contribution


The Helium compiler implements a significant subset of the functional programming language Haskell. One of the major motivations for developing it was to yield understandable and appropriate type er- ror messages. The separation between the generation, the ordering and the solving of constraints on types has led to a flexible framework which has been employed successfully in a classroom setting. Among its many advantages are the possibility to plug in heuristics for deciding the most likely source of a type error, the generation of multiple type error mes- sages during a single compilation, and the possibility for programmers to tune the type inference process and resulting messages to their own needs without having to know any of the details of the implementation.
Original languageEnglish
Title of host publicationProceedings of the CP 2003 Workshop on Immediate Applications of Constraint Programming (ACP)
EditorsM.-C. Silaghi, M. Zanker
Number of pages22
Publication statusPublished - 2003


Dive into the research topics of 'Constraint based type inferencing in Helium'. Together they form a unique fingerprint.

Cite this