{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:08Z","timestamp":1772164028878,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"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":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500606","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"263-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Weak optimality, and the meaning of sharing"],"prefix":"10.1145","author":[{"given":"Thibaut","family":"Balabonski","sequence":"first","affiliation":[{"name":"Inria, Le Chesnay, France"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Thibaut\n      Balabonski\n    .\n  Axiomatic sharing-via-labelling\n  . In Ashish Tiwari editor RTA volume \n  15\n   of \n  LIPIcs pages \n  85\n  --\n  100\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer \n  Informatik 2012\n  .  Thibaut Balabonski. Axiomatic sharing-via-labelling. In Ashish Tiwari editor RTA volume 15 of LIPIcs pages 85--100. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103713"},{"key":"e_1_3_2_1_4_1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus -- Its Syntax and Semantics","author":"Barendregt Hendrik Pieter","year":"1984","unstructured":"Hendrik Pieter Barendregt . The Lambda Calculus -- Its Syntax and Semantics , volume 103 of Studies in Logic and the Foundations of Mathematics . North-Holland Publishing Company , Amsterdam , revised edition edition, 1984 . Hendrik Pieter Barendregt. The Lambda Calculus -- Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam, revised edition edition, 1984."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90001-0"},{"key":"e_1_3_2_1_7_1","first-page":"41","volume-title":"Reflections on Type Theory, Lambda Calculus, and the Mind","author":"Blanc Tomasz","year":"2007","unstructured":"Tomasz Blanc , Jean-Jacques L\u00e9vy , and Luc Maranget . Sharing in the weak lambda-calculus revisited . In Erik Barendsen, Herman Geuvers, Venanzio Capretta, and Milad Niqui, editors, Reflections on Type Theory, Lambda Calculus, and the Mind , pages 41 -- 50 . ICIS, Faculty of Science, Radbout University Nijmegen , 2007 . Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday. Tomasz Blanc, Jean-Jacques L\u00e9vy, and Luc Maranget. Sharing in the weak lambda-calculus revisited. In Erik Barendsen, Herman Geuvers, Venanzio Capretta, and Milad Niqui, editors, Reflections on Type Theory, Lambda Calculus, and the Mind, pages 41--50. ICIS, Faculty of Science, Radbout University Nijmegen, 2007. Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00250-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00054-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"John R.\n     W.\n  Glauert and Zurab Khasidashvili. Relative normalization in deterministic residual structures\n  . In H\u00e9l\u00e8ne Kirchner editor CAAP volume \n  1059\n   of \n  Lecture Notes in Computer Science pages \n  180\n  --\n  195\n  . \n  Springer 1996\n  .   John R. W. Glauert and Zurab Khasidashvili. Relative normalization in deterministic residual structures. In H\u00e9l\u00e8ne Kirchner editor CAAP volume 1059 of Lecture Notes in Computer Science pages 180--195. Springer 1996.","DOI":"10.1007\/3-540-61064-2_37"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70770-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Zurab\n      Khasidashvili\n    .\n  Optimal normalization in orthogonal term rewriting systems\n  . In Claude Kirchner editor RTA volume \n  690\n   of \n  Lecture Notes in Computer Science pages \n  243\n  --\n  258\n  . \n  Springer 1993\n  .   Zurab Khasidashvili. Optimal normalization in orthogonal term rewriting systems. In Claude Kirchner editor RTA volume 690 of Lecture Notes in Computer Science pages 243--258. Springer 1993.","DOI":"10.1007\/3-540-56868-9_19"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90091-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96711"},{"key":"e_1_3_2_1_17_1","first-page":"159","volume-title":"Lambda Calculus and Formalisms","author":"L\u00e9vy Jean-Jacques","year":"1980","unstructured":"Jean-Jacques 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 . Jean-Jacques 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_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99618"},{"key":"e_1_3_2_1_19_1","volume-title":"The Implementation of Functional Programming Languages","author":"Peyton-Jones Simon L.","year":"1987","unstructured":"Simon L. Peyton-Jones . The Implementation of Functional Programming Languages . Prentice-Hall , 1987 . Simon L. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987."},{"key":"e_1_3_2_1_20_1","volume-title":"A system of functional abstraction","author":"Scott Dana","year":"1968","unstructured":"Dana Scott . A system of functional abstraction , 1968 . Lectures delivered at University of California , Berkeley, Cal., 1962\/63. Dana Scott. A system of functional abstraction, 1968. Lectures delivered at University of California, Berkeley, Cal., 1962\/63."},{"key":"e_1_3_2_1_21_1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Seminar -- Terese","year":"2003","unstructured":"Terese. Term Rewriting Seminar -- Terese . Vol. 55 of Cambridge Tracts in Theoretical Computer Science . Cambridge University Press , 2003 . Terese. Term Rewriting Seminar -- Terese. Vol. 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Vincent\n      van Oostrom\n    .\n  Finite family developments\n  . In Hubert Comon editor RTA volume \n  1232\n   of \n  Lecture Notes in Computer Science pages \n  308\n  --\n  322\n  . \n  Springer 1997\n  .   Vincent van Oostrom. Finite family developments. In Hubert Comon editor RTA volume 1232 of Lecture Notes in Computer Science pages 308--322. Springer 1997.","DOI":"10.1007\/3-540-62950-5_80"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:33Z","timestamp":1750217673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":18,"alternative-id":["10.1145\/2500365.2500606","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500606","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500606","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}