{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:15Z","timestamp":1772164095216,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"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":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837651","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"595-607","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Environmental bisimulations for probabilistic higher-order languages"],"prefix":"10.1145","author":[{"given":"Davide","family":"Sangiorgi","sequence":"first","affiliation":[{"name":"University of Bologna, Italy \/ Inria, France"}]},{"given":"Valeria","family":"Vignudelli","sequence":"additional","affiliation":[{"name":"University of Bologna, Italy \/ Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"26","volume-title":"Proc. ESOP\u201998","author":"Abadi M.","unstructured":"M. Abadi and A. D. Gordon . A bisimulation method for cryptographic protocols . In C. Hankin, editor, Proc. ESOP\u201998 , volume 1381 of LNCS , pages 12\u2013 26 . Springer, 1998. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. In C. Hankin, editor, Proc. ESOP\u201998, volume 1381 of LNCS, pages 12\u201326. Springer, 1998."},{"key":"e_1_3_2_1_2_1","first-page":"117","volume-title":"Research Topics in Functional Programming","author":"Abramsky S.","unstructured":"S. Abramsky . The Lazy \u03bb-Calculus . In D. Turner, editor, Research Topics in Functional Programming , pages 65\u2013 117 . Addison Wesley, 1990. S. Abramsky. The Lazy \u03bb-Calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65\u2013117. Addison Wesley, 1990."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03542-0_24"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46678-0_18"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. LICS\u201998","author":"Boreale M.","year":"1998","unstructured":"M. Boreale and D. Sangiorgi . Bisimulation in name-passing calculi without matching . In Proc. LICS\u201998 . IEEE Computer Society Press , 1998 . M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proc. LICS\u201998. IEEE Computer Society Press, 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_12"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"82","volume-title":"Correct System Design","author":"Crubill\u00e9 R.","unstructured":"R. Crubill\u00e9 , U. Dal Lago , D. Sangiorgi , and V. Vignudelli . On applicative similarity, sequentiality, and full abstraction . In R. Meyer, A. Platzer, and H. Wehrheim, editors, Correct System Design , volume 9360 of LNCS , pages 65\u2013 82 . Springer International Publishing, 2015. R. Crubill\u00e9, U. Dal Lago, D. Sangiorgi, and V. Vignudelli. On applicative similarity, sequentiality, and full abstraction. In R. Meyer, A. Platzer, and H. Wehrheim, editors, Correct System Design, volume 9360 of LNCS, pages 65\u201382. Springer International Publishing, 2015."},{"issue":"3","key":"e_1_3_2_1_8_1","first-page":"413","article-title":"Probabilistic operational semantics for the lambda calculus. RAIRO - Theor","volume":"46","author":"Dal Lago U.","year":"2012","unstructured":"U. Dal Lago and M. Zorzi . Probabilistic operational semantics for the lambda calculus. RAIRO - Theor . Inf. and Applic. , 46 ( 3 ): 413 \u2013 450 , 2012 . U. Dal Lago and M. Zorzi. Probabilistic operational semantics for the lambda calculus. RAIRO - Theor. Inf. and Applic., 46(3):413\u2013450, 2012.","journal-title":"Inf. and Applic."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535872"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/507382.507385"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535865"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80013-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.09.003"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103666"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02059-9_3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788979"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111050"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.023"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"297","volume-title":"CSL","author":"Lassen S. B.","year":"2007","unstructured":"S. B. Lassen and P. B. Levy . Typed normal form bisimulation . In CSL 2007 , volume 4646 of LNCS , pages 283\u2013 297 . Springer, 2007. S. B. Lassen and P. B. Levy. Typed normal form bisimulation. In CSL 2007, volume 4646 of LNCS, pages 283\u2013297. Springer, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00358-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.07.003"},{"key":"e_1_3_2_1_25_1","volume-title":"Foundations for Programming Languages","author":"Mitchell J. C.","year":"1996","unstructured":"J. C. Mitchell . Foundations for Programming Languages . MIT Press , 1996 . J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987171.1987183"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.63"},{"key":"e_1_3_2_1_28_1","volume-title":"MIT Press","author":"Pitts A.","year":"2005","unstructured":"A. Pitts . Typed operational reasoning. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 7, pages 245\u2013289 . MIT Press , 2005 . A. Pitts. Typed operational reasoning. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 7, pages 245\u2013289. MIT Press, 2005."},{"key":"e_1_3_2_1_29_1","first-page":"232","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Pitts A. M.","unstructured":"A. M. Pitts . Howe\u2019s method for higher-order languages . In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction , pages 197\u2013 232 . Cambridge University Press, 2011. A. M. Pitts. Howe\u2019s method for higher-order languages. In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction, pages 197\u2013232. Cambridge University Press, 2011."},{"key":"e_1_3_2_1_30_1","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Pous D.","year":"2012","unstructured":"D. Pous and D. Sangiorgi . Enhancements of the bisimulation proof method . In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction . Cambridge University Press , 2012 . D. Pous and D. Sangiorgi. Enhancements of the bisimulation proof method. In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2012."},{"key":"e_1_3_2_1_31_1","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Rutten J.","year":"2012","unstructured":"J. Rutten and B. Jacobs . (co)algebras and (co)induction . In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction . Cambridge University Press , 2012 . J. Rutten and B. Jacobs. (co)algebras and (co)induction. In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263760"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1042"},{"key":"e_1_3_2_1_34_1","series-title":"LNCS","first-page":"379","volume-title":"Proc. FSEN\u201907","author":"Sangiorgi D.","year":"2007","unstructured":"D. Sangiorgi , N. Kobayashi , and E. Sumii . Logical bisimulations and functional languages . In Proc. FSEN\u201907 , volume 4767 of LNCS , pages 364\u2013 379 , 2007 . D. Sangiorgi, N. Kobayashi, and E. Sumii. Logical bisimulations and functional languages. In Proc. FSEN\u201907, volume 4767 of LNCS, pages 364\u2013379, 2007."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890002"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_22"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190244"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.032"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284325"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837651","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:38Z","timestamp":1750211018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":38,"alternative-id":["10.1145\/2837614.2837651","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837651","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837651","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}