{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:10Z","timestamp":1751660530804,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["C14\/20\/079"],"award-info":[{"award-number":["C14\/20\/079"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1704041"],"award-info":[{"award-number":["1704041"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,18]]},"DOI":"10.1145\/3471874.3472985","type":"proceedings-article","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T02:11:59Z","timestamp":1629339119000},"page":"85-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Seeking stability by being lazy and shallow: lazy and shallow instantiation is user friendly"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8770-9765","authenticated-orcid":false,"given":"Gert-Jan","family":"Bottu","sequence":"first","affiliation":[{"name":"KU Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7669-9781","authenticated-orcid":false,"given":"Richard A.","family":"Eisenberg","sequence":"additional","affiliation":[{"name":"Tweag, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000150"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.5.639"},{"key":"e_1_3_2_1_3_1","volume-title":"Associated Type Synonyms. In International Conference on Functional Programming (ICFP \u201905)","author":"Chakravarty Manuel M. T.","year":"2005","unstructured":"Manuel M. T. Chakravarty , Gabriele Keller , and Simon Peyon Jones . 2005 . Associated Type Synonyms. In International Conference on Functional Programming (ICFP \u201905) . ACM. Manuel M. T. Chakravarty, Gabriele Keller, and Simon Peyon Jones. 2005. Associated Type Synonyms. In International Conference on Functional Programming (ICFP \u201905). ACM."},{"key":"e_1_3_2_1_4_1","volume-title":"Principal Type-schemes for Functional Programs. In Symposium on Principles of Programming Languages (POPL \u201982)","author":"Damas Luis","year":"1982","unstructured":"Luis Damas and Robin Milner . 1982 . Principal Type-schemes for Functional Programs. In Symposium on Principles of Programming Languages (POPL \u201982) . ACM. Luis Damas and Robin Milner. 1982. Principal Type-schemes for Functional Programs. In Symposium on Principles of Programming Languages (POPL \u201982). ACM."},{"volume-title":"Complete and Easy Bidirectional Typechecking for Higher-rank Polymorphism. In International Conference on Functional Programming (ICFP \u201913)","author":"Dunfield Jana","key":"e_1_3_2_1_5_1","unstructured":"Jana Dunfield and Neelakantan R. Krishnaswami . 2013 . Complete and Easy Bidirectional Typechecking for Higher-rank Polymorphism. In International Conference on Functional Programming (ICFP \u201913) . ACM. Jana Dunfield and Neelakantan R. Krishnaswami. 2013. Complete and Easy Bidirectional Typechecking for Higher-rank Polymorphism. In International Conference on Functional Programming (ICFP \u201913). ACM."},{"key":"e_1_3_2_1_6_1","unstructured":"Richard A. Eisenberg. 2018. Binding type variables in lambda-expressions. GHC Proposal #155. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/blob\/master\/proposals\/0155-type-lambda.rst  Richard A. Eisenberg. 2018. Binding type variables in lambda-expressions. GHC Proposal #155. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/blob\/master\/proposals\/0155-type-lambda.rst"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242744.3242753"},{"key":"e_1_3_2_1_8_1","volume-title":"Simon Peyton Jones, and Stephanie Weirich","author":"Eisenberg Richard A.","year":"2014","unstructured":"Richard A. Eisenberg , Dimitrios Vytiniotis , Simon Peyton Jones, and Stephanie Weirich . 2014 . Closed Type Families with Overlapping Equations. In Principles of Programming Languages (POPL \u201914). ACM. Richard A. Eisenberg, Dimitrios Vytiniotis, Simon Peyton Jones, and Stephanie Weirich. 2014. Closed Type Families with Overlapping Equations. In Principles of Programming Languages (POPL \u201914). ACM."},{"key":"e_1_3_2_1_9_1","volume-title":"Visible Type Application. In European Symposium on Programming (ESOP) (LNCS). Springer-Verlag.","author":"Eisenberg Richard A.","year":"2016","unstructured":"Richard A. Eisenberg , Stephanie Weirich , and Hamidhasan Ahmed . 2016 . Visible Type Application. In European Symposium on Programming (ESOP) (LNCS). Springer-Verlag. Richard A. Eisenberg, Stephanie Weirich, and Hamidhasan Ahmed. 2016. Visible Type Application. In European Symposium on Programming (ESOP) (LNCS). Springer-Verlag."},{"key":"e_1_3_2_1_10_1","volume-title":"Practical Foundations for Programming Languages","author":"Harper Robert","unstructured":"Robert Harper . 2016. Practical Foundations for Programming Languages ( 2 nd ed.). Cambridge University Press . Robert Harper. 2016. Practical Foundations for Programming Languages (2nd ed.). Cambridge University Press.","edition":"2"},{"key":"e_1_3_2_1_11_1","volume-title":"Type Classes with Functional Dependencies. In European Symposium on Programming.","author":"Jones Mark P.","year":"2000","unstructured":"Mark P. Jones . 2000 . Type Classes with Functional Dependencies. In European Symposium on Programming. Mark P. Jones. 2000. Type Classes with Functional Dependencies. In European Symposium on Programming."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.006"},{"key":"e_1_3_2_1_13_1","unstructured":"Simon Marlow (editor). 2010. Haskell 2010 Language Report.  Simon Marlow (editor). 2010. Haskell 2010 Language Report."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237729"},{"key":"e_1_3_2_1_15_1","unstructured":"Simon Peyton Jones. 2019. Simplify subsumption. GHC Proposal #287. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/blob\/master\/proposals\/0287-simplify-subsumption.rst  Simon Peyton Jones. 2019. Simplify subsumption. GHC Proposal #287. https:\/\/github.com\/ghc-proposals\/ghc-proposals\/blob\/master\/proposals\/0287-simplify-subsumption.rst"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806006034"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345100"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06859-7_148"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796818000242"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408971"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192389"},{"key":"e_1_3_2_1_22_1","volume-title":"Simon Peyton Jones, and Tom Schrijvers","author":"Vytiniotis Dimitrios","year":"2010","unstructured":"Dimitrios Vytiniotis , Simon Peyton Jones, and Tom Schrijvers . 2010 . Let Should Not Be Generalized. In Types in Language Design and Implementation (TLDI \u201910). ACM. Dimitrios Vytiniotis, Simon Peyton Jones, and Tom Schrijvers. 2010. Let Should Not Be Generalized. In Types in Language Design and Implementation (TLDI \u201910). ACM."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Philip Wadler and Stephen Blott. 1989. How to Make ad-hoc Polymorphism Less ad-hoc. In POPL. ACM 60\u201376.  Philip Wadler and Stephen Blott. 1989. How to Make ad-hoc Polymorphism Less ad-hoc. In POPL. ACM 60\u201376.","DOI":"10.1145\/75277.75283"},{"volume-title":"System FC with Explicit Kind Equality. In International Conference on Functional Programming (ICFP \u201913)","author":"Weirich Stephanie","key":"e_1_3_2_1_24_1","unstructured":"Stephanie Weirich , Justin Hsu , and Richard A. Eisenberg . 2013 . System FC with Explicit Kind Equality. In International Conference on Functional Programming (ICFP \u201913) . ACM. Stephanie Weirich, Justin Hsu, and Richard A. Eisenberg. 2013. System FC with Explicit Kind Equality. In International Conference on Functional Programming (ICFP \u201913). ACM."}],"event":{"name":"ICFP '21: 26th ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Republic of Korea","acronym":"ICFP '21"},"container-title":["Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471874.3472985","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471874.3472985","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471874.3472985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:49Z","timestamp":1750195489000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471874.3472985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":24,"alternative-id":["10.1145\/3471874.3472985","10.1145\/3471874"],"URL":"https:\/\/doi.org\/10.1145\/3471874.3472985","relation":{},"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"2021-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}