Local type inference
Top Cited Papers
- 1 January 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 22 (1) , 1-44
- https://doi.org/10.1145/345099.345100
Abstract
We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are local in the sense that missing annotations are recovered using only information from adjacent nodes in the syntax tree, without long-distance constraints such as unification variables. One method infers type arguments in polymorphic applications using a local constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate our design choices by a statistical analysis of the uses of type inference in a sizable body of existing ML code.Keywords
This publication has 19 references indexed in Scilit:
- Making the future safe for the pastACM SIGPLAN Notices, 1998
- Bounded existentials and minimal typingTheoretical Computer Science, 1998
- Componential set-based analysisACM SIGPLAN Notices, 1997
- Extending ML with semi-explicit higher-order polymorphismPublished by Springer Nature ,1997
- Type Inference for Recursively Constrained Types and its Application to OOPElectronic Notes in Theoretical Computer Science, 1995
- A unifying type-theoretic framework for objectsJournal of Functional Programming, 1995
- Polymorphic type inference and abstract data typesACM Transactions on Programming Languages and Systems, 1994
- Simple type-theoretic foundations for object-oriented programmingJournal of Functional Programming, 1994
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985