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