Answers are grounded in this paper and cite their sources.
We present an O(n 3 ) time type inference algorithm for a type system with a largest type Τ , a smallest type ⊥, and the usual ordering between function types. The algorithm infers type annotations of least shape, and it works equally well for recursive types. For the problem of typability, our algorithm is simpler than the one of Kozen, Palsberg, and Schwartzbach for type inference without ⊥. This may be surprising, especially because the system with ⊥ is strictly more powerful.
No takes yet. Share an insight, caveat, or question.
Palsberg et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: