A quick look at impredicativity

Alejandro Serrano, Jurriaan Hage, Simon Peyton Jones, Dimitrios Vytiniotis

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)
29 Downloads (Pure)


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.
Original languageEnglish
Article number89
JournalProceedings of the ACM on Programming Languages
Issue numberICFP
Publication statusPublished - 2 Aug 2020


  • constraint-based inference
  • impredicative polymorphism
  • Type systems


Dive into the research topics of 'A quick look at impredicativity'. Together they form a unique fingerprint.

Cite this