A quick look at impredicativity
Files
Publication date
2020-08-02
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
Abstract
Type inference for parametric polymorphism is wildly successful, but has always suffered from an embarrassing flaw: polymorphic types are themselves not first class. We present Quick Look, a practical, implemented, and deployable design for impredicative type inference. To demonstrate our claims, we have modified GHC, a production-quality Haskell compiler, to support impredicativity. The changes required are modest, localised, and are fully compatible with GHC's myriad other type system extensions.
Keywords
constraint-based inference, impredicative polymorphism, Type systems, Software, Safety, Risk, Reliability and Quality
Citation
Serrano, A, Hage, J, Peyton Jones, S & Vytiniotis, D 2020, 'A quick look at impredicativity', Proceedings of the ACM on Programming Languages, vol. 4, no. ICFP, 89, pp. 1-29. https://doi.org/10.1145/3408971