{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:36:23Z","timestamp":1750221383499,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,12,25]],"date-time":"2017-12-25T00:00:00Z","timestamp":1514160000000},"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":[[2017,12,25]]},"DOI":"10.1145\/3162067","type":"proceedings-article","created":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T20:20:41Z","timestamp":1527884441000},"page":"67-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Recursive programs in normal form (short paper)"],"prefix":"10.1145","author":[{"given":"Barry","family":"Jay","sequence":"first","affiliation":[{"name":"University of Technology Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,12,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"H.P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics. North Holland. revised edition.  H.P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics . North Holland. revised edition."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800020062"},{"key":"e_1_3_2_1_3_1","first-page":"85","article-title":"A self-interpreter of lambda calculus having a normal form. Springer Berlin Heidelberg, Berlin","author":"Berarducci Alessandro","year":"1993","journal-title":"Heidelberg"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018882.3020004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863540"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009853"},{"volume":"1","volume-title":"Combinatory Logic. Combinatory Logic","author":"Curry H.B.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Yoshihiko Futamura. 1999. Partial Evaluation of Computation Process Revisited. Higher-Order and Symbolic Computation 12 4 (01 Dec 1999) 377-380.   Yoshihiko Futamura. 1999. Partial Evaluation of Computation Process Revisited. Higher-Order and Symbolic Computation 12 4 (01 Dec 1999) 377-380.","DOI":"10.1023\/A:1010043619517"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.09.040"},{"key":"e_1_3_2_1_10_1","unstructured":"Barry Jay. 2017. Deconstructing Lambda-Calculus. (October 2017).  Barry Jay. 2017. Deconstructing Lambda-Calculus. (October 2017)."},{"key":"e_1_3_2_1_11_1","unstructured":"Barry Jay. 2017. Intensional-computation repository of proofs in Coq. https:\/\/github.com\/Barry-Jay\/Intensional-computation.  Barry Jay. 2017. Intensional-computation repository of proofs in Coq. https:\/\/github.com\/Barry-Jay\/Intensional-computation."},{"volume-title":"The Thirty-third Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIII) (to appear).","year":"2017","author":"Jay Barry","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1309952521"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1520284.1520289"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2016.11.001"},{"key":"e_1_3_2_1_16_1","unstructured":"N.D. Jones C.K. Gomard and P. Sestoft. 1993. Partial Evaluation and Automatic Program Generation. Prentice Hall International.   N.D. Jones C.K. Gomard and P. Sestoft. 1993. Partial Evaluation and Automatic Program Generation . Prentice Hall International."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392415"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-36-00227-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000423"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010058213619"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"volume":"53","volume-title":"Tracts in Theoretical Computer Science","year":"2003","key":"e_1_3_2_1_22_1"}],"event":{"name":"POPL '18: The 45th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Los Angeles CA USA","acronym":"POPL '18"},"container-title":["Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3162067","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3162067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:54Z","timestamp":1750213614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3162067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,25]]},"references-count":22,"alternative-id":["10.1145\/3162067","10.1145\/3175493"],"URL":"https:\/\/doi.org\/10.1145\/3162067","relation":{},"subject":[],"published":{"date-parts":[[2017,12,25]]},"assertion":[{"value":"2017-12-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}