{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:31Z","timestamp":1750220791878,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394806","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"327-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The Benefit of Being Non-Lazy in Probabilistic \u03bb-calculus"],"prefix":"10.1145","author":[{"given":"Gianluca","family":"Curzi","sequence":"first","affiliation":[{"name":"University of Turin, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Pagani","sequence":"additional","affiliation":[{"name":"IRIF UMR, Universit\u00e9 de Paris, CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"volume-title":"The Lazy Lambda Calculus","author":"Abramsky Samson","key":"e_1_3_2_1_1_1","unstructured":"Samson Abramsky . 1990. The Lazy Lambda Calculus . Addison-Wesley Longman Publishing Co., Inc. , USA , 65--116. Samson Abramsky. 1990. The Lazy Lambda Calculus. Addison-Wesley Longman Publishing Co., Inc., USA, 65--116."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1044"},{"key":"e_1_3_2_1_3_1","unstructured":"Hendrik P Barendregt etal 1984. The lambda calculus. Vol. 3. North-Holland Amsterdam.  Hendrik P Barendregt et al. 1984. The lambda calculus. Vol. 3. North-Holland Amsterdam."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90064-O"},{"key":"e_1_3_2_1_5_1","volume-title":"27th EACSL Annual Conference on Computer Science Logic, CSL 2018","volume":"119","author":"Clairambault Pierre","year":"2018","unstructured":"Pierre Clairambault and Hugo Paquet . 2018 . Fully Abstract Models of the Probabilistic lambda-calculus . In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018 , September 4-7, 2018, Birmingham, UK (LIPIcs), Dan R. Ghica and Achim Jung (Eds.) , Vol. 119 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 16:1--16:17. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2018.16 10.4230\/LIPIcs.CSL.2018.16 Pierre Clairambault and Hugo Paquet. 2018. Fully Abstract Models of the Probabilistic lambda-calculus. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK (LIPIcs), Dan R. Ghica and Achim Jung (Eds.), Vol. 119. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 16:1--16:17. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2018.16"},{"volume-title":"On Probabilistic Applicative Bisimulation and Call-by-Value \u03bb-Calculi","author":"Crubill\u00e9 Rapha\u00eblle","key":"e_1_3_2_1_6_1","unstructured":"Rapha\u00eblle Crubill\u00e9 and Ugo Dal Lago . 2014. On Probabilistic Applicative Bisimulation and Call-by-Value \u03bb-Calculi . In Programming Languages and Systems, Zhong Shao (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 209--228. Rapha\u00eblle Crubill\u00e9 and Ugo Dal Lago. 2014. On Probabilistic Applicative Bisimulation and Call-by-Value \u03bb-Calculi. In Programming Languages and Systems, Zhong Shao (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 209--228."},{"key":"e_1_3_2_1_7_1","volume-title":"Davide Sangiorgi, and Valeria Vignudelli.","author":"Crubill\u00e9 Rapha\u00eblle","year":"2015","unstructured":"Rapha\u00eblle Crubill\u00e9 , Ugo Dal Lago , Davide Sangiorgi, and Valeria Vignudelli. 2015 . On applicative similarity, sequentiality, and full abstraction. In Correct System Design. Springer , 65--82. Rapha\u00eblle Crubill\u00e9, Ugo Dal Lago, Davide Sangiorgi, and Valeria Vignudelli. 2015. On applicative similarity, sequentiality, and full abstraction. In Correct System Design. Springer, 65--82."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gianluca Curzi and Michele Pagani. 2020. The Benefit of Being Non-Lazy in ProbabilisticLambda-calculus. arXiv:cs.LO\/2004.12891  Gianluca Curzi and Michele Pagani. 2020. The Benefit of Being Non-Lazy in ProbabilisticLambda-calculus. arXiv:cs.LO\/2004.12891","DOI":"10.1145\/3373718.3394806"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2012012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.02.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.29"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164540"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535865"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"e_1_3_2_1_15_1","volume-title":"4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019","volume":"131","author":"Kasterovic Simona","year":"2019","unstructured":"Simona Kasterovic and Michele Pagani . 2019 . The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus . In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 , June 24-30, 2019, Dortmund, Germany (LIPIcs), Herman Geuvers (Ed.) , Vol. 131 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 26:1--26:20. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.26 10.4230\/LIPIcs.FSCD.2019.26 Simona Kasterovic and Michele Pagani. 2019. The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany (LIPIcs), Herman Geuvers (Ed.), Vol. 131. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 26:1--26:20. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.26"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535872"},{"key":"e_1_3_2_1_17_1","volume-title":"Weighted Relational Models of Typed Lambda-Calculi. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013","author":"Laird Jim","year":"2013","unstructured":"Jim Laird , Giulio Manzonetto , Guy McCusker , and Michele Pagani . 2013 . Weighted Relational Models of Typed Lambda-Calculi. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013 , New Orleans, LA, USA , June 25-28, 2013. IEEE Computer Society, 301--310. https:\/\/doi.org\/10.1109\/LICS.2013.36 10.1109\/LICS.2013.36 Jim Laird, Giulio Manzonetto, Guy McCusker, and Michele Pagani. 2013. Weighted Relational Models of Typed Lambda-Calculi. In 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. IEEE Computer Society, 301--310. https:\/\/doi.org\/10.1109\/LICS.2013.36"},{"key":"e_1_3_2_1_18_1","volume-title":"Bisimulation through probabilistic testing. Information and computation 94, 1","author":"Larsen Kim G","year":"1991","unstructured":"Kim G Larsen and Arne Skou . 1991. Bisimulation through probabilistic testing. Information and computation 94, 1 ( 1991 ), 1--28. Kim G Larsen and Arne Skou. 1991. Bisimulation through probabilistic testing. Information and computation 94, 1 (1991), 1--28."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209126"},{"key":"e_1_3_2_1_20_1","volume-title":"Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS","author":"Leventis Thomas","year":"2019","unstructured":"Thomas Leventis and Michele Pagani . 2019. Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces . In Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 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), Mikolaj Bojanczyk and Alex Simpson (Eds.), Vol. 11425 . Springer , 365--381. https:\/\/doi.org\/10.1007\/978-3-030-17127-8_21 10.1007\/978-3-030-17127-8_21 Thomas Leventis and Michele Pagani. 2019. Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. In Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 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), Mikolaj Bojanczyk and Alex Simpson (Eds.), Vol. 11425. Springer, 365--381. https:\/\/doi.org\/10.1007\/978-3-030-17127-8_21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90053-6"},{"volume-title":"Infinite normal forms for the \u03bb-calculus. In \u03bb-Calculus and Computer Science Theory","author":"Nakajima Reiji","key":"e_1_3_2_1_22_1","unstructured":"Reiji Nakajima . 1975. Infinite normal forms for the \u03bb-calculus. In \u03bb-Calculus and Computer Science Theory , C. B\u00f6hm (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 62--82. Reiji Nakajima. 1975. Infinite normal forms for the \u03bb-calculus. In \u03bb-Calculus and Computer Science Theory, C. B\u00f6hm (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 62--82."},{"key":"e_1_3_2_1_23_1","volume-title":"LCF considered as a programming language. Theoretical computer science 5, 3","author":"Plotkin Gordon D.","year":"1977","unstructured":"Gordon D. Plotkin . 1977. LCF considered as a programming language. Theoretical computer science 5, 3 ( 1977 ), 223--255. Gordon D. Plotkin. 1977. LCF considered as a programming language. Theoretical computer science 5, 3 (1977), 223--255."},{"volume-title":"The essence of computation","author":"Sestoft Peter","key":"e_1_3_2_1_24_1","unstructured":"Peter Sestoft . 2002. Demonstrating lambda calculus reduction . In The essence of computation . Springer , 420--435. Peter Sestoft. 2002. Demonstrating lambda calculus reduction. In The essence of computation. Springer, 420--435."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.021"}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:46Z","timestamp":1750200106000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394806"}},"subtitle":["Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name"],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":25,"alternative-id":["10.1145\/3373718.3394806","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394806","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}