{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:51:56Z","timestamp":1775868716489,"version":"3.50.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T00:00:00Z","timestamp":1596326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2020,8,2]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3408971","type":"journal-article","created":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T13:48:02Z","timestamp":1596462482000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["A quick look at impredicativity"],"prefix":"10.1145","volume":"4","author":[{"given":"Alejandro","family":"Serrano","sequence":"first","affiliation":[{"name":"47 Degrees, Spain \/ Utrecht University, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Hage","sequence":"additional","affiliation":[{"name":"Utrecht University, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Vytiniotis","sequence":"additional","affiliation":[{"name":"DeepMind, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,3]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Lennart Augustsson. 2011. Impredicative polymorphism: a use case. http:\/\/augustss.blogspot.com\/ 2011 \/07\/impredicativepolymorphism-use-case-in.html.  Lennart Augustsson. 2011. Impredicative polymorphism: a use case. http:\/\/augustss.blogspot.com\/ 2011 \/07\/impredicativepolymorphism-use-case-in.html."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944709"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Didier Le Botlan and Didier R\u00e9my. 2009. Recasting MLF. Inf. Comput. 207 6 ( 2009 ) 726-785.  Didier Le Botlan and Didier R\u00e9my. 2009. Recasting MLF. Inf. Comput. 207 6 ( 2009 ) 726-785.","DOI":"10.1016\/j.ic.2008.12.006"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500582"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290322"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242744.3242753"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_10"},{"key":"e_1_2_2_8_1","volume-title":"FreezeML: Complete and Easy Type Inference for First-Class Polymorphism. Presented at TyDe","author":"Emrich Frank","year":"2019","unstructured":"Frank Emrich , Sam Lindley , Jan Stolarek , and James Cheney . 2019. FreezeML: Complete and Easy Type Inference for First-Class Polymorphism. Presented at TyDe 2019 . Frank Emrich, Sam Lindley, Jan Stolarek, and James Cheney. 2019. FreezeML: Complete and Easy Type Inference for First-Class Polymorphism. Presented at TyDe 2019."},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Jacques Garrigue and Didier R\u00e9my. 1999. Semi-Explicit Higher-Order Polymorphism for ML. Information and Computation 155 1 \/2 ( 1999 ) 134-169. http:\/\/www.springerlink.com\/content\/m303472288241339\/ A preliminary version appeared in TACS' 97.  Jacques Garrigue and Didier R\u00e9my. 1999. Semi-Explicit Higher-Order Polymorphism for ML. Information and Computation 155 1 \/2 ( 1999 ) 134-169. http:\/\/www.springerlink.com\/content\/m303472288241339\/ A preliminary version appeared in TACS' 97.","DOI":"10.1006\/inco.1999.2830"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411245"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480891"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086385"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90011-R"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90009-0"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237729"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74836"},{"key":"e_1_2_2_18_1","unstructured":"Simon Peyton Jones. 2019. GHC Proposal: \u201cSimplify subsumption\u201d. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/pull\/ 287  Simon Peyton Jones. 2019. GHC Proposal: \u201cSimplify subsumption\u201d. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/pull\/ 287"},{"key":"e_1_2_2_19_1","article-title":"Practical type inference for arbitrary-rank types","volume":"17","author":"Peyton Jones Simon L.","year":"2007","unstructured":"Simon L. Peyton Jones , Dimitrios Vytiniotis , Stephanie Weirich , and Mark Shields . 2007 . Practical type inference for arbitrary-rank types . Journal of Functional Programming 17 , 1 ( 2007 ), 1-82. Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Mark Shields. 2007. Practical type inference for arbitrary-rank types. Journal of Functional Programming 17, 1 ( 2007 ), 1-82.","journal-title":"Journal of Functional Programming"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Frank Pfenning. 1995. On the Undecidability of Partial Polymorphic Type Reconstruction. Fundamenta Informaticae 19 ( 1995 ). Issue 1\/2.  Frank Pfenning. 1995. On the Undecidability of Partial Polymorphic Type Reconstruction. Fundamenta Informaticae 19 ( 1995 ). Issue 1\/2.","DOI":"10.3233\/FI-1993-191-208"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345100"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111058"},{"key":"e_1_2_2_23_1","volume-title":"Advanced Topics in Types and Programming Languages, Benjamin C","author":"Pottier Fran\u00e7ois","unstructured":"Fran\u00e7ois Pottier and Didier R\u00e9my . 2005. The Essence of ML Type Inference . In Advanced Topics in Types and Programming Languages, Benjamin C . Pierce (Ed.). MIT Press , Chapter 10, 389-489. http:\/\/cristal.inria.fr\/attapl\/ Fran\u00e7ois Pottier and Didier R\u00e9my. 2005. The Essence of ML Type Inference. In Advanced Topics in Types and Programming Languages, Benjamin C. Pierce (Ed.). MIT Press, Chapter 10, 389-489. http:\/\/cristal.inria.fr\/attapl\/"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086383"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596627.1596630"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192389"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796811000098"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159838"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411246"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408971","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3408971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:58Z","timestamp":1750193278000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,2]]},"references-count":29,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2020,8,2]]}},"alternative-id":["10.1145\/3408971"],"URL":"https:\/\/doi.org\/10.1145\/3408971","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,2]]},"assertion":[{"value":"2020-08-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}