{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T14:30:10Z","timestamp":1726237810821},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983100"},{"type":"electronic","value":"9789819983117"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8311-7_4","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T07:02:17Z","timestamp":1700636537000},"page":"69-90","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Diamond Machine for\u00a0Strong Evaluation"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4944-9944","authenticated-orcid":false,"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[]},{"given":"Pablo","family":"Barenbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-52921-8_1","volume-title":"Logic, Language, Information, and Computation","author":"B Accattoli","year":"2016","unstructured":"Accattoli, B.: The useful MAM, a reasonable implementation of the strong $$\\lambda $$-calculus. In: V\u00e4\u00e4n\u00e4nen, J., Hirvonen, \u00c5., de Queiroz, R. (eds.) WoLLIC 2016. LNCS, vol. 9803, pp. 1\u201321. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52921-8_1"},{"unstructured":"Accattoli, B., Barenbaum, P.: A diamond machine for strong evaluation. CoRR abs\/2309.12515 (2023). https:\/\/arxiv.org\/abs\/2309.12515","key":"4_CR2"},{"doi-asserted-by":"publisher","unstructured":"Accattoli, B., Barenbaum, P., Mazza, D.: Distilling abstract machines. In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, Gothenburg, Sweden, September 1\u20133, 2014, pp. 363\u2013376 (2014). https:\/\/doi.org\/10.1145\/2628136.2628154","key":"4_CR3","DOI":"10.1145\/2628136.2628154"},{"key":"4_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"},{"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\u201311, 2017, pp. 4\u201316. ACM (2017). https:\/\/doi.org\/10.1145\/3131851.3131855","key":"4_CR5","DOI":"10.1145\/3131851.3131855"},{"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\u201321, 2014, pp. 659\u2013670. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535886","key":"4_CR6","DOI":"10.1145\/2535838.2535886"},{"doi-asserted-by":"publisher","unstructured":"Accattoli, B., Condoluci, A., Guerrieri, G., Sacerdoti Coen, 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\u20139, 2019, pp. 4:1\u20134:15. ACM (2019). https:\/\/doi.org\/10.1145\/3354166.3354169","key":"4_CR7","DOI":"10.1145\/3354166.3354169"},{"doi-asserted-by":"publisher","unstructured":"Accattoli, B., Condoluci, A., Sacerdoti Coen, 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","key":"4_CR8","DOI":"10.1109\/LICS52264.2021.9470630"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-34175-6_9","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2019","unstructured":"Accattoli, B., Faggian, C., Guerrieri, G.: Factorization and normalization, essentially. In: Lin, A.W. (ed.) APLAS 2019. LNCS, vol. 11893, pp. 159\u2013180. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_9"},{"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","key":"4_CR10","DOI":"10.1016\/j.scico.2019.03.002"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0890-5401(87)90001-0","volume":"75","author":"HP Barendregt","year":"1987","unstructured":"Barendregt, H.P., Kennaway, R., Klop, J.W., Sleep, M.R.: Needed reduction and spine strategies for the lambda calculus. Inf. Comput. 75(3), 191\u2013231 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90001-0","journal-title":"Inf. Comput."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-64437-6_8","volume-title":"Programming Languages and Systems","author":"M Biernacka","year":"2020","unstructured":"Biernacka, M., Biernacki, D., Charatonik, W., Drab, T.: An abstract machine for strong call by value. In: Oliveira, B.C.S. (ed.) APLAS 2020. LNCS, vol. 12470, pp. 147\u2013166. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64437-6_8"},{"doi-asserted-by":"publisher","unstructured":"Biernacka, M., Biernacki, D., Lenglet, S., Schmitt, A.: Non-deterministic abstract machines. In: Klin, B., Lasota, S., Muscholl, A. (eds.) 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12\u201316, 2022, Warsaw, Poland. LIPIcs, vol. 243, pp. 7:1\u20137:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2022.7","key":"4_CR13","DOI":"10.4230\/LIPIcs.CONCUR.2022.7"},{"doi-asserted-by":"publisher","unstructured":"Biernacka, M., Charatonik, W.: Deriving an abstract machine for strong call by need. In: Geuvers, H. (ed.) 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24\u201330, 2019, Dortmund, Germany. LIPIcs, vol. 131, pp. 8:1\u20138:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.8","key":"4_CR14","DOI":"10.4230\/LIPIcs.FSCD.2019.8"},{"doi-asserted-by":"publisher","unstructured":"Biernacka, M., Charatonik, W., Drab, T.: A derived reasonable abstract machine for strong call by value. In: Veltri, N., Benton, N., Ghilezan, S. (eds.) PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, Tallinn, Estonia, September 6\u20138, 2021, pp. 6:1\u20136:14. ACM (2021). https:\/\/doi.org\/10.1145\/3479394.3479401","key":"4_CR15","DOI":"10.1145\/3479394.3479401"},{"doi-asserted-by":"publisher","unstructured":"Biernacka, M., Charatonik, W., Drab, T.: A simple and efficient implementation of strong call by need by an abstract machine. Proc. ACM Program. Lang. 6(ICFP), 109\u2013136 (2022). https:\/\/doi.org\/10.1145\/3549822","key":"4_CR16","DOI":"10.1145\/3549822"},{"doi-asserted-by":"publisher","unstructured":"Biernacka, M., Charatonik, W., Zielinska, K.: Generalized refocusing: from hybrid strategies to abstract machines. In: 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3\u20139, 2017, Oxford, UK, pp. 10:1\u201310:17 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.10","key":"4_CR17","DOI":"10.4230\/LIPIcs.FSCD.2017.10"},{"unstructured":"Boudol, G.: Computational semantics of term rewriting systems. In: Algebraic Methods in Semantics, pp. 169\u2013236. Cambridge University Press (1986)","key":"4_CR18"},{"doi-asserted-by":"publisher","unstructured":"de Carvalho, D., Pagani, M., Tortora de Falco, L.: A semantic measure of the execution time in linear logic. Theor. Comput. Sci. 412(20), 1884\u20131902 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.017","key":"4_CR19","DOI":"10.1016\/j.tcs.2010.12.017"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10990-007-9015-z","volume":"20","author":"P Cr\u00e9gut","year":"2007","unstructured":"Cr\u00e9gut, P.: Strongly reducing variants of the Krivine abstract machine. High. Order Symb. Comput. 20(3), 209\u2013230 (2007). https:\/\/doi.org\/10.1007\/s10990-007-9015-z","journal-title":"High. Order Symb. Comput."},{"issue":"1\u20133","key":"4_CR21","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."},{"doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in Reduction Semantics. Tech. Rep. RS-04-26, BRICS (2004)","key":"4_CR22","DOI":"10.7146\/brics.v11i26.21851"},{"key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796819000017","volume":"29","author":"\u00c1 Garc\u00eda-P\u00e9rez","year":"2019","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Nogueira, P.: The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus. J. Funct. Program. 29, e7 (2019). https:\/\/doi.org\/10.1017\/S0956796819000017","journal-title":"J. Funct. Program."},{"doi-asserted-by":"publisher","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Nogueira, P., Moreno-Navarro, J.J.: Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order. In: 15th International Symposium on Principles and Practice of Declarative Programming, PPDP\u201913, pp. 85\u201396. ACM (2013). https:\/\/doi.org\/10.1145\/2505879.2505887","key":"4_CR24","DOI":"10.1145\/2505879.2505887"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J Girard","year":"1998","unstructured":"Girard, J.: Light linear logic. Inf. Comput. 143(2), 175\u2013204 (1998). https:\/\/doi.org\/10.1006\/inco.1998.2700","journal-title":"Inf. Comput."},{"doi-asserted-by":"publisher","unstructured":"Gonthier, G., L\u00e9vy, J.J., Melli\u00e8s, P.A.: An abstract standardisation theorem. In: Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS \u201992), Santa Cruz, California, USA, June 22\u201325, 1992, pp. 72\u201381. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/LICS.1992.185521","key":"4_CR26","DOI":"10.1109\/LICS.1992.185521"},{"unstructured":"Huet, G.P., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems, I. In: Lassez, J., Plotkin, G.D. (eds.) Computational Logic - Essays in Honor of Alan Robinson, pp. 395\u2013414. The MIT Press (1991)","key":"4_CR27"},{"unstructured":"Huet, G.P., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems, II. In: Lassez, J., Plotkin, G.D. (eds.) Computational Logic - Essays in Honor of Alan Robinson, pp. 415\u2013443. The MIT Press (1991)","key":"4_CR28"},{"doi-asserted-by":"publisher","unstructured":"Maranget, L.: Optimal derivations in weak lambda-calculi and in orthogonal terms rewriting systems. In: Wise, D.S. (ed.) Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21\u201323, 1991, pp. 255\u2013269. ACM Press (1991). https:\/\/doi.org\/10.1145\/99583.99618","key":"4_CR29","DOI":"10.1145\/99583.99618"},{"unstructured":"Melli\u00e8s, P.A.: Description Abstraite de syst\u00e8me de r\u00e9\u00e9criture. PhD thesis, Paris 7 University (1996)","key":"4_CR30"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-48685-2_5","volume-title":"Rewriting Techniques and Applications","author":"V Oostrom","year":"1999","unstructured":"Oostrom, V.: Normalisation in weakly orthogonal rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 60\u201374. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48685-2_5"},{"unstructured":"Terese: Term rewriting systems. Cambridge tracts in theoretical computer science, vol. 55. Cambridge University Press (2003)","key":"4_CR32"}],"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-99-8311-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T07:03:39Z","timestamp":1700636619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8311-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819983100","9789819983117"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8311-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}