Local type inference
- 1 January 1998
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 252-265
- https://doi.org/10.1145/268946.268967
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 informationfrom adjacent nodes in the syntax tree, without long-distance constraints such as unification variables. Onemethod infers type arguments in polymorphic applications using a local constraint solver. The other infersannotations on bound variables in function abstractions by propagating...Keywords
This publication has 0 references indexed in Scilit: