{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:51Z","timestamp":1772164011973,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:00:00Z","timestamp":1327449600000},"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,25]]},"DOI":"10.1145\/2103656.2103713","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T11:47:19Z","timestamp":1327405639000},"page":"469-480","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A unified approach to fully lazy sharing"],"prefix":"10.1145","author":[{"given":"Thibaut","family":"Balabonski","sequence":"first","affiliation":[{"name":"Univ Paris Diderot, Sorbonne Paris Cit\u00e9, PPS, UMR 7126, CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002724"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199507"},{"key":"e_1_3_2_2_3_1","volume-title":"The optimal implementation of functional programming languages","author":"Asperti A.","year":"1998","unstructured":"A. Asperti and S. Guerrini . The optimal implementation of functional programming languages . Cambridge University Press , 1998 . A. Asperti and S. Guerrini. The optimal implementation of functional programming languages. Cambridge University Press, 1998."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268971"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"T. Balabonski. A Unified Approach to Fully Lazy Sharing. http:\/\/hal.archives-ouvertes.fr\/hal-00637048\/. Rapport technique PPS 2011.  T. Balabonski. A Unified Approach to Fully Lazy Sharing. http:\/\/hal.archives-ouvertes.fr\/hal-00637048\/. Rapport technique PPS 2011.","DOI":"10.1145\/2103656.2103713"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90001-0"},{"key":"e_1_3_2_2_7_1","volume-title":"Lambda Calculus and the Mind","author":"Blanc T.","year":"2007","unstructured":"T. Blanc , J.-J. L\u00e9vy , and L. Maranget . Sharing in the Weak Lambda-Calculus Revisited. In Reflections on Type Theory , Lambda Calculus and the Mind , 2007 . T. Blanc, J.-J. L\u00e9vy, and L. Maranget. Sharing in the Weak Lambda-Calculus Revisited. In Reflections on Type Theory, Lambda Calculus and the Mind, 2007."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759148.1759159"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00250-8"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_18"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.12.042"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/648223.748979"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2168279.2168301"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/115865.115890"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800068.802129"},{"key":"e_1_3_2_2_16_1","first-page":"190","volume-title":"FPCA","author":"Johnsson T.","year":"1985","unstructured":"T. Johnsson . Lambda lifting : Transforming programs to recursive equations . In FPCA , pages 190 -- 203 , 1985 . T. Johnsson. Lambda lifting: Transforming programs to recursive equations. In FPCA, pages 190--203, 1985."},{"key":"e_1_3_2_2_17_1","volume-title":"The Implementation of Functional Programming Languages","author":"Jones S. Peyton","year":"1987","unstructured":"S. Peyton Jones . The Implementation of Functional Programming Languages . Prentice-Hall, Inc. , 1987 . S. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, Inc., 1987."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90091-7"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96711"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_14"},{"key":"e_1_3_2_2_22_1","first-page":"159","volume-title":"Lambda Calculus and Formalisms","author":"L\u00e9vy J.-J.","year":"1980","unstructured":"J.-J. L\u00e9vy . Optimal reductions in the lambda-calculus. In To H.B. Curry: Essays on Combinatory Logic , Lambda Calculus and Formalisms , pages 159 -- 191 , 1980 . J.-J. L\u00e9vy. Optimal reductions in the lambda-calculus. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalisms, pages 159--191, 1980."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99618"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243996.1243997"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_16"},{"key":"e_1_3_2_2_27_1","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Terese. Term Rewriting Systems . Cambridge Univ.! Press , 2003 . Terese. Term Rewriting Systems. Cambridge Univ.! Press, 2003."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380090105"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/647195.720962"},{"issue":"5","key":"e_1_3_2_2_31_1","first-page":"2","article-title":"Optimal reduction in weak-\u0142-calculus with shared environments","volume":"11","author":"Yoshida N.","year":"1994","unstructured":"N. Yoshida . Optimal reduction in weak-\u0142-calculus with shared environments . J. of Computer Software , 11 ( 5 ): 2 -- 20 , 1994 . N. Yoshida. Optimal reduction in weak-\u0142-calculus with shared environments. J. of Computer Software, 11(5):2--20, 1994.","journal-title":"J. of Computer Software"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Philadelphia PA 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 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103713","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103656.2103713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:06:21Z","timestamp":1750226781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,25]]},"references-count":30,"alternative-id":["10.1145\/2103656.2103713","10.1145\/2103656"],"URL":"https:\/\/doi.org\/10.1145\/2103656.2103713","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2103621.2103713","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,1,25]]},"assertion":[{"value":"2012-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}