{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T04:10:45Z","timestamp":1791087045209,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"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":[[2014,1,8]]},"DOI":"10.1145\/2535838.2535872","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"297-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["On coinductive equivalences for higher-order probabilistic functional programs"],"prefix":"10.1145","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Alberti","sequence":"additional","affiliation":[{"name":"CNRS & Universit\u00e9 d'Aix-Marseille, Marseille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"Abramsky S.","year":"1990","unstructured":"S. Abramsky . The Lazy \u03bb-Calculus . In D. Turner, editor, Research Topics in Functional Programming , pages 65 -- 117 . Addison Wesley , 1990 . S. Abramsky. The Lazy \u03bb-Calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65--117. Addison Wesley, 1990."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1044"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90027-6"},{"key":"e_1_3_2_2_4_1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus -- Its Syntax and Semantics","author":"Barendregt H. P.","year":"1984","unstructured":"H. P. Barendregt . The Lambda Calculus -- Its Syntax and Semantics , volume 103 of Studies in Logic and the Foundations of Mathematics . North-Holland , 1984 . H. P. Barendregt. The Lambda Calculus -- Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.02.004"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1003"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0037"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1195991"},{"issue":"3","key":"e_1_3_2_2_9_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 -- 450 , 2012 . U. Dal Lago and M. Zorzi. Probabilistic operational semantics for the lambda calculus. RAIRO - Theor. Inf. and Applic., 46(3):413--450, 2012.","journal-title":"Inf. and Applic."},{"key":"e_1_3_2_2_10_1","volume-title":"On coinductive equivalences for probabilistic higher-order functional programs (long version).","author":"Dal Lago U.","year":"2013","unstructured":"U. Dal Lago , D. Sangiorgi , and M. Alberti . On coinductive equivalences for probabilistic higher-order functional programs (long version). Available at http:\/\/arxiv.org\/abs\/1311.1722, 2013 . U. Dal Lago, D. Sangiorgi, and M. Alberti. On coinductive equivalences for probabilistic higher-order functional programs (long version). Available at http:\/\/arxiv.org\/abs\/1311.1722, 2013."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/507382.507385"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1145"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)00167-7"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2773"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.29"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429117"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80013-6"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429119"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0242-7"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646244.684361"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77370"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.023"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis University of Aarhus 1998.  S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis University of Aarhus 1998.","DOI":"10.7146\/brics.v4i24.18950"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_30"},{"key":"e_1_3_2_2_29_1","volume-title":"Foundations of statistical natural language processing","author":"Manning C. D.","year":"1999","unstructured":"C. D. Manning and H. Sch\u00fctze . Foundations of statistical natural language processing , volume 999 . MIT Press , 1999 . C. D. Manning and H. Sch\u00fctze. Foundations of statistical natural language processing, volume 999. MIT Press, 1999."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287580"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1717290"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452048"},{"key":"e_1_3_2_2_33_1","volume-title":"Morgan Kaufmann","author":"Pearl J.","year":"1988","unstructured":"J. Pearl . Probabilistic reasoning in intelligent systems: networks of plausible inference . Morgan Kaufmann , 1988 . J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, 1988."},{"key":"e_1_3_2_2_34_1","first-page":"733","volume-title":"IJCAI","author":"Pfeffer A.","year":"2001","unstructured":"A. Pfeffer . IBAL : A probabilistic rational programming language . In IJCAI , pages 733 -- 740 . Morgan Kaufmann , 2001 . A. Pfeffer. IBAL: A probabilistic rational programming language. In IJCAI, pages 733--740. Morgan Kaufmann, 2001."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619.007"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511792588.006"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503288"},{"key":"e_1_3_2_2_38_1","first-page":"442","volume":"64","author":"N","year":"1978","unstructured":"N . Saheb-Djahromi. Probabilistic LCF. In MFCS , volume 64 of LNCS, pages 442 -- 451 , 1978 . N. Saheb-Djahromi. Probabilistic LCF. In MFCS, volume 64 of LNCS, pages 442--451, 1978.","journal-title":"Saheb-Djahromi. Probabilistic LCF. In MFCS"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263760"},{"key":"e_1_3_2_2_40_1","volume-title":"The pi-Calculus -- a theory of mobile processes","author":"Sangiorgi D.","year":"2001","unstructured":"D. Sangiorgi and D. Walker . The pi-Calculus -- a theory of mobile processes . Cambridge University Press , 2001 . D. Sangiorgi and D. Walker. The pi-Calculus -- a theory of mobile processes. Cambridge University Press, 2001."},{"key":"e_1_3_2_2_41_1","series-title":"LNCS","first-page":"364","volume-title":"FSEN","author":"Sangiorgi D.","year":"2007","unstructured":"D. Sangiorgi , N. Kobayashi , and E. Sumii . Logical bisimulations and functional languages . In FSEN , volume 4767 of LNCS , pages 364 -- 379 , 2007 . D. Sangiorgi, N. Kobayashi, and E. Sumii. Logical bisimulations and functional languages. In FSEN, volume 4767 of LNCS, pages 364--379, 2007."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890002"},{"key":"e_1_3_2_2_43_1","series-title":"LNCS","first-page":"376","volume-title":"TLCA","author":"Sieber K.","year":"1993","unstructured":"K. Sieber . Call-by-value and nondeterminism. In TLCA , volume 664 of LNCS , pages 376 -- 390 , 1993 . K. Sieber. Call-by-value and nondeterminism. In TLCA, volume 664 of LNCS, pages 376--390, 1993."},{"key":"e_1_3_2_2_44_1","first-page":"1","volume-title":"Robotic mapping: A survey. Exploring artificial intelligence in the new millennium","author":"Thrun S.","year":"2002","unstructured":"S. Thrun . Robotic mapping: A survey. Exploring artificial intelligence in the new millennium , pages 1 -- 35 , 2002 . S. Thrun. Robotic mapping: A survey. Exploring artificial intelligence in the new millennium, pages 1--35, 2002."}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":44,"alternative-id":["10.1145\/2535838.2535872","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535872","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535872","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}