Another Type Inference Algorithm for First-Class Implicit Polymorphism
Abstract
We propose yet another approach to type inference with first-class implicit polymorphism, based on the interleaving of an Algorithm M-style constraint-generating elaboration of terms and a solver for the generated constraints. The novelty of our approach is that types include explicit syntactic representations of unknown polymorphic types during type inference. Solving unification constraints with unknown polymorphic types also computes type arguments for the elaborated terms. The resulting system is uniform, simple, extends to support domain-specific constraints, and compares favorably with other approaches to first-class implicit polymorphism.
Fields of Study & Subjects
Logic
programming
and type systems
Natural Language Processing Techniques
Constraint Satisfaction and Optimization
Publication details
- Journal / source
- Proceedings of the ACM on Programming Languages
- Publisher
- Association for Computing Machinery (ACM)
- Volume
- 10
- Issue
- ICFP
- Pages
- 863–891
- Publication date
- 17 August 2026
- Language
- EN