{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T21:20:56Z","timestamp":1790198456952,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"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":[[2018,9,3]]},"DOI":"10.1145\/3236950.3236968","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T08:09:54Z","timestamp":1534234194000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On Intersection Types and Probabilistic Lambda Calculi"],"prefix":"10.1145","author":[{"given":"Flavien","family":"Breuvart","sequence":"first","affiliation":[{"name":"LIPN, Universit\u00e9 Paris-Nord"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo Dal","family":"Lago","sequence":"additional","affiliation":[{"name":"University of Bologna & INRIA Sophia Antipolis"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.1.5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"e_1_3_2_1_3_1","unstructured":"Henk P. Barendregt. 1984. The Lambda Calculus Its Syntax and Semantics. North Holland.  Henk P. Barendregt. 1984. The Lambda Calculus Its Syntax and Semantics. North Holland."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009896"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzx018"},{"key":"e_1_3_2_1_6_1","volume-title":"A new type assignment for \u03bb-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 19, 1","author":"Coppo Mario","year":"1978","unstructured":"Mario Coppo and Mariangiola Dezani-Ciancaglini . 1978. A new type assignment for \u03bb-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 19, 1 ( 1978 ), 139--156. Mario Coppo and Mariangiola Dezani-Ciancaglini. 1978. A new type assignment for \u03bb-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 19, 1 (1978), 139--156."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883253"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2012012"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.02.001"},{"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","volume-title":"Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251","author":"de Carvalho Daniel","year":"2009","unstructured":"Daniel de Carvalho . 2009. Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251 ( 2009 ). Daniel de Carvalho. 2009. Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs\/0905.4251 (2009)."},{"key":"e_1_3_2_1_12_1","volume-title":"Computability by probabilistic machines. Automata studies 34","author":"Leeuw Karel De","year":"1956","unstructured":"Karel De Leeuw , Edward F Moore , Claude E Shannon , and Norman Shapiro . 1956. Computability by probabilistic machines. Automata studies 34 ( 1956 ), 183--198. Karel De Leeuw, Edward F Moore, Claude E Shannon, and Norman Shapiro. 1956. Computability by probabilistic machines. Automata studies 34 (1956), 183--198."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009862"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535865"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206049"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_18_1","volume-title":"Tenenbaum","author":"Goodman Noah D.","year":"2008","unstructured":"Noah D. Goodman , Vikash K. Mansinghka , Daniel M. Roy , Keith Bonawitz , and Joshua B . Tenenbaum . 2008 . Church: a language for generative models. In UAI. 220--229. Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: a language for generative models. In UAI. 220--229."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.09.003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005137"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of LICS","author":"Jones C.","year":"1989","unstructured":"C. Jones and Gordon D. Plotkin . 1989. A Probabilistic Powerdomain of Evaluations . In Proc. of LICS 1989 . 186--195. C. Jones and Gordon D. Plotkin. 1989. A Probabilistic Powerdomain of Evaluations. In Proc. of LICS 1989. 186--195."},{"key":"e_1_3_2_1_24_1","volume-title":"Jones and Nina Bohr","author":"Neil","year":"2008","unstructured":"Neil D. Jones and Nina Bohr . 2008 . Call-by-Value Termination in the Untyped lambda-Calculus. Logical Methods in Computer Science 4, 1 (2008). Neil D. Jones and Nina Bohr. 2008. Call-by-Value Termination in the Untyped lambda-Calculus. Logical Methods in Computer Science 4, 1 (2008)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48057-1_24"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_27_1","unstructured":"Jean-Louis Krivine. 1993. Lambda-calculus types and models. Masson.   Jean-Louis Krivine. 1993. Lambda-calculus types and models. Masson."},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of ESOP 2017 (LNCS)","volume":"10201","author":"Lago Ugo Dal","year":"2017","unstructured":"Ugo Dal Lago and Charles Grellois . 2017 . Probabilistic Termination by Monadic Affine Sized Typing . In Proc. of ESOP 2017 (LNCS) , Vol. 10201 . 393--419. Ugo Dal Lago and Charles Grellois. 2017. Probabilistic Termination by Monadic Affine Sized Typing. In Proc. of ESOP 2017 (LNCS), Vol. 10201. 393--419."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535872"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00358-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_32_1","volume-title":"Randomized Algorithms","author":"Motwani Rajeev","unstructured":"Rajeev Motwani and Prabhakar Raghavan . 1995. Randomized Algorithms . Cambridge University Press . Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_33_1","volume-title":"Probabilistic automata. Information and control 6, 3","author":"Rabin Michael O","year":"1963","unstructured":"Michael O Rabin . 1963. Probabilistic automata. Information and control 6, 3 ( 1963 ), 230--245. Michael O Rabin. 1963. Probabilistic automata. Information and control 6, 3 (1963), 230--245."},{"key":"e_1_3_2_1_34_1","volume-title":"Probabilistic LCF. In Proc. of MFCS 1978 (LNCS)","volume":"64","author":"Saheb-Djahromi N.","year":"1978","unstructured":"N. Saheb-Djahromi . 1978 . Probabilistic LCF. In Proc. of MFCS 1978 (LNCS) , Vol. 64 . 442--451. N. Saheb-Djahromi. 1978. Probabilistic LCF. In Proc. of MFCS 1978 (LNCS), Vol. 64. 442--451."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1969-0249221-4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33475-7_25"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129505005074"}],"event":{"name":"PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming","location":"Frankfurt am Main Germany","acronym":"PPDP '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Goethe University Goethe University Frankfurt"]},"container-title":["Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236968","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236950.3236968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:34Z","timestamp":1750196374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":37,"alternative-id":["10.1145\/3236950.3236968","10.1145\/3236950"],"URL":"https:\/\/doi.org\/10.1145\/3236950.3236968","relation":{},"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"2018-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}