{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T09:30:20Z","timestamp":1787563820060,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,4]],"date-time":"2016-09-04T00:00:00Z","timestamp":1472947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005304","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005304","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2013-4853"],"award-info":[{"award-number":["2013-4853"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,9,4]]},"DOI":"10.1145\/2951913.2951942","type":"proceedings-article","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T08:17:16Z","timestamp":1472458636000},"page":"33-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["A lambda-calculus foundation for universal probabilistic programming"],"prefix":"10.1145","author":[{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[{"name":"University of Bologna, Italy \/ Inria, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK \/ University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Szymczak","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_35"},{"key":"e_1_3_2_1_2_1","volume-title":"Probability and Measure","author":"Billingsley P.","year":"1995","unstructured":"P. Billingsley . Probability and Measure . Wiley-Interscience , third edition, 1995 . P. Billingsley. Probability and Measure. Wiley-Interscience, third edition, 1995."},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"294","volume-title":"Proceedings of FoSSaCS","author":"Bizjak A.","year":"2015","unstructured":"A. Bizjak and L. Birkedal . Step-indexed logical relations for probability . In A. M. Pitts, editor, Proceedings of FoSSaCS 2015 , volume 9034 of LNCS , pages 279\u2013 294 . Springer, 2015. A. Bizjak and L. Birkedal. Step-indexed logical relations for probability. In A. M. Pitts, editor, Proceedings of FoSSaCS 2015, volume 9034 of LNCS, pages 279\u2013294. Springer, 2015."},{"key":"e_1_3_2_1_4_1","volume-title":"A lambdacalculus foundation for universal probabilistic programming (long version). CoRR, abs\/1512.08990","author":"Borgstr\u00f6m J.","year":"2015","unstructured":"J. Borgstr\u00f6m , U. Dal Lago , A. D. Gordon , and M. Szymczak . A lambdacalculus foundation for universal probabilistic programming (long version). CoRR, abs\/1512.08990 , 2015 . J. Borgstr\u00f6m, U. Dal Lago, A. D. Gordon, and M. Szymczak. A lambdacalculus foundation for universal probabilistic programming (long version). CoRR, abs\/1512.08990, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.02.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/507382.507385"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535865"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429117"},{"key":"e_1_3_2_1_11_1","unstructured":"N. D. Goodman and A. Stuhlm\u00fcller. The design and implementation of probabilistic programming languages. http:\/\/dippl.org 2014.  N. D. Goodman and A. Stuhlm\u00fcller. The design and implementation of probabilistic programming languages. http:\/\/dippl.org 2014."},{"key":"e_1_3_2_1_12_1","unstructured":"N. D. Goodman and J. B. Tenenbaum. Probabilistic models of cognition. http:\/\/probmods.org 2014.  N. D. Goodman and J. B. Tenenbaum. Probabilistic models of cognition. http:\/\/probmods.org 2014."},{"key":"e_1_3_2_1_13_1","first-page":"229","volume-title":"Proceedings of UAI","author":"Goodman N. D.","year":"2008","unstructured":"N. D. Goodman , V. K. Mansinghka , D. M. Roy , K. Bonawitz , and J. B. Tenenbaum . Church: a language for generative models. In D. A. McAllester and P. Myllym\u00e4ki, editors , Proceedings of UAI 2008 , pages 220\u2013 229 . AUAI Press, 2008. N. D. Goodman, V. K. Mansinghka, D. M. Roy, K. Bonawitz, and J. B. Tenenbaum. Church: a language for generative models. In D. A. McAllester and P. Myllym\u00e4ki, editors, Proceedings of UAI 2008, pages 220\u2013229. AUAI Press, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593882.2593900"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2638586"},{"key":"e_1_3_2_1_17_1","series-title":"LIPIcs","first-page":"488","volume-title":"Proceedings of FSTTCS","author":"Hur C.","year":"2015","unstructured":"C. Hur , A. V. Nori , S. K. Rajamani , and S. Samuel . A provably correct sampler for probabilistic programs . In P. Harsha and G. Ramalingam, editors, Proceedings of FSTTCS 2015 , volume 45 of LIPIcs , pages 475\u2013 488 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2015. C. Hur, A. V. Nori, S. K. Rajamani, and S. Samuel. A provably correct sampler for probabilistic programs. In P. Harsha and G. Ramalingam, editors, Proceedings of FSTTCS 2015, volume 45 of LIPIcs, pages 475\u2013 488. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2015."},{"key":"e_1_3_2_1_18_1","unstructured":"C. Jones. Probabilistic Non-determinism. PhD thesis University of Edinburgh 1990. Available as Technical Report CST-6390.   C. Jones. Probabilistic Non-determinism. PhD thesis University of Edinburgh 1990. Available as Technical Report CST-6390."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77370"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.38"},{"key":"e_1_3_2_1_21_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 . MIT Press , 1999 . C. D. Manning and H. Sch\u00fctze. Foundations of statistical natural language processing. MIT Press, 1999."},{"key":"e_1_3_2_1_22_1","volume-title":"Venture: a higherorder probabilistic programming platform with programmable inference. CoRR, abs\/1404.0099","author":"Mansinghka V. K.","year":"2014","unstructured":"V. K. Mansinghka , D. Selsam , and Y. N. Perov . Venture: a higherorder probabilistic programming platform with programmable inference. CoRR, abs\/1404.0099 , 2014 . V. K. Mansinghka, D. Selsam, and Y. N. Perov. Venture: a higherorder probabilistic programming platform with programmable inference. CoRR, abs\/1404.0099, 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_3_2_1_24_1","first-page":"2482","volume-title":"Proceedings of AAAI","author":"Nori A. V.","year":"2014","unstructured":"A. V. Nori , C. Hur , S. K. Rajamani , and S. Samuel . R2: an efficient MCMC sampler for probabilistic programs. In C. E. Brodley and P. Stone, editors , Proceedings of AAAI 2014 , pages 2476\u2013 2482 . AAAI Press, 2014. A. V. Nori, C. Hur, S. K. Rajamani, and S. Samuel. R2: an efficient MCMC sampler for probabilistic programs. In C. E. Brodley and P. Stone, editors, Proceedings of AAAI 2014, pages 2476\u20132482. AAAI Press, 2014."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80602-4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1717290"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452048"},{"key":"e_1_3_2_1_28_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_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503288"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699411"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804317"},{"key":"e_1_3_2_1_32_1","volume-title":"Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. CoRR, abs\/1601.04943","author":"Staton S.","year":"2016","unstructured":"S. Staton , H. Yang , C. Heunen , O. Kammar , and F. Wood . Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. CoRR, abs\/1601.04943 , 2016 . S. Staton, H. Yang, C. Heunen, O. Kammar, and F. Wood. Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. CoRR, abs\/1601.04943, 2016."},{"key":"e_1_3_2_1_33_1","volume-title":"Morgan Kaufmann","author":"Thrun S.","year":"2002","unstructured":"S. Thrun . Robotic mapping : A survey. In G. Lakemeyer and B. Nebel, editors, Exploring artificial intelligence in the new millennium, pages 1\u201335 . Morgan Kaufmann , 2002 . S. Thrun. Robotic mapping: A survey. In G. Lakemeyer and B. Nebel, editors, Exploring artificial intelligence in the new millennium, pages 1\u201335. Morgan Kaufmann, 2002."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325750"},{"key":"e_1_3_2_1_35_1","series-title":"LNCS","first-page":"311","volume-title":"Proceedings of ECML PKDD","author":"Tolpin D.","year":"2015","unstructured":"D. Tolpin , J. van de Meent , and F. Wood . Probabilistic programming in Anglican . In A. Bifet, M. May, B. Zadrozny, R. Gavald\u00e0, D. Pedreschi, F. Bonchi, J. S. Cardoso, and M. Spiliopoulou, editors, Proceedings of ECML PKDD 2015 , Part III, volume 9286 of LNCS , pages 308\u2013 311 . Springer, 2015. D. Tolpin, J. van de Meent, and F. Wood. Probabilistic programming in Anglican. In A. Bifet, M. May, B. Zadrozny, R. Gavald\u00e0, D. Pedreschi, F. Bonchi, J. S. Cardoso, and M. Spiliopoulou, editors, Proceedings of ECML PKDD 2015, Part III, volume 9286 of LNCS, pages 308\u2013311. Springer, 2015."},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","first-page":"79","volume-title":"Proceedings of ESOP","author":"Toronto N.","year":"2015","unstructured":"N. Toronto , J. McCarthy , and D. V. Horn . Running probabilistic programs backwards . In J. Vitek, editor, Proceedings of ESOP 2015 , volume 9032 of LNCS , pages 53\u2013 79 . Springer, 2015. N. Toronto, J. McCarthy, and D. V. Horn. Running probabilistic programs backwards. In J. Vitek, editor, Proceedings of ESOP 2015, volume 9032 of LNCS, pages 53\u201379. Springer, 2015."},{"key":"e_1_3_2_1_37_1","series-title":"JMLR: Workshop and Conference Proceedings","first-page":"778","volume-title":"Proceedings of AISTATS","author":"Wingate D.","year":"2011","unstructured":"D. Wingate , A. Stuhlm\u00fcller , and N. D. Goodman . Lightweight implementations of probabilistic programming languages via transformational compilation . In G. J. Gordon and D. Dunson, editors, Proceedings of AISTATS 2011 , volume 15 of JMLR: Workshop and Conference Proceedings , pages 770\u2013 778 . JMLR, 2011. D. Wingate, A. Stuhlm\u00fcller, and N. D. Goodman. Lightweight implementations of probabilistic programming languages via transformational compilation. In G. J. Gordon and D. Dunson, editors, Proceedings of AISTATS 2011, volume 15 of JMLR: Workshop and Conference Proceedings, pages 770\u2013778. JMLR, 2011."}],"event":{"name":"ICFP'16: ACM SIGPLAN International Conference on Functional Programming","location":"Nara Japan","acronym":"ICFP'16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2951913.2951942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2951913.2951942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:56:21Z","timestamp":1750208181000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2951913.2951942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,4]]},"references-count":37,"alternative-id":["10.1145\/2951913.2951942","10.1145\/2951913"],"URL":"https:\/\/doi.org\/10.1145\/2951913.2951942","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3022670.2951942","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,9,4]]},"assertion":[{"value":"2016-09-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}