{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:20Z","timestamp":1750307660979,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,21]],"date-time":"2008-09-21T00:00:00Z","timestamp":1221955200000},"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":[[2008,9,21]]},"DOI":"10.1145\/1411304.1411309","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T13:39:01Z","timestamp":1222177141000},"page":"23-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Unrestricted pure call-by-value recursion"],"prefix":"10.1145","author":[{"given":"Johan","family":"Nordlander","sequence":"first","affiliation":[{"name":"Lulea University of Technology, Lule\u00e5, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Carlsson","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy J.","family":"Gill","sequence":"additional","affiliation":[{"name":"The University of Kansas, Lawrence, KS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,9,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Skew con\u00effluence and the lambda calculus with letrec. Annals of pure and applied logic, 117 ((1-3)): 95-178","author":"Ariola Z. M.","year":"2002","unstructured":"Z. M. Ariola and S. Blom . Skew con\u00effluence and the lambda calculus with letrec. Annals of pure and applied logic, 117 ((1-3)): 95-178 , 2002 . Z. M. Ariola and S. Blom. Skew con\u00effluence and the lambda calculus with letrec. Annals of pure and applied logic, 117 ((1-3)): 95-178, 2002."},{"key":"e_1_3_2_1_2_1","volume-title":"FICS 2002","author":"Boudol G\u00e9rard","year":"2002","unstructured":"G\u00e9rard Boudol and Pascal Zimmer . Recursion in the call-by-value \u03bb-calculus. In Fixed Points in Computer Science , FICS 2002 , Copenhagen, Denmark , July 2002 . G\u00e9rard Boudol and Pascal Zimmer. Recursion in the call-by-value \u03bb-calculus. In Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, July 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802037"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964026"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258973"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297052"},{"key":"e_1_3_2_1_7_1","first-page":"160","volume-title":"Principles and Practice of Declarative Programming","author":"Hirschowitz T.","year":"2003","unstructured":"T. Hirschowitz , X. Leroy , and J. Wells . Compilation of extended recursion in call-by-value functional languages . In Principles and Practice of Declarative Programming , pages 160 -- 171 . ACM Press , 2003 . 10.1145\/888251.888267 T. Hirschowitz, X. Leroy, and J. Wells. Compilation of extended recursion in call-by-value functional languages. In Principles and Practice of Declarative Programming, pages 160--171. ACM Press, 2003. 10.1145\/888251.888267"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645396.651960"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/290229.290234"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006326"},{"key":"e_1_3_2_1_12_1","volume-title":"The Timber home page","author":"Nordlander Johan","year":"2008","unstructured":"Johan Nordlander , Magnus Carlsson , Andy Gill , Per Lindgren , and Bj\u00f6rn von Sydow . The Timber home page , 2008 . URL http:\/\/timber-lang.org. Johan Nordlander, Magnus Carlsson, Andy Gill, Per Lindgren, and Bj\u00f6rn von Sydow. The Timber home page, 2008. URL http:\/\/timber-lang.org."},{"key":"e_1_3_2_1_13_1","unstructured":"OCaml. Objective Caml. http:\/\/caml.inria.fr\/ocaml\/.  OCaml. Objective Caml. http:\/\/caml.inria.fr\/ocaml\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647699.734159"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.038"}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Victoria BC Canada","acronym":"ICFP08"},"container-title":["Proceedings of the 2008 ACM SIGPLAN workshop on ML"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411304.1411309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411304.1411309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:29Z","timestamp":1750253369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411304.1411309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,21]]},"references-count":15,"alternative-id":["10.1145\/1411304.1411309","10.1145\/1411304"],"URL":"https:\/\/doi.org\/10.1145\/1411304.1411309","relation":{},"subject":[],"published":{"date-parts":[[2008,9,21]]},"assertion":[{"value":"2008-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}