6 search results - page 2 / 2 » sfp 2001 |
91
Voted
SFP
2001
14 years 11 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...