{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:08:05Z","timestamp":1774987685770,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,9,19]],"date-time":"2011-09-19T00:00:00Z","timestamp":1316390400000},"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":[[2011,9,19]]},"DOI":"10.1145\/2034773.2034808","type":"proceedings-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T09:50:16Z","timestamp":1316512216000},"page":"247-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Typed self-interpretation by pattern matching"],"prefix":"10.1145","author":[{"given":"Barry","family":"Jay","sequence":"first","affiliation":[{"name":"University of Technology, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,9,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of Computer Programs","author":"Abelson Harold","year":"1985"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800020062"},{"key":"e_1_3_2_2_3_1","volume-title":"Handbook of Logic in Computer Science (vol. 2): Background: Computational Structures: Abramski,S (ed)","author":"Barendregt HP","year":"1993"},{"key":"e_1_3_2_2_4_1","unstructured":"Michel Bel. A recursion theoretic self interpreter for the lambda-calculus. http:\/\/www.belxs.com\/michel\/#selfint.  Michel Bel. A recursion theoretic self interpreter for the lambda-calculus. http:\/\/www.belxs.com\/michel\/#selfint."},{"key":"e_1_3_2_2_5_1","first-page":"85","volume-title":"CSL","author":"Berarducci Alessandro","year":"1992"},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of Workshop on Normalization by Evaluation","author":"Boespflug Mathieu","year":"2009"},{"key":"e_1_3_2_2_7_1","unstructured":"bondi programming language. www-staff.it.uts.edu.au\/~cbj\/bondi.  bondi programming language. www-staff.it.uts.edu.au\/~cbj\/bondi."},{"key":"e_1_3_2_2_8_1","unstructured":"Reg Braithwaite. The significance of the meta-circular interpreter. http:\/\/weblog.raganwald.com\/2006\/11\/significance-of-meta-circular_22.html November 2006.  Reg Braithwaite. The significance of the meta-circular interpreter. http:\/\/weblog.raganwald.com\/2006\/11\/significance-of-meta-circular_22.html November 2006."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of ESOP'03","author":"Danvy Olivier","year":"2003"},{"key":"e_1_3_2_2_11_1","volume-title":"The Sign of the Four","author":"Conan Doyle Sir Arthur","year":"1890"},{"key":"e_1_3_2_2_12_1","volume-title":"http:\/\/mxr.mozilla.org\/mozilla\/source\/js\/narcissus\/jsexec.js","author":"Eich Brendan","year":"2010"},{"key":"e_1_3_2_2_13_1","volume-title":"Proofs and Types. Tracts in Theoretical Computer Science","author":"Girard J-Y.","year":"1989"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(89)80066-5"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/9194"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1629670"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1309952521"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808007144"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1034774.1034775"},{"key":"e_1_3_2_2_20_1","volume-title":"Introduction to Methamathematics. van Nostrand","author":"Kleene S.C.","year":"1952"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-36-00227-2"},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of OOPSLA Workshop on Reflection and Metalevel Architectures. ACM","author":"L\u00e4ufer Konstantin","year":"1993"},{"key":"e_1_3_2_2_23_1","unstructured":"Oleg Mazonka and Daniel B. Cristofani. A very short self-interpreter. http:\/\/arxiv.org\/html\/cs\/0311032v1 November 2003.  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_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90009-0"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000423"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010058213619"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268954"},{"key":"e_1_3_2_2_28_1","first-page":"25","article-title":"Evaluating Haskell","volume":"10","author":"Naylor Matthew","year":"2008","journal-title":"Haskell. The Monad.Reader"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90109-U"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086383"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542509"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176617.1176753"},{"key":"e_1_3_2_2_34_1","volume-title":"http:\/\/www.mpi-sws.org\/rossberg\/hamlet","author":"Rossberg Andreas","year":"2010"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00190-5"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645774.668114"},{"key":"e_1_3_2_2_37_1","series-title":"Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","year":"2003"},{"key":"e_1_3_2_2_38_1","volume-title":"Kolmogorov Complexity and Applications","author":"Tromp John","year":"2006"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316068"},{"key":"e_1_3_2_2_40_1","volume-title":"http:\/\/en.wikipedia.org\/wiki\/PyPy","year":"2010"},{"key":"e_1_3_2_2_41_1","volume-title":"http:\/\/en.wikipedia.org\/wiki\/Rubinius","year":"2010"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244404"}],"event":{"name":"ICFP '11: ACM SIGPLAN International Conference on Functional Programming","location":"Tokyo Japan","acronym":"ICFP '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 16th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034773.2034808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2034773.2034808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:39Z","timestamp":1750225719000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034773.2034808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,19]]},"references-count":42,"alternative-id":["10.1145\/2034773.2034808","10.1145\/2034773"],"URL":"https:\/\/doi.org\/10.1145\/2034773.2034808","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2034574.2034808","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,9,19]]},"assertion":[{"value":"2011-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}