1. This article discusses two partial type inference methods for a language combining subtyping and impredicative polymorphism.
2. The 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.
3. The article is motivated by a statistical analysis of the uses of type inference in a sizable body of existing ML code.
The article is well-written and provides an overview of two partial type inference methods for a language combining subtyping and impredicative polymorphism. It is based on a statistical analysis of the uses of type inference in a sizable body of existing ML code, which provides evidence to support its claims. The article does not appear to be biased or one-sided, as it presents both sides equally and does not make any unsupported claims or omit any counterarguments. Furthermore, it does not contain any promotional content or partiality, and it notes possible risks associated with the use of these methods. In conclusion, this article appears to be trustworthy and reliable.