TY - JOUR
T1 - A quick look at impredicativity
AU - Serrano, Alejandro
AU - Hage, Jurriaan
AU - Peyton Jones, Simon
AU - Vytiniotis, Dimitrios
PY - 2020/8/2
Y1 - 2020/8/2
N2 - 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.
AB - 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.
KW - constraint-based inference
KW - impredicative polymorphism
KW - Type systems
UR - http://www.scopus.com/inward/record.url?scp=85090276568&partnerID=8YFLogxK
U2 - 10.1145/3408971
DO - 10.1145/3408971
M3 - Article
AN - SCOPUS:85090276568
SN - 2475-1421
VL - 4
SP - 1
EP - 29
JO - Proceedings of the ACM on Programming Languages
JF - Proceedings of the ACM on Programming Languages
IS - ICFP
M1 - 89
ER -