Local Type Inference

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. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory General Terms: Languages, Theory Additional Key Words and Phrases: Polymorphism, subtyping, type inference

• Type: Conference
• Year: 1998
• Where: POPL
• Authors: Benjamin C. Pierce, David N. Turner
• Keywords: Additional Key Words, POPL 1998, Programming Languages, Type Constraints, Type Inference