Name
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. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1109/SFCS.1985.44 | FOCS |
Keywords | Field | DocType |
polymorphic type system,natural formalization,automatic inference,type checking,partial polymorphic type inference,practical situation,static type-checking,partial explanation,fundamental new implementation problem,type information,dynamic type checking,data structures,dynamic typing,type inference,reliability,binary search trees,debugging,polynomials,computer science,law,type system,polymorphism | Type system,Data structure,Combinatorics,Programming language,Computer science,Type inference,Theoretical computer science,Data type,Recursive data type,Binary search tree,Debugging,Undecidable problem | Conference |
ISBN | Citations | PageRank |
0-8186-0844-4 | 23 | 3.98 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hans Boehm | 1 | 632 | 38.83 |