{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T08:56:35Z","timestamp":1781859395199,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T00:00:00Z","timestamp":1421193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1219240"],"award-info":[{"award-number":["1219240"]}],"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":[[2015,1,14]]},"DOI":"10.1145\/2676726.2676988","type":"proceedings-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T08:51:05Z","timestamp":1418979065000},"page":"471-484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Self-Representation in Girard's System U"],"prefix":"10.1145","author":[{"given":"Matt","family":"Brown","sequence":"first","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"The webpage accompanying this paper is available at http:\/\/compilers.cs.ucla.edu\/popl15\/. The full paper with the appendix is available there as are the source code for our implementation of System U and our operations."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/26777"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398856.2364573"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800020062"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/162552.162561"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003573"},{"key":"e_1_3_2_2_7_1","unstructured":"Michel Bel. A recursion theoretic self interpreter for the lambda- calculus. http:\/\/www.belxs.com\/michel\/#selfint."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647842.736403"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944730"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005617"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411226"},{"key":"e_1_3_2_2_13_1","volume-title":"http:\/\/mxr.mozilla.org\/mozilla\/ source\/js\/narcissus\/jsexec.js","author":"Eich Brendan","year":"2010","unstructured":"Brendan Eich. Narcissus. http:\/\/mxr.mozilla.org\/mozilla\/ source\/js\/narcissus\/jsexec.js, 2010."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800020037"},{"key":"e_1_3_2_2_15_1","volume-title":"Logics and type systems","author":"Geuvers Jan Herman","year":"1993","unstructured":"Jan Herman Geuvers. Logics and type systems. 1993."},{"key":"e_1_3_2_2_16_1","unstructured":"Jean-Yves Girard. Interpr\u00e9tation fonctionelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9rieur. PhD thesis Universit\u00e9 Paris VII 1972."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034808"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-36-00227-2"},{"key":"e_1_3_2_2_19_1","unstructured":"Oleg Mazonka and Daniel B. Cristofani. A very short self-interpreter. http:\/\/arxiv.org\/html\/cs\/0311032v1 November 2003."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863495.1863497"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/367177.367199"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000423"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010058213619"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_2_25_1","first-page":"25","article-title":"Evaluating Haskell","volume":"10","author":"Naylor Matthew","year":"2008","unstructured":"Matthew Naylor. Evaluating Haskell in Haskell. The Monad.Reader, 10:25--33, 2008.","journal-title":"Haskell. The Monad.Reader"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90109-U"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542509"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_2_29_1","volume-title":"http:\/\/www.mpi-sws.org\/ rossberg\/hamlet","author":"Rossberg Andreas","year":"2010","unstructured":"Andreas Rossberg. HaMLet. http:\/\/www.mpi-sws.org\/ rossberg\/hamlet, 2010."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/641888.641889"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00190-5"},{"key":"e_1_3_2_2_32_1","volume-title":"Kolmogorov Complexity and Applications","author":"Tromp John","year":"2006","unstructured":"John Tromp. Binary lambda calculus and combinatory logic. In Kolmogorov Complexity and Applications, 2006. A Revised Version is available at http:\/\/homepages.cwi.nl\/ tromp\/cl\/LC.pdf."},{"key":"e_1_3_2_2_33_1","unstructured":"Philip Wadler. The expression problem. http:\/\/www.daimi.au.dk\/madst\/tool\/papers\/expression.txt."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297081.1297086"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944728"},{"key":"e_1_3_2_2_36_1","volume-title":"http:\/\/en.wikipedia.org\/wiki\/PyPy","year":"2010","unstructured":"Wikipedia. PyPy. http:\/\/en.wikipedia.org\/wiki\/PyPy, 2010."},{"key":"e_1_3_2_2_37_1","volume-title":"http:\/\/en.wikipedia.org\/wiki\/Rubinius","year":"2010","unstructured":"Wikipedia. Rubinius. http:\/\/en.wikipedia.org\/wiki\/Rubinius, 2010."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244404"}],"event":{"name":"POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Mumbai India","acronym":"POPL '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2676988","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2676726.2676988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T08:36:27Z","timestamp":1781858187000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2676988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,14]]},"references-count":38,"alternative-id":["10.1145\/2676726.2676988","10.1145\/2676726"],"URL":"https:\/\/doi.org\/10.1145\/2676726.2676988","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775051.2676988","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,14]]},"assertion":[{"value":"2015-01-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}