462 search results - page 1 / 93 » Function Types in Complete Type Inference |
88
Voted
SFP
2001
14 years 10 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
194
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
JFP
2007
14 years 9 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
82
Voted
ICFP
1999
ACM
15 years 1 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
ICFP
2003
ACM
15 years 9 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...