Department of Computer Science; University of Edinburgh
SVM HeaderParse 0.2
Edinburgh, EH9 3JZ, SCOTLAND
SVM HeaderParse 0.1
Curry's system for F-deducibility is the basis for static type inference algorithms for programming languages such as ML. If a natural "preservation of types by conversion" rule is added to Curry's system, it becomes undecidable, but complete relative to a variety of model classes. We show completeness for Curry's system itself, relative to an extended notion of model that validates reduction but not conversion.