Safety analysis versus type inference for partial types
| Author(s) : | Michael I. Schwartzbach Jens Palsberg, |
| Publisher : | N/A |
| Publication Date : | 1992 |
| ISSN : | N/A |
| Abstract : | Safety analysis is an algorithm for determining if a term in an untyped lambda calculus with constants is safe, i.e., if it does not cause an error during evaluation. We prove that safety analysis accepts strictly more safe lambda terms than does type inference for Thatte's partial types. 1, |