34 search results - page 5 / 7 » icfp 2003 |
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
106
click to vote
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...