{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T11:40:56Z","timestamp":1761824456206,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031397837"},{"type":"electronic","value":"9783031397844"}],"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-3-031-39784-4_4","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T22:02:07Z","timestamp":1693260127000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantitative Global Memory"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Ramos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.08.006","volume":"606","author":"B Accattoli","year":"2015","unstructured":"Accattoli, B.: Proof nets and the call-by-value $$\\lambda $$-calculus. Theor. Comput. Sci. 606, 2\u201324 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.08.006","journal-title":"Theor. Comput. Sci."},{"issue":"e14","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S095679682000012X","volume":"30","author":"B Accattoli","year":"2020","unstructured":"Accattoli, B., Graham-Lengrand, S., Kesner, D.: Tight typings and split bounds, fully developed. J. Funct. Program. 30(e14), 1\u2013101 (2020). https:\/\/doi.org\/10.1017\/S095679682000012X","journal-title":"J. Funct. Program."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-02768-1_3","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2018","unstructured":"Accattoli, B., Guerrieri, G.: Types of fireballs. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 45\u201366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_3"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Accattoli, B., Guerrieri, G.: The theory of call-by-value solvability. Proc. ACM Program. Lang. 6(ICFP), 855\u2013885 (2022). https:\/\/doi.org\/10.1145\/3547652","DOI":"10.1145\/3547652"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Alves, S., Kesner, D., Ramos, M.: Quantitative global memory (2023). https:\/\/arxiv.org\/abs\/2303.08940","DOI":"10.1007\/978-3-031-39784-4_4"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Atkey, R.: Syntax and semantics of quantitative type theory. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, (LICS), Oxford, UK, pp. 56\u201365. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209189","DOI":"10.1145\/3209108.3209189"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Benton, N., Kennedy, A., Beringer, L., Hofmann, M.: Relational semantics for effect-based program transformations: higher-order store. In: Porto, A., L\u00f3pez-Fraguas, F.J. (eds.) 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, (PPDP), Coimbra, Portugal, pp. 301\u2013312. ACM (2009). https:\/\/doi.org\/10.1145\/1599410.1599447","DOI":"10.1145\/1599410.1599447"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Breuvart, F., Lago, U.D.: On intersection types and probabilistic lambda calculi. In: Sabel, D., Thiemann, P. (eds.) Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, (PPDP), Frankfurt am Main, Germany, pp. 8:1\u20138:13. ACM (2018). https:\/\/doi.org\/10.1145\/3236950.3236968","DOI":"10.1145\/3236950.3236968"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-59025-3_2","volume-title":"Functional and Logic Programming","author":"A Bucciarelli","year":"2020","unstructured":"Bucciarelli, A., Kesner, D., R\u00edos, A., Viso, A.: The bang calculus revisited. In: Nakano, K., Sagonas, K. (eds.) FLOPS 2020. LNCS, vol. 12073, pp. 13\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59025-3_2"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1093\/jigpal\/jzx018","volume":"25","author":"A Bucciarelli","year":"2017","unstructured":"Bucciarelli, A., Kesner, D., Ventura, D.: Non-idempotent intersection types for the lambda-calculus. Log. J. (IGPL) 25(4), 431\u2013464 (2017). https:\/\/doi.org\/10.1093\/jigpal\/jzx018","journal-title":"Log. J. (IGPL)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-54830-7_7","volume-title":"Foundations of Software Science and Computation Structures","author":"A Carraro","year":"2014","unstructured":"Carraro, A., Guerrieri, G.: A semantical and operational account of call-by-value solvability. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 103\u2013118. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_7"},{"key":"4_CR12","unstructured":"de Carvalho, D.: S\u00e9mantiques de la logique lin\u00e9aire et temps de calcul. These de doctorat, Universit\u00e9 Aix-Marseille II (2007)"},{"issue":"7","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1017\/S0960129516000396","volume":"28","author":"D de Carvalho","year":"2018","unstructured":"de Carvalho, D.: Execution time of $$\\lambda $$-terms via denotational semantics and intersection types. Math. Struct. Comput. Sci. 28(7), 1169\u20131203 (2018). https:\/\/doi.org\/10.1017\/S0960129516000396","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type assignment for lambda-terms. Archiv f\u00fcr Math. Logik 19, 139\u2013156 (1978)","journal-title":"Archiv f\u00fcr Math. Logik"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Davies, R., Pfenning, F.: Intersection types and computational effects. In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, (ICFP), Montreal, Canada, pp. 198\u2013208. ACM (2000). https:\/\/doi.org\/10.1145\/351240.351259","DOI":"10.1145\/351240.351259"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"de\u2019Liguoro, U., Treglia, R.: Intersection types for a $$\\lambda $$-calculus with global store. In: Veltri, N., Benton, N., Ghilezan, S. (eds.) 23rd International Symposium on Principles and Practice of Declarative Programming, (PPDP), Tallinn, Estonia, pp. 5:1\u20135:11. ACM (2021). https:\/\/doi.org\/10.1145\/3479394.3479400","DOI":"10.1145\/3479394.3479400"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-04027-6_17","volume-title":"Computer Science Logic","author":"M Dezani-Ciancaglini","year":"2009","unstructured":"Dezani-Ciancaglini, M., Giannini, P., Della Rocca, S.R.: Intersection, universally quantified, and reference types. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 209\u2013224. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04027-6_17"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Ehrhard, T.: Collapsing non-idempotent intersection types. In: 26th International Workshop\/21st Annual Conference of the EACSL on Computer Science Logic, (CSL), Fontainebleau, France. LIPIcs, vol. 16, pp. 259\u2013273. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2012.259","DOI":"10.4230\/LIPIcs.CSL.2012.259"},{"issue":"7","key":"4_CR19","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1017\/S0960129522000433","volume":"32","author":"C Faggian","year":"2022","unstructured":"Faggian, C., Guerrieri, G., de\u2019Liguoro, U., Treglia, R.: On reduction and normalization in the computational core. Math. Struct. Comput. Sci. 32(7), 934\u2013981 (2022). https:\/\/doi.org\/10.1017\/S0960129522000433","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Faggian, C., Rocca, S.R.D.: Lambda calculus and probabilistic computation. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, (LICS), Vancouver, BC, Canada, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785699","DOI":"10.1109\/LICS.2019.8785699"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Gavazzo, F., Vanoni, G., Treglia, R.: On monadic intersection types (2023, draft)","DOI":"10.1007\/978-3-031-57262-3_2"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Guerrieri, G.: Towards a semantic measure of the execution time in call-by-value lambda-calculus. In: 12th Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, (DCM\/ITRS), Oxford, UK. EPTCS, vol. 293, pp. 57\u201372 (2018). https:\/\/doi.org\/10.4204\/EPTCS.293.5","DOI":"10.4204\/EPTCS.293.5"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Jones, S.L.P., Wadler, P.: Imperative functional programming. In: Conference Record of the Twentieth Annual (ACM) (SIGPLAN-SIGACT) Symposium on Principles of Programming Languages (POPL), Charleston, South Carolina, USA, pp. 71\u201384. ACM Press (1993). https:\/\/doi.org\/10.1145\/158511.158524","DOI":"10.1145\/158511.158524"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Kerinec, A., Manzonetto, G., Rocca, S.R.D.: Call-by-value, again! In: 6th International Conference on Formal Structures for Computation and Deduction (FSCD), Buenos Aires, Argentina (Virtual Conference). LIPIcs, vol. 195, pp. 7:1\u20137:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2021.7","DOI":"10.4230\/LIPIcs.FSCD.2021.7"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Kesner, D., Peyrot, L.: Solvability for generalized applications. In: 7th International Conference on Formal Structures for Computation and Deduction (FSCD), Haifa, Israel. LIPIcs, vol. 228, pp. 18:1\u201318:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.18","DOI":"10.4230\/LIPIcs.FSCD.2022.18"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Kesner, D., Viso, A.: Encoding tight typing in a unified framework. In: 30th EACSL Annual Conference on Computer Science Logic, (CSL), G\u00f6ttingen, Germany (Virtual Conference). LIPIcs, vol. 216, pp. 27:1\u201327:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.27","DOI":"10.4230\/LIPIcs.CSL.2022.27"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48959-2_17","volume-title":"Typed Lambda Calculi and Applications","author":"PB Levy","year":"1999","unstructured":"Levy, P.B.: Call-by-push-value: a subsuming paradigm. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 228\u2013243. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48959-2_17"},{"issue":"1\u20133","key":"4_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.3233\/fi-2019-1862","volume":"170","author":"G Manzonetto","year":"2019","unstructured":"Manzonetto, G., Pagani, M., Rocca, S.R.D.: New semantical insights into call-by-value $$\\lambda $$-calculus. Fund. Inform. 170(1\u20133), 241\u2013265 (2019). https:\/\/doi.org\/10.3233\/fi-2019-1862","journal-title":"Fund. Inform."},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: 4th Annual Symposium on Logic in Computer Science, (LICS), Pacific Grove, California, USA, pp. 14\u201323. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/LICS.1989.39155","DOI":"10.1109\/LICS.1989.39155"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"GD Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975). https:\/\/doi.org\/10.1016\/0304-3975(75)90017-1","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"4_CR32","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1145\/267959.269968","volume":"19","author":"A Sabry","year":"1997","unstructured":"Sabry, A., Wadler, P.: A reflection on call-by-value. ACM Trans. Program. Lang. Syst. 19(6), 916\u2013941 (1997). https:\/\/doi.org\/10.1145\/267959.269968","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR33","unstructured":"Treglia, R.: The computational core: reduction theory and intersection type discipline. Ph.D. thesis, Universit\u00e0 di Torino (2022)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24\u201352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59451-5_2"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39784-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T23:59:45Z","timestamp":1729987185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39784-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031397837","9783031397844"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39784-4_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":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"11 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","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":"21","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":"49% - 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.6","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)"}}]}}