{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T17:05:38Z","timestamp":1785431138039,"version":"3.56.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227195","type":"print"},{"value":"9783032227201","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"vor","delay-in-days":99,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Lazy evaluation offers great flexibility by computing only what is necessary. However, analysing the cost of lazy programs is notoriously challenging, as computation occurs out of order and depends on future demands. Recent work has proposed alternative semantics for modelling\u00a0lazy evaluation cost that avoid reasoning about program states. However, existing approaches either rely on nondeterminism or require complex bidirectional semantics. We present the\n                    <jats:italic>Memorist Semantics<\/jats:italic>\n                    , a novel semantics for analysing the\u00a0cost of lazy programs by explicitly tracking the cost and dependencies of every subterm. Our semantics annotates components of a term with fine-grained cost and usage information, yielding a deterministic semantics that can be expressed through a simple monadic interface. We formalize the semantics in Rocq and verify its soundness with respect to the existing Clairvoyance Semantics. Similar to prior formalized semantics, our semantics\u00a0is defined for a total, typed language with built-in structural recursion and without support\u00a0for first-class functions. We outline ideas for possible extensions.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-22720-1_17","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T15:29:20Z","timestamp":1775748560000},"page":"463-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Memorist Tale: Every Thunk Every Cost All At Once"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8930-6159","authenticated-orcid":false,"given":"Xing","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8720-883X","authenticated-orcid":false,"given":"Yao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5959-3769","authenticated-orcid":false,"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4785-2836","authenticated-orcid":false,"given":"Christine","family":"Rizkallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Ahman, D., Uustalu, T.: Update monads: Cointerpreting directed containers. In: Matthes, R., Schubert, A. (eds.) 19th International Conference on Types for Proofs and Programs, TYPES 2013, April 22-26, 2013, Toulouse, France. LIPIcs, vol.\u00a026, pp. 1\u201323. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013). https:\/\/doi.org\/10.4230\/LIPICS.TYPES.2013.1, https:\/\/doi.org\/10.4230\/LIPIcs.TYPES.2013.1","DOI":"10.4230\/LIPICS.TYPES.2013.1"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bjerner, B., Holmstr\u00f6m, S.: A composition approach to time analysis of first order lazy functional programs. In: Proceedings of the fourth international conference on Functional programming languages and computer architecture - FPCA \u201989. pp. 157\u2013165. FPCA \u201989, ACM Press (1989). https:\/\/doi.org\/10.1145\/99370.99382","DOI":"10.1145\/99370.99382"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Breitner, J., Spector-Zabusky, A., Li, Y., Rizkallah, C., Wiegley, J., Cohen, J.M., Weirich, S.: Ready, set, verify! applying hs-to-coq to real-world haskell code. J. Funct. Program. 31, e5 (2021). https:\/\/doi.org\/10.1017\/S0956796820000283, https:\/\/doi.org\/10.1017\/S0956796820000283","DOI":"10.1017\/S0956796820000283"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"van Br\u00fcgge, J.: Liquid amortization: Proving amortized complexity with liquidhaskell (functional pearl). In: Vazou, N., Morris, J.G. (eds.) Proceedings of the 17th ACM SIGPLAN International Haskell Symposium, Haskell 2024, Milan, Italy, September 6-7, 2024. pp. 97\u2013108. ACM (2024). https:\/\/doi.org\/10.1145\/3677999.3678282, https:\/\/doi.org\/10.1145\/3677999.3678282","DOI":"10.1145\/3677999.3678282"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Carbonneaux, Q., Hoffmann, J., Reps, T.W., Shao, Z.: Automated resource analysis with coq proof objects. In: Majumdar, R., Kuncak, V. (eds.) Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10427, pp. 64\u201385. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_4, https:\/\/doi.org\/10.1007\/978-3-319-63390-9_4","DOI":"10.1007\/978-3-319-63390-9_4"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Claessen, K.: Finger trees explained anew, and slightly simplified (functional pearl). In: Schrijvers, T. (ed.) Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell, Haskell@ICFP 2020, Virtual Event, USA, August 7, 2020. pp. 31\u201338. ACM (2020). https:\/\/doi.org\/10.1145\/3406088.3409026, https:\/\/doi.org\/10.1145\/3406088.3409026","DOI":"10.1145\/3406088.3409026"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Cutler, J.W., Licata, D.R., Danner, N.: Denotational recurrence extraction for amortized analysis. Proc. ACM Program. Lang. 4(ICFP), 97:1\u201397:29 (2020). https:\/\/doi.org\/10.1145\/3408979, https:\/\/doi.org\/10.1145\/3408979","DOI":"10.1145\/3408979"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Danielsson, N.A.: Lightweight semiformal time complexity analysis for purely functional data structures. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008. pp. 133\u2013144. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328457, https:\/\/doi.org\/10.1145\/1328438.1328457","DOI":"10.1145\/1328438.1328457"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Danner, N., Licata, D.R.: Denotational semantics as a foundation for cost recurrence extraction for functional languages. J. Funct. Program. 32, \u00a0e8 (2022). https:\/\/doi.org\/10.1017\/S095679682200003X, https:\/\/doi.org\/10.1017\/S095679682200003X","DOI":"10.1017\/S095679682200003X"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Danner, N., Licata, D.R., Ramyaa: Denotational cost semantics for functional languages with inductive types. In: Fisher, K., Reppy, J.H. (eds.) Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015. pp. 140\u2013151. ACM (2015). https:\/\/doi.org\/10.1145\/2784731.2784749, https:\/\/doi.org\/10.1145\/2784731.2784749","DOI":"10.1145\/2784731.2784749"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Danner, N., Paykin, J., Royer, J.S.: A static cost analysis for a higher-order language. In: Might, M., Horn, D.V., Abel, A., Sheard, T. (eds.) Proceedings of the 7th Workshop on Programming languages meets program verification, PLPV 2013, Rome, Italy, January 22, 2013. pp. 25\u201334. ACM (2013). https:\/\/doi.org\/10.1145\/2428116.2428123, https:\/\/doi.org\/10.1145\/2428116.2428123","DOI":"10.1145\/2428116.2428123"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Grodin, H., Niu, Y., Sterling, J., Harper, R.: Decalf: A directed, effectful cost-aware logical framework. Proc. ACM Program. Lang. 8(POPL), 273\u2013301 (2024). https:\/\/doi.org\/10.1145\/3632852, https:\/\/doi.org\/10.1145\/3632852","DOI":"10.1145\/3632852"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Gu\u00e9neau, A., Chargu\u00e9raud, A., Pottier, F.: A fistful of dollars: Formalizing asymptotic complexity claims via deductive program verification. In: Ahmed, A. (ed.) Programming Languages and Systems - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Lecture Notes in Computer Science, vol. 10801, pp. 533\u2013560. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_19, https:\/\/doi.org\/10.1007\/978-3-319-89884-1_19","DOI":"10.1007\/978-3-319-89884-1_19"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Hackett, J., Hutton, G.: Call-by-need is clairvoyant call-by-value. Proc. ACM Program. Lang. 3(ICFP), 114:1\u2013114:23 (2019) https:\/\/doi.org\/10.1145\/3341718, https:\/\/doi.org\/10.1145\/3341718","DOI":"10.1145\/3341718"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Handley, M.A.T., Vazou, N., Hutton, G.: Liquidate your assets: reasoning about resource usage in liquid haskell. Proc. ACM Program. Lang. 4(POPL), 24:1\u201324:27 (2020) https:\/\/doi.org\/10.1145\/3371092, https:\/\/doi.org\/10.1145\/3371092","DOI":"10.1145\/3371092"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Resource aware ML. In: Madhusudan, P., Seshia, S.A. (eds.) Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Lecture Notes in Computer Science, vol.\u00a07358, pp. 781\u2013786. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_64, https:\/\/doi.org\/10.1007\/978-3-642-31424-7_64","DOI":"10.1007\/978-3-642-31424-7_64"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Hoffmann, J., Das, A., Weng, S.: Towards automatic resource bound analysis for ocaml. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. pp. 359\u2013373. ACM (2017) https:\/\/doi.org\/10.1145\/3009837.3009842, https:\/\/doi.org\/10.1145\/3009837.3009842","DOI":"10.1145\/3009837.3009842"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Hoffmann, J., Hofmann, M.: Amortized resource analysis with polynomial potential. In: Gordon, A.D. (ed.) Programming Languages and Systems, 19th European Symposium on Programming, ESOP 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06012, pp. 287\u2013306. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-11957-6_16, https:\/\/doi.org\/10.1007\/978-3-642-11957-6_16","DOI":"10.1007\/978-3-642-11957-6_16"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Aiken, A., Morrisett, G. (eds.) Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisisana, USA, January 15-17, 2003. pp. 185\u2013197. ACM (2003).https:\/\/doi.org\/10.1145\/604131.604148, https:\/\/doi.org\/10.1145\/604131.604148","DOI":"10.1145\/604131.604148"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Hughes, J.: Why functional programming matters. Comput. J. 32(2), 98\u2013107 (1989)","DOI":"10.1093\/comjnl\/32.2.98"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Jost, S., Hammond, K., Loidl, H., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010. pp. 223\u2013236. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706327, https:\/\/doi.org\/10.1145\/1706299.1706327","DOI":"10.1145\/1706299.1706327"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Jost, S., Vasconcelos, P.B., Florido, M., Hammond, K.: Type-based cost analysis for lazy functional languages. J. Autom. Reason. 59(1), 87\u2013120 (2017)","DOI":"10.1007\/s10817-016-9398-9"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Kavvos, G.A., Morehouse, E., Licata, D.R., Danner, N.: Recurrence extraction for functional programs through call-by-push-value. Proc. ACM Program. Lang. 4(POPL), 15:1\u201315:31 (2020). https:\/\/doi.org\/10.1145\/3371083, https:\/\/doi.org\/10.1145\/3371083","DOI":"10.1145\/3371083"},{"key":"17_CR24","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, https:\/\/doi.org\/10.1145\/158511.158618","DOI":"10.1145\/158511.158618"},{"key":"17_CR25","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation, vol.\u00a02. Springer (2004)"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Li, Y., Xia, L., Weirich, S.: Reasoning about the garden of forking paths. Proc. ACM Program. Lang. 5(ICFP), 1\u201328 (2021). https:\/\/doi.org\/10.1145\/3473585, https:\/\/doi.org\/10.1145\/3473585","DOI":"10.1145\/3473585"},{"key":"17_CR27","unstructured":"Coq development team: The Coq proof assistant (Sep 2024)"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"McCarthy, J.A., Fetscher, B., New, M.S., Feltey, D., Findler, R.B.: A coq library for internal verification of running-times. Sci. Comput. Program. 164, 49\u201365 (2018). https:\/\/doi.org\/10.1016\/J.SCICO.2017.05.001, https:\/\/doi.org\/10.1016\/j.scico.2017.05.001","DOI":"10.1016\/J.SCICO.2017.05.001"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"M\u00e9vel, G., Jourdan, J., Pottier, F.: Time credits and time receipts in Iris. In: Caires, L. (ed.) Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11423, pp. 3\u201329. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_1, https:\/\/doi.org\/10.1007\/978-3-030-17184-1_1","DOI":"10.1007\/978-3-030-17184-1_1"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Moreira, S., Vasconcelos, P.B., Florido, M.: Resource analysis for lazy evaluation with polynomial potential. In: Chitil, O. (ed.) IFL 2020: 32nd Symposium on Implementation and Application of Functional Languages, Virtual Event\/Canterbury, UK, September 2-4, 2020. pp. 104\u2013114. ACM (2020). https:\/\/doi.org\/10.1145\/3462172.3462196, https:\/\/doi.org\/10.1145\/3462172.3462196","DOI":"10.1145\/3462172.3462196"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Niu, Y., Harper, R.: A metalanguage for cost-aware denotational semantics. In: 38th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2023, Boston, MA, USA, June 26-29, 2023. pp. 1\u201314. IEEE (2023). https:\/\/doi.org\/10.1109\/LICS56636.2023.10175777, https:\/\/doi.org\/10.1109\/LICS56636.2023.10175777","DOI":"10.1109\/LICS56636.2023.10175777"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Niu, Y., Sterling, J., Grodin, H., Harper, R.: A cost-aware logical framework. Proc. ACM Program. Lang. 6(POPL), 1\u201331 (2022). https:\/\/doi.org\/10.1145\/3498670, https:\/\/doi.org\/10.1145\/3498670","DOI":"10.1145\/3498670"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL), 10:1\u201310:32 (2020). https:\/\/doi.org\/10.1145\/3371078, https:\/\/doi.org\/10.1145\/3371078","DOI":"10.1145\/3371078"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely functional data structures. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511530104"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Pottier, F., Gu\u00e9neau, A., Jourdan, J.H., M\u00e9vel, G.: Thunks and debits in separation logic with time credits. Proc. ACM Program. Lang. 8(POPL) (2024), https:\/\/hal.science\/hal-04238691\/file\/main.pdf","DOI":"10.1145\/3632892"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Rajani, V., Gaboardi, M., Garg, D., Hoffmann, J.: A unifying type-theory for higher-order (amortized) cost analysis. Proc. ACM Program. Lang. 5(POPL), 1\u201328 (2021). https:\/\/doi.org\/10.1145\/3434308, https:\/\/doi.org\/10.1145\/3434308","DOI":"10.1145\/3434308"},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Sands, D.: Complexity analysis for a lazy higher-order language. In: Jones, N.D. (ed.) ESOP\u201990, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science, vol.\u00a0432, pp. 361\u2013376. Springer (1990). https:\/\/doi.org\/10.1007\/3-540-52592-0_74, https:\/\/doi.org\/10.1007\/3-540-52592-0_74","DOI":"10.1007\/3-540-52592-0_74"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Spector-Zabusky, A., Breitner, J., Rizkallah, C., Weirich, S.: Total Haskell is reasonable Coq. In: Andronick, J., Felty, A.P. (eds.) Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018. pp. 14\u201327. ACM (2018). https:\/\/doi.org\/10.1145\/3167092, https:\/\/doi.org\/10.1145\/3167092","DOI":"10.1145\/3167092"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Spies, S., G\u00e4her, L., Tassarotti, J., Jung, R., Krebbers, R., Birkedal, L., Dreyer, D.: Later credits: resourceful reasoning for the later modality. Proc. ACM Program. Lang. 6(ICFP), 283\u2013311 (2022). https:\/\/doi.org\/10.1145\/3547631, https:\/\/doi.org\/10.1145\/3547631","DOI":"10.1145\/3547631"},{"key":"17_CR40","unstructured":"Vazou, N.: Liquid Haskell: Haskell as a Theorem Prover. Ph.D. thesis, University of California, San Diego, USA (2016), http:\/\/www.escholarship.org\/uc\/item\/8dm057ws"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Wang, P., Wang, D., Chlipala, A.: Timl: a functional language for practical complexity analysis with invariants. Proc. ACM Program. Lang. 1(OOPSLA), 79:1\u201379:26 (2017). https:\/\/doi.org\/10.1145\/3133903, https:\/\/doi.org\/10.1145\/3133903","DOI":"10.1145\/3133903"},{"key":"17_CR42","doi-asserted-by":"publisher","unstructured":"Xia, L., Israel, L., Kramarz, M., Coltharp, N., Claessen, K., Weirich, S., Li, Y.: Story of your lazy function\u2019s life: A bidirectional demand semantics for mechanized cost analysis of lazy programs. Proc. ACM Program. Lang. 8(ICFP), 30\u201363 (2024). https:\/\/doi.org\/10.1145\/3674626, https:\/\/doi.org\/10.1145\/3674626","DOI":"10.1145\/3674626"}],"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-032-22720-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T16:43:13Z","timestamp":1785429793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22720-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227195","9783032227201"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22720-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare\u00a0that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"The Rocq code accompanying this paper is openly available at\n                      \n                      .","order":2,"name":"Ethics","label":"Data Availability Statement","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/esop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}