Making Type Inference Practical

@inproceedings{citeulike:2712897, abstract = {We present the implementation of a type inference algorithm for untyped objectoriented programs with inheritance, assignments, and late binding. The algorithm significantly improves our previous one, presented at OOPSLA'91, since it can handle collection classes, such as List, in a useful way. Also, the complexity has been dramatically improved, from exponential time to low polynomial time. The implementation uses the techniques of incremental graph construction and constraint template...}, author = {Oxhoj, Nicholas and Palsberg, Jens and Schwartzbach, Michael I. }, booktitle = {ECOOP}, citeulike-article-id = {2712897}, keywords = {type-systems}, pages = {329--349}, posted-at = {2008-04-24 13:26:54}, priority = {2}, title = {Making Type Inference Practical}, url = {http://citeseer.ist.psu.edu/oxhoj92making.html}, year = {1992} }

TY - CONF ID - citeulike:2712897 L3 - citeulike-article-id:2712897 TI - Making Type Inference Practical T2 - ECOOP SP - 329 EP - 349 N2 - We present the implementation of a type inference algorithm for untyped objectoriented programs with inheritance, assignments, and late binding. The algorithm significantly improves our previous one, presented at OOPSLA'91, since it can handle collection classes, such as List, in a useful way. Also, the complexity has been dramatically improved, from exponential time to low polynomial time. The implementation uses the techniques of incremental graph construction and constraint template... KW - type-systems AU - Oxhoj, Nicholas AU - Palsberg, Jens AU - Schwartzbach, Michael PY - 1992/// UR - http://citeseer.ist.psu.edu/oxhoj92making.html ER -