Journal article
Another Type Inference Algorithm for First-Class Implicit Polymorphism
Proceedings of ACM on programming languages, Vol.10(ICFP), pp.863-891
08/17/2026
DOI: 10.1145/3828702
Appears in UI Libraries Support Open Access
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.
Details
- Title: Subtitle
- Another Type Inference Algorithm for First-Class Implicit Polymorphism
- Creators
- J. Garrett Morris - University of Iowa, Computer Science
- Resource Type
- Journal article
- Publication Details
- Proceedings of ACM on programming languages, Vol.10(ICFP), pp.863-891
- DOI
- 10.1145/3828702
- ISSN
- 2475-1421
- eISSN
- 2475-1421
- Publisher
- Association for Computing Machinery (ACM)
- Number of pages
- 29
- Grant note
- 2044815 / National Science Foundation (https://doi.org/10.13039/100000001)
- Language
- English
- Date published
- 08/17/2026
- Academic Unit
- Computer Science
- Record Identifier
- 9985219742902771
Metrics
1 Record Views