Partial polymorphic type inference is undecidable

Authors:
Hans-J. Boehm
Affiliations:
-
Venue:
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Year:
1985

Citing 0
Cited 5

Implementing RUSSELL

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Partially Typed Terms between Church-Style and Curry-Style

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Recasting MLF

Information and Computation
Existential Type Systems with No Types in Terms

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polymorphic type systems combine the reliability and efficiency of static type-checking with the flexibility of dynamic type checking. Unfortunately, such languages tend to be unwieldy unless they accommodate omission of much of the information necessary to perform type checking. The automatic inference of omitted type information has emerged as one of the fundamental new implementation problems of these languages. We show here that a natural formalization of the problem is undecidable. The proof is directly applicable to some practical situations, and provides a partial explanation of the difficulties encountered in other cases.