1003 search results - page 6 / 201 » Type Inference with Inequalities |
136
Voted
SFP
2001
15 years 5 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...
110
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
108
Voted
APLAS
2006
ACM
15 years 9 months ago
2006
ACM
117
Voted
POPL
1991
ACM
15 years 7 months ago
1991
ACM
92
Voted
IANDC
2002
15 years 3 months ago
2002