Local type inference

doi:10.1145/345099.345100

Local type inference

2000-01-01

0

OA

AI

DOI：10.1145/345099.345100

原文链接

查看原文

摘要

En 中文

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.

Local type inference

摘要

AI总结

期刊

机构

引用论文