{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:06:31Z","timestamp":1770293191793,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662544334","type":"print"},{"value":"9783662544341","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54434-1_32","type":"book-chapter","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:20:06Z","timestamp":1489810806000},"page":"855-879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Commutative Semantics for Probabilistic Programming"],"prefix":"10.1007","author":[{"given":"Sam","family":"Staton","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman, N.L., Freer, C.E., Roy, D.M.: Noncomputable conditional distributions. In: Proceedings of the LICS 2011 (2011)","DOI":"10.1109\/LICS.2011.49"},{"key":"32_CR2","unstructured":"Atkey, R.: What is a categorical model of arrows? In: Proceedings of the MSFP 2008 (2008)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J., Gordon, A.D., Greenberg, M., Margetson, J., van Gael, J.: Measure transformer semantics for Bayesian machine learning. LMCS 9(3), 11 (2013)","DOI":"10.2168\/LMCS-9(3:11)2013"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J., Lago, U.D., Gordon, A.D., Szymczak, M.: A lambda-calculus foundation for universal probabilistic programming. In: Proceedings of the ICFP (2016)","DOI":"10.1145\/2951913.2951942"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-28228-2_9","volume-title":"Practical Aspects of Declarative Languages","author":"J Carette","year":"2016","unstructured":"Carette, J., Shan, C.-C.: Simplifying probabilistic programs using computer algebra. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 135\u2013152. Springer, Cham (2016). doi:10.1007\/978-3-319-28228-2_9"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Culpepper, R., Cobb, A.: Contextual equivalence for probabilistic programs with continuous random variables and scoring. In: Proceedings of the ESOP 2017 (2017, to appear)","DOI":"10.1007\/978-3-662-54434-1_14"},{"key":"32_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781584889427","volume-title":"Stochastic Relations: Foundations for Markov Transition Systems","author":"EE Doberkat","year":"2007","unstructured":"Doberkat, E.E.: Stochastic Relations: Foundations for Markov Transition Systems. Chapman & Hall, London (2007)"},{"key":"32_CR8","unstructured":"Faissole, F., Spitters, B.: Synthetic topology in homotopy type theory for probabilistic programming. In: Proceedings of the PPS 2017 (2017)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Getoor, R.K.: Excessive Measures. Birkh\u00e4user (1990)","DOI":"10.1007\/978-1-4612-3470-8"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume":"915","author":"M Giry","year":"1982","unstructured":"Giry, M.: A categorical approach to probability theory. Categorical Aspects Topology Anal. 915, 68\u201385 (1982)","journal-title":"Categorical Aspects Topology Anal."},{"key":"32_CR11","unstructured":"Goodman, N., Mansinghka, V., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: UAI (2008)"},{"key":"32_CR12","unstructured":"Haghverdi, E.: A categorical approach to linear logic, geometry of proofs and full completeness. Ph.D. thesis, Ottawa (2000)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/aima.1999.1877","volume":"151","author":"C Hermida","year":"2000","unstructured":"Hermida, C.: Representable multicategories. Adv. Math. 151, 164\u2013225 (2000)","journal-title":"Adv. Math."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Heunen, C., Kammar, O., Staton, S., Yang, H.: A convenient category for higher-order probability theory (2017). arXiv:1701.02547","DOI":"10.1109\/LICS.2017.8005137"},{"key":"32_CR15","unstructured":"Huang, D., Morrisett, G.: An application of computable distributions to the semantics of probabilistic programs: part 2. In: Proceedings of the PPS 2017 (2017)"},{"issue":"1\u20133","key":"32_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0167-6423(99)00023-4","volume":"37","author":"J Hughes","year":"2000","unstructured":"Hughes, J.: Generalising monads to arrows. Sci. Comput. Program. 37(1\u20133), 67\u2013111 (2000)","journal-title":"Sci. Comput. Program."},{"issue":"3\u20134","key":"32_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0956796809007308","volume":"19","author":"B Jacobs","year":"2009","unstructured":"Jacobs, B., Heunen, C., Hasuo, I.: Categorical semantics for arrows. J. Funct. Program. 19(3\u20134), 403\u2013438 (2009)","journal-title":"J. Funct. Program."},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Zanasi, F.: A predicate\/state transformer semantics for Bayesian learning. In: Proceedings of the MFPS 2016 (2016)","DOI":"10.1016\/j.entcs.2016.09.038"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: Premonoidal categories and a graphical view of programs. Unpublished (1997)","DOI":"10.1016\/S1571-0661(05)80688-7"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00440-013-0535-7","volume":"160","author":"O Kallenberg","year":"2014","unstructured":"Kallenberg, O.: Stationary and invariant densities and disintegration kernels. Probab. Theory Relat. Fields 160, 567\u2013592 (2014)","journal-title":"Probab. Theory Relat. Fields"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probablistic programs. J. Comput. Syst. Sci. 22, 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR22","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0079385","volume-title":"Category Theory, Homology Theory and Their Applications","author":"J Lambek","year":"1969","unstructured":"Lambek, J.: Deductive systems and categories II. In: Hilton, P.J. (ed.) Category Theory, Homology Theory and Their Applications. LNM, vol. 86, pp. 76\u2013122. Springer, Heidelberg (1969)"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Last, G., Penrose, M.: Lectures on the Poisson process. CUP (2016)","DOI":"10.1017\/9781316104477"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Leinster, T.: Higher operads, higher categories. CUP (2004)","DOI":"10.1017\/CBO9780511525896"},{"issue":"2","key":"32_CR25","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0890-5401(03)00088-9","volume":"185","author":"PB Levy","year":"2003","unstructured":"Levy, P.B., Power, J., Thielecke, H.: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2), 182\u2013210 (2003)","journal-title":"Inf. Comput."},{"key":"32_CR26","unstructured":"Mansinghka, V.K., Selsam, D., Perov, Y.N.: Venture: a higher-order probabilistic programming platform with programmable inference (2014). http:\/\/arxiv.org\/abs\/1404.0099"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Mardare, R., Panangaden, P., Plotkin, G.: Quantitative algebraic reasoning. In: Proceedings of the LICS 2016 (2016)","DOI":"10.1145\/2933575.2934518"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"M\u00f8gelberg, R.E., Staton, S.: Linear usage of state. Logical Methods Comput. Sci. 10 (2014)","DOI":"10.2168\/LMCS-10(1:17)2014"},{"issue":"1","key":"32_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"32_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-29604-3_5","volume-title":"Functional and Logic Programming","author":"P Narayanan","year":"2016","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C., Zinkov, R.: Probabilistic inference by program transformation in Hakaru (system description). In: Kiselyov, O., King, A. (eds.) FLOPS 2016. LNCS, vol. 9613, pp. 62\u201379. Springer, Cham (2016). doi:10.1007\/978-3-319-29604-3_5"},{"key":"32_CR31","unstructured":"Paige, B., Wood, F.: A compilation target for probabilistic programming languages. In: ICML (2014)"},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Pollard, D.: A user\u2019s guide to measure theoretic probability. CUP (2002)","DOI":"10.1017\/CBO9780511811555"},{"issue":"2","key":"32_CR33","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.tcs.2006.08.006","volume":"364","author":"J Power","year":"2006","unstructured":"Power, J.: Generic models for computational effects. TCS 364(2), 254\u2013269 (2006)","journal-title":"TCS"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: POPL (2002)","DOI":"10.1145\/503272.503288"},{"key":"32_CR35","unstructured":"Ramsey, N.: All you need is the monad.. what monad was that again? In: PPS Workshop (2016)"},{"key":"32_CR36","unstructured":"Scherrer, C.: An exponential family basis for probabilistic programming. In: Proceedings of the PPS 2017 (2017)"},{"key":"32_CR37","doi-asserted-by":"crossref","unstructured":"\u015acibor, A., Ghahramani, Z., Gordon, A.D.: Practical probabilistic programming with monads. In: Proceedings of the Haskell Symposium. ACM (2015)","DOI":"10.1145\/2804302.2804317"},{"key":"32_CR38","doi-asserted-by":"crossref","unstructured":"Shan, C.C., Ramsey, N.: Symbolic Bayesian inference by symbolic disintegration (2016)","DOI":"10.1145\/3009837.3009852"},{"key":"32_CR39","volume-title":"General Theory of Markov Processes","author":"M Sharpe","year":"1988","unstructured":"Sharpe, M.: General Theory of Markov Processes. Academic Press, Cambridge (1988)"},{"key":"32_CR40","unstructured":"Stan Development Team: Stan: A C++ library for probability and sampling, version 2.5.0 (2014). http:\/\/mc-stan.org\/"},{"key":"32_CR41","doi-asserted-by":"crossref","unstructured":"Staton, S.: Freyd categories are enriched Lawvere theories. In: Algebra, Coalgebra and Topology, ENTCS, vol. 303 (2013)","DOI":"10.1016\/j.entcs.2014.02.010"},{"key":"32_CR42","doi-asserted-by":"crossref","unstructured":"Staton, S., Levy, P.: Universal properties for impure programming languages. In: Proceedings of the POPL 2013 (2013)","DOI":"10.1145\/2429069.2429091"},{"key":"32_CR43","doi-asserted-by":"crossref","unstructured":"Staton, S., Yang, H., Heunen, C., Kammar, O., Wood, F.: Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: Proceedings of the LICS 2016 (2016)","DOI":"10.1145\/2933575.2935313"},{"key":"32_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-662-46669-8_3","volume-title":"Programming Languages and Systems","author":"N Toronto","year":"2015","unstructured":"Toronto, N., McCarthy, J., Van Horn, D.: Running probabilistic programs backwards. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 53\u201379. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46669-8_3"},{"key":"32_CR45","unstructured":"Vickers, S.: A monad of valuation locales available from the author\u2019s website (2011)"},{"key":"32_CR46","unstructured":"Wood, F., van de Meent, J.W., Mansinghka, V.: A new approach to probabilistic programming inference. In: AISTATS (2014)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54434-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T15:58:01Z","timestamp":1635263881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54434-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544334","9783662544341"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54434-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2017a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}