{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:15:18Z","timestamp":1729638918983,"version":"3.28.0"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785663","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":5,"title":["The Geometry of Bayesian Programming"],"prefix":"10.1109","author":[{"given":"Ugo Dal","family":"Lago","sequence":"first","affiliation":[]},{"given":"Naohiko","family":"Hoshino","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"289","author":"selinger","year":"2011","journal-title":"A Survey of Graphical Languages for Monoidal Categories"},{"key":"ref38","first-page":"225","author":"lafont","year":"1995","journal-title":"From proof nets to interaction nets ser London Mathematical Society Lecture Note Series"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/978-3-662-54434-1_32"},{"year":"1986","author":"billingsley","journal-title":"Probability and Measure","key":"ref32"},{"year":"0","author":"dal lago","journal-title":"The geometry of bayesian programming","key":"ref31"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/2837614.2837672"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/S0304-3975(01)00241-9"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/0304-3975(87)90045-4"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1016\/0890-5401(91)90052-4"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/3236782"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/3236950.3236968"},{"key":"ref40","first-page":"283","article-title":"A token machine for full geometry of interaction","author":"laurent","year":"2001","journal-title":"Proceedings TLCA 2001"},{"key":"ref11","first-page":"297","article-title":"On coinductive equivalences for higher-order probabilistic functional programs","author":"dal lago","year":"2014","journal-title":"Proc of POPL 2014"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-642-54833-8_12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/3290351"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/S1571-0661(05)80216-6"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/LICS.2017.8005137"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"36: 1","DOI":"10.1145\/3290349","article-title":"A domain theory for statistical probabilistic programming","volume":"3","author":"v\u00e1k\u00e1r","year":"2019","journal-title":"Proc ACM Program Lang"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1016\/j.ic.2011.02.001"},{"key":"ref18","first-page":"59: 1","article-title":"Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming","volume":"2","author":"ehrhard","year":"2018","journal-title":"PACMPL"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1006\/inco.2000.2917"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/2951913.2951942","article-title":"A lambda-calculus foundation for universal probabilistic programming","author":"borgstr\u00f6m","year":"2016","journal-title":"Proc of ICFP 2016"},{"key":"ref4","first-page":"1024","article-title":"A new approach to probabilistic programming inference","author":"wood","year":"2014","journal-title":"Proceedings of AISTAT-2014"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1017\/S0305004100074338"},{"key":"ref3","first-page":"781","article-title":"PRIMES is in P","volume":"2","author":"agrawal","year":"2002","journal-title":"Ann of Math"},{"year":"1990","author":"jones","journal-title":"Probabilistic non-determinism","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/2603088.2603124"},{"key":"ref5","first-page":"220","article-title":"Church: a language for generative models","author":"goodman","year":"2008","journal-title":"Proceedings of UAI 2008"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/3164540"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/507382.507385"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/0022-314X(80)90084-0"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/978-3-662-54434-1_15"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/S0022-0000(76)80043-8"},{"year":"2018","author":"jacobs","journal-title":"Causal inference by string diagram surgery","key":"ref46"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1006\/inco.2000.2930"},{"key":"ref45","article-title":"Disintegration and bayesian inversion, both abstractly and concretely","author":"cho","year":"2017","journal-title":"Mathematical Structures in Computer Science"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1093\/biomet\/57.1.97"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/3009837.3009859"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1063\/1.1699114"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/S0049-237X(08)70271-4"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1145\/199448.199483"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1017\/S0960129502003730"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/S1571-0661(05)80398-6"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/3209108.3209187"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1016\/0022-4049(80)90101-2"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1016\/j.entcs.2018.11.016"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316823187","author":"jacobs","year":"2016","journal-title":"Introduction to Coalgebra Towards Mathematics of States and Observation ser Cambridge Tracts in Theoretical Computer Science"},{"key":"ref25","first-page":"16: 1","article-title":"Fully abstract models of the probabilistic lambda-calculus","author":"clairambault","year":"2018","journal-title":"Proc of CSL 2018"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785663.pdf?arnumber=8785663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T18:33:22Z","timestamp":1721586802000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785663","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}