{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:56:53Z","timestamp":1742993813737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030644369"},{"type":"electronic","value":"9783030644376"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64437-6_8","type":"book-chapter","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T13:02:45Z","timestamp":1606395765000},"page":"147-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Abstract Machine for Strong Call by Value"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8094-0980","authenticated-orcid":false,"given":"Ma\u0142gorzata","family":"Biernacka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1477-4635","authenticated-orcid":false,"given":"Dariusz","family":"Biernacki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7062-0385","authenticated-orcid":false,"given":"Witold","family":"Charatonik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6629-5839","authenticated-orcid":false,"given":"Tomasz","family":"Drab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-47958-3_12","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2016","unstructured":"Accattoli, B., Guerrieri, G.: Open call-by-value. In: Igarashi, A. (ed.) APLAS 2016. LNCS, vol. 10017, pp. 206\u2013226. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12"},{"key":"8_CR2","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":"8_CR3","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Lago, U.D.: (Leftmost-outermost) beta reduction is invariant, indeed. In: Logical Methods in Computer Science, vol. 12 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(1:4)2016","DOI":"10.2168\/LMCS-12(1:4)2016"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1017\/S096012950400427X","volume":"14","author":"K Aehlig","year":"2004","unstructured":"Aehlig, K., Joachimski, F.: Operational aspects of untyped normalization by evaluation. Math. Struct. Comput. Sci. 14, 587\u2013611 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: From interpreter to compiler and virtual machine: a functional derivation. Technical report BRICS RS-03-14, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark, March 2003","DOI":"10.7146\/brics.v10i14.21784"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Miller, D. (ed.) Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), pp. 8\u201319. ACM Press, Uppsala, August 2003","DOI":"10.1145\/888251.888254"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Balabonski, T., Barenbaum, P., Bonelli, E., Kesner, D.: Foundations of strong call by need. PACMPL 1(ICFP), 20:1\u201320:29 (2017). https:\/\/doi.org\/10.1145\/3110264","DOI":"10.1145\/3110264"},{"key":"8_CR8","unstructured":"Biernacka, M., Biernacki, D., Charatonik, W., Drab, T.: An abstract machine for strong call by value. CoRR abs\/2009.06984 (2020). https:\/\/arxiv.org\/abs\/2009.06984"},{"key":"8_CR9","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, 24\u201330 June 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","DOI":"10.4230\/LIPIcs.FSCD.2019.8"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Biernacka, M., Charatonik, W., Zielinska, K.: Generalized refocusing: from hybrid strategies to abstract machines. In: Miller, D. (ed.) 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, 3\u20139 September 2017, Oxford, UK. LIPIcs, vol. 84, pp. 10:1\u201310:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.10","DOI":"10.4230\/LIPIcs.FSCD.2017.10"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Cr\u00e9gut, P.: Strongly reducing variants of the Krivine abstract machine. High.-Order Symb. Comput. 20(3), 209\u2013230 (2007). A preliminary version was presented at the 1990 ACM Conference on Lisp and Functional Programming","DOI":"10.1007\/s10990-007-9015-z"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11431664_4","volume-title":"Implementation and Application of Functional Languages","author":"O Danvy","year":"2005","unstructured":"Danvy, O.: A rational deconstruction of Landin\u2019s SECD machine. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds.) IFL 2004. LNCS, vol. 3474, pp. 52\u201371. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11431664_4"},{"key":"8_CR13","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, pp. 193\u2013217. Elsevier Science Publishers B.V. (North-Holland), Amsterdam (1986)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1051\/ita:2005026","volume":"39","author":"A Filinski","year":"2005","unstructured":"Filinski, A., Rohde, H.K.: Denotational aspects of untyped normalization by evaluation. Theor. Inform. Appl. 39(3), 423\u2013453 (2005). A preliminary version was presented at FOSSACS 2004","journal-title":"Theor. Inform. Appl."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Ganz, S.E., Friedman, D.P., Wand, M.: Trampolined style. In: Lee, P. (ed.) Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming. SIGPLAN Notices, vol. 34, no. 9, pp. 18\u201327. ACM Press, Paris, September 1999","DOI":"10.1145\/317765.317779"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.scico.2014.05.011","volume":"95","author":"A Garc\u00eda-P\u00e9rez","year":"2014","unstructured":"Garc\u00eda-P\u00e9rez, A., Nogueira, P.: On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines. Sci. Comput. Program. 95, 176\u2013199 (2014)","journal-title":"Sci. Comput. Program."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"e7","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."},{"key":"8_CR18","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 2002), Pittsburgh, Pennsylvania, USA, 4\u20136 October 2002, pp. 235\u2013246. ACM (2002). https:\/\/doi.org\/10.1145\/581478.581501","DOI":"10.1145\/581478.581501"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10990-007-9018-9","volume":"20","author":"JL Krivine","year":"2007","unstructured":"Krivine, J.L.: A call-by-name lambda-calculus machine. High.-Order Symb. Comput. 20(3), 199\u2013207 (2007)","journal-title":"High.-Order Symb. Comput."},{"key":"8_CR20","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml system, release 4.10. INRIA, Rocquencourt, France, February 2020. https:\/\/caml.inria.fr\/pub\/docs\/manual-ocaml\/"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Munk, J.: A study of syntactic and semantic artifacts and its application to lambda definability, strong normalization, and weak normalization in the presence of state. Master\u2019s thesis, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark, May 2007. BRICS research report RS-08-3","DOI":"10.7146\/brics.v15i3.21938"},{"key":"8_CR22","volume-title":"Purely Functional Data Structures","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1999)"},{"key":"8_CR23","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. High.-Order Symb. Comput. 11(4), 363\u2013397 (1998). Reprinted from the Proceedings of the 25th ACM National Conference (1972), with a foreword [24]"},{"key":"8_CR24","unstructured":"Reynolds, J.C.: Definitional interpreters revisited. High.-Order Symb. Comput. 11(4), 355\u2013361 (1998)"},{"key":"8_CR25","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"DA Schmidt","year":"1986","unstructured":"Schmidt, D.A.: Denotational Semantics: A Methodology for Language Development. Allyn and Bacon Inc., Boston (1986)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-36377-7_19","volume-title":"The Essence of Computation","author":"P Sestoft","year":"2002","unstructured":"Sestoft, P.: Demonstrating lambda calculus reduction. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 420\u2013435. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36377-7_19"}],"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-3-030-64437-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:50:30Z","timestamp":1619268630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64437-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030644369","9783030644376"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64437-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 November 2020","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":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2020\/","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.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","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":"17","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":"2","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":"37% - 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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}