A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
No abstract available.
Related papers
- Proofs about a Folklore Let-Polymorphic Type Inference Algorithm TOPLAS 1998
- Type inference, principal typings, and let-polymorphism for first-class mixin modules ICFP 2005
- Fast and precise hybrid type inference for JavaScript PLDI 2012
- Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems POPL 2026
- FreezeML: complete and easy type inference for first-class polymorphism PLDI 2020
- HM(X) type inference is CLP(X) solving JFP 2008
- Polymorphic Unification and ML Typing POPL 1989
- AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming OOPSLA 2024