{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:07:12Z","timestamp":1770278832147,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,28]],"date-time":"2012-01-28T00:00:00Z","timestamp":1327708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,28]]},"DOI":"10.1145\/2103786.2103795","type":"proceedings-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:33Z","timestamp":1328021373000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":132,"title":["Giving Haskell a promotion"],"prefix":"10.1145","author":[{"given":"Brent A.","family":"Yorgey","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Weirich","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Cretin","sequence":"additional","affiliation":[{"name":"INRIA, Rocquencourt, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, England UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Vytiniotis","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, England UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Pedro","family":"Magalh\u00e3es","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292597.1292608"},{"key":"e_1_3_2_1_2_1","first-page":"117","volume-title":"Lambda calculi with types","author":"Barendregt H. P.","year":"1992","unstructured":"H. P. Barendregt . Lambda calculi with types , pages 117 -- 309 . Oxford University Press, Inc. , New York, NY, USA , 1992 . H. P. Barendregt. Lambda calculi with types, pages 117--309. Oxford University Press, Inc., New York, NY, USA, 1992."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran . Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science . Springer-Verlag , 1 edition, June 2004 . Y. Bertot and P. Cast\u00e9ran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer-Verlag, 1 edition, June 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"Constraint Kinds for GHC","author":"Bolingbroke M.","year":"2011","unstructured":"M. Bolingbroke . Constraint Kinds for GHC . 2011 . URL http:\/\/blog.omega-prime.co.uk\/?p=127. M. Bolingbroke. Constraint Kinds for GHC. 2011. URL http:\/\/blog.omega-prime.co.uk\/?p=127."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806612"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317906"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596638.1596650"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199475"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/648085.747179"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645892.671442"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411212"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017488"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/604174.604179"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086391"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103697"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481848.1481851"},{"key":"e_1_3_2_1_18_1","volume-title":"Haskell 2010 Language Report","author":"Marlow S.","year":"2010","unstructured":"S. Marlow , editor. Haskell 2010 Language Report . 2010 . URL http:\/\/www.haskell.org\/onlinereport\/haskell2010\/. S. Marlow, editor. Haskell 2010 Language Report. 2010. URL http:\/\/www.haskell.org\/onlinereport\/haskell2010\/."},{"key":"e_1_3_2_1_19_1","unstructured":"C. McBride. The Strathclyde Haskell Enhancement. URL http:\/\/personal.cis.strath.ac.uk\/ conor\/pub\/she\/.  C. McBride. The Strathclyde Haskell Enhancement. URL http:\/\/personal.cis.strath.ac.uk\/ conor\/pub\/she\/."},{"key":"e_1_3_2_1_20_1","unstructured":"C. McBride. Kleisli arrows of outrageous fortune. 2011. URL http:\/\/personal.cis.strath.ac.uk\/ conor\/Kleisli.pdf.  C. McBride. Kleisli arrows of outrageous fortune. 2011. URL http:\/\/personal.cis.strath.ac.uk\/ conor\/Kleisli.pdf."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1991.151642"},{"key":"e_1_3_2_1_22_1","volume-title":"Singleton types here Singleton types there Singleton Types Everywhere","author":"Monnier S.","year":"2009","unstructured":"S. Monnier and D. Haguenauer . Singleton types here Singleton types there Singleton Types Everywhere , 2009 . S. Monnier and D. Haguenauer. Singleton types here Singleton types there Singleton Types Everywhere, 2009."},{"key":"e_1_3_2_1_23_1","volume-title":"Towards a practical programming language based on dependent type theory","author":"Norell U.","year":"2007","unstructured":"U. Norell . Towards a practical programming language based on dependent type theory . Chalmers University of Technology , 2007 . U. Norell. Towards a practical programming language based on dependent type theory. Chalmers University of Technology, 2007."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159811"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411215"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596599"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.10.040"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88059-2_5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190315.1190324"},{"key":"e_1_3_2_1_30_1","first-page":"266","volume-title":"Secure distributed programming with value-dependent types","author":"Swamy N.","unstructured":"N. Swamy , J. Chen , C. Fournet , P.-Y. Strub , K. Bhargavan , and J. Yang . Secure distributed programming with value-dependent types . pages 266 -- 278 . N. Swamy, J. Chen, C. Fournet, P.-Y. Strub, K. Bhargavan, and J. Yang. Secure distributed programming with value-dependent types. pages 266--278."},{"key":"e_1_3_2_1_31_1","unstructured":"The Coq Team. Coq. URL http:\/\/coq.inria.fr.  The Coq Team. Coq. URL http:\/\/coq.inria.fr."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351248"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926411"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Philadelphia Pennsylvania USA","acronym":"POPL '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103786.2103795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103786.2103795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:36Z","timestamp":1750241196000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103786.2103795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,28]]},"references-count":32,"alternative-id":["10.1145\/2103786.2103795","10.1145\/2103786"],"URL":"https:\/\/doi.org\/10.1145\/2103786.2103795","relation":{},"subject":[],"published":{"date-parts":[[2012,1,28]]},"assertion":[{"value":"2012-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}