{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:13:05Z","timestamp":1773429185812,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819535842","type":"print"},{"value":"9789819535859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-3585-9_6","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:06:59Z","timestamp":1761804419000},"page":"107-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Positive Sharing and\u00a0Abstract Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4944-9944","authenticated-orcid":false,"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4360-6016","authenticated-orcid":false,"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5880-5379","authenticated-orcid":false,"given":"Jui-Hsuan","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P., L\u00e9vy, J.: Explicit substitutions. J. Funct. Program. 1(4), 375\u2013416 (1991). https:\/\/doi.org\/10.1017\/S0956796800000186","journal-title":"J. Funct. Program."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Accattoli, B.: Exponentials as substitutions and the cost of cut elimination in linear logic. Log. Methods Comput. Sci. 19(4) (2023). https:\/\/doi.org\/10.46298\/LMCS-19(4:23)2023","DOI":"10.46298\/LMCS-19(4:23)2023"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Barenbaum, P., Mazza, D.: Distilling abstract machines. In: 19th ACM SIGPLAN International Conference on Functional Programming, ICFP 2014, pp. 363\u2013376. ACM (2014). https:\/\/doi.org\/10.1145\/2628136.2628154","DOI":"10.1145\/2628136.2628154"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-26529-2_13","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2015","unstructured":"Accattoli, B., Barenbaum, P., Mazza, D.: A strong distillery. In: Feng, X., Park, S. (eds.) APLAS 2015. LNCS, vol. 9458, pp. 231\u2013250. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26529-2_13"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Barras, B.: Environments and the complexity of abstract machines. In: Vanhoof, W., Pientka, B. (eds.) Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017, pp. 4\u201316. ACM (2017). https:\/\/doi.org\/10.1145\/3131851.3131855","DOI":"10.1145\/3131851.3131855"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Bonelli, E., Kesner, D., Lombardi, C.: A nonstandard standardization theorem. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201914, San Diego, CA, USA, January 20-21, 2014. pp. 659\u2013670. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535886","DOI":"10.1145\/2535838.2535886"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Condoluci, A., Guerrieri, G., Sacerdoti\u00a0Coen, C.: Crumbling abstract machines. In: Komendantskaya, E. (ed.) Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019, Porto, Portugal, October 7-9, 2019. pp. 4:1\u20134:15. ACM (2019). https:\/\/doi.org\/10.1145\/3354166.3354169","DOI":"10.1145\/3354166.3354169"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Condoluci, A., Sacerdoti\u00a0Coen, C.: Strong call-by-value is reasonable, implosively. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470630","DOI":"10.1109\/LICS52264.2021.9470630"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Dal\u00a0Lago, U.: (leftmost-outermost) beta reduction is invariant, indeed. Log. Methods Comput. Sci. 12(1) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(1:4)2016","DOI":"10.2168\/LMCS-12(1:4)2016"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Dal\u00a0Lago, U., Vanoni, G.: Reasonable space for the $$\\lambda $$-calculus, logarithmically. In: Baier, C., Fisman, D. (eds.) LICS \u201922: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022. pp. 47:1\u201347:13. ACM (2022). https:\/\/doi.org\/10.1145\/3531130.3533362","DOI":"10.1145\/3531130.3533362"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Ghica, D., Guerrieri, G., Louren\u00e7o, C.B., Sacerdoti\u00a0Coen, C.: Closure conversion, flat environments, and the complexity of abstract machines. CoRR abs\/2507.15843 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2507.15843, accepted at PPDP 2025","DOI":"10.48550\/ARXIV.2507.15843"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Guerrieri, G.: Open call-by-value. In: Igarashi, A. (ed.) Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Hanoi, Vietnam, November 21-23, 2016, Proceedings. Lecture Notes in Computer Science, vol. 10017, pp. 206\u2013226 (2016). https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12","DOI":"10.1007\/978-3-319-47958-3_12"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Guerrieri, G.: Abstract machines for open call-by-value. Sci. Comput. Program. 184 (2019). https:\/\/doi.org\/10.1016\/J.SCICO.2019.03.002","DOI":"10.1016\/J.SCICO.2019.03.002"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-15205-4_30","volume-title":"Computer Science Logic","author":"B Accattoli","year":"2010","unstructured":"Accattoli, B., Kesner, D.: The structural $$\\lambda $$-calculus. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 381\u2013395. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15205-4_30"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Magliocca, F., Peyrot, L., Sacerdoti\u00a0Coen, C.: The cost of skeletal call-by-need, smoothly. In: Fern\u00e1ndez, M. (ed.) 10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025, July 14-20, 2025, Birmingham, UK. LIPIcs, vol.\u00a0337, pp. 5:1\u20135:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.FSCD.2025.5","DOI":"10.4230\/LIPICS.FSCD.2025.5"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Sacerdoti\u00a0Coen, C.: On the relative usefulness of fireballs. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pp. 141\u2013155. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/LICS.2015.23","DOI":"10.1109\/LICS.2015.23"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ic.2017.01.003","volume":"255","author":"B Accattoli","year":"2017","unstructured":"Accattoli, B., Sacerdoti Coen, C.: On the value of variables. Inf. Comput. 255, 224\u2013242 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.01.003","journal-title":"Inf. Comput."},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Sacerdoti\u00a0Coen, C., Wu, J.: Positive sharing and abstract machines. CoRR abs\/2506.14131 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2506.14131","DOI":"10.48550\/ARXIV.2506.14131"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Wu, J.H.: Positive focusing is directly useful. Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of MFPS XL, 3 (2024). https:\/\/doi.org\/10.46298\/entics.14758","DOI":"10.46298\/entics.14758"},{"issue":"1\u20133","key":"6_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/J.TCS.2008.01.044","volume":"398","author":"U Dal Lago","year":"2008","unstructured":"Dal Lago, U., Martini, S.: The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1\u20133), 32\u201350 (2008). https:\/\/doi.org\/10.1016\/J.TCS.2008.01.044","journal-title":"Theor. Comput. Sci."},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics & abstract machines. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996. pp. 394\u2013405. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561456","DOI":"10.1109\/LICS.1996.561456"},{"key":"6_CR22","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the $$\\lambda $$-calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts - III, Ebberup, Denmark, 25-28 August 1986. pp. 193\u2013222. North-Holland (1987)"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations. In: Cartwright, R. (ed.) Proceedings of the ACM SIGPLAN\u201993 Conference on Programming Language Design and Implementation (PLDI), Albuquerque, New Mexico, USA, June 23-25, 1993. pp. 237\u2013247. ACM (1993). https:\/\/doi.org\/10.1145\/155090.155113","DOI":"10.1145\/155090.155113"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/S10990-007-9014-0","volume":"20","author":"DP Friedman","year":"2007","unstructured":"Friedman, D.P., Ghuloum, A., Siek, J.G., Winebarger, O.L.: Improving the lazy Krivine machine. High. Order Symb. Comput. 20(3), 271\u2013293 (2007). https:\/\/doi.org\/10.1007\/S10990-007-9014-0","journal-title":"High. Order Symb. Comput."},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Gr\u00e9goire, B., Leroy, X.: A compiled implementation of strong reduction. In: Wand, M., Jones, S.L.P. (eds.) Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP \u201902), Pittsburgh, Pennsylvania, USA, October 4-6, 2002, pp. 235\u2013246. ACM (2002). https:\/\/doi.org\/10.1145\/581478.581501","DOI":"10.1145\/581478.581501"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Deusen, M.S.V., Lang, B. (eds.) Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, USA, January 1993, pp. 144\u2013154. ACM Press (1993). https:\/\/doi.org\/10.1145\/158511.158618","DOI":"10.1145\/158511.158618"},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0890-5401(03)00088-9","volume":"185","author":"PB Levy","year":"2003","unstructured":"Levy, P.B., Power, J., Thielecke, H.: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2), 182\u2013210 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00088-9","journal-title":"Inf. Comput."},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Miller, D., Wu, J.H.: A positive perspective on term representation (invited talk). In: Klin, B., Pimentel, E. (eds.) 31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland. LIPIcs, vol.\u00a0252, pp. 3:1\u20133:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.CSL.2023.3","DOI":"10.4230\/LIPICS.CSL.2023.3"},{"key":"6_CR29","unstructured":"Moggi, E.: Computational $$\\lambda $$-Calculus and Monads. LFCS report ECS-LFCS-88-66, University of Edinburgh (1988). http:\/\/www.lfcs.inf.ed.ac.uk\/reports\/88\/ECS-LFCS-88-66\/ECS-LFCS-88-66.pdf"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS \u201989), Pacific Grove, California, USA, June 5-8, 1989. pp. 14\u201323. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/LICS.1989.39155","DOI":"10.1109\/LICS.1989.39155"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. In: White, J.L. (ed.) Proceedings of the Conference on Lisp and Functional Programming, LFP 1992, San Francisco, California, USA, 22\u201324 June 1992, pp. 288\u2013298. ACM (1992). https:\/\/doi.org\/10.1145\/141471.141563","DOI":"10.1145\/141471.141563"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-36377-7_4","volume-title":"The Essence of Computation","author":"D Sands","year":"2002","unstructured":"Sands, D., Gustavsson, J., Moran, A.: Lambda calculi and linear speedups. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 60\u201382. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36377-7_4"},{"issue":"3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231\u2013264 (1997). https:\/\/doi.org\/10.1017\/S0956796897002712","journal-title":"J. Funct. Program."},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/S10990-007-9019-8","volume":"20","author":"M Wand","year":"2007","unstructured":"Wand, M.: On the correctness of the krivine machine. High. Order Symb. Comput. 20(3), 231\u2013235 (2007). https:\/\/doi.org\/10.1007\/S10990-007-9019-8","journal-title":"High. Order Symb. Comput."},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Wu, J.H.: Proofs as terms, terms as graphs. In: Hur, C. (ed.) APLAS 2023. LNCS, vol. 14405, pp. 91\u2013111. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8311-7_5","DOI":"10.1007\/978-981-99-8311-7_5"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3585-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:13:52Z","timestamp":1773425632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3585-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"ISBN":["9789819535842","9789819535859"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3585-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,31]]},"assertion":[{"value":"31 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/track\/aplas-2025\/aplas-2025-aplas-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}