{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T21:26:04Z","timestamp":1792963564577,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642197178","type":"print"},{"value":"9783642197185","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19718-5_5","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T14:17:15Z","timestamp":1300112235000},"page":"77-96","source":"Crossref","is-referenced-by-count":29,"title":["Measure Transformer Semantics for Bayesian Machine Learning"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Greenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Margetson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jurgen","family":"Van Gael","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"J. Cryptology"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1480881.1480894","volume-title":"POPL","author":"G. Barthe","year":"2009","unstructured":"Barthe, G., Gr\u00e9goire, B., B\u00e9guelin, S.Z.: Formal certification of code-based cryptographic proofs. In: POPL, pp. 90\u2013101. ACM, New York (2009)"},{"key":"5_CR3","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, Chichester (1995)","edition":"3"},{"key":"5_CR4","unstructured":"Bonawitz, K.A.: Composable Probabilistic Inference with Blaise. PhD thesis, MIT, Available as Technical Report MIT-CSAIL-TR-2008-044 (2008)"},{"key":"5_CR5","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. Technical report, Microsoft Research (2011)","DOI":"10.1007\/978-3-642-19718-5_5"},{"issue":"7","key":"5_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1538788.1538810","volume":"52","author":"N.N. Dalvi","year":"2009","unstructured":"Dalvi, N.N., R\u00e9, C., Suciu, D.: Probabilistic databases: diamonds in the dirt. Commun. ACM\u00a052(7), 86\u201394 (2009)","journal-title":"Commun. ACM"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0956796805005721","volume":"16","author":"M. Erwig","year":"2006","unstructured":"Erwig, M., Kollmansberger, S.: Functional pearls: Probabilistic functional programming in Haskell. J. Funct. Program.\u00a016(1), 21\u201334 (2006)","journal-title":"J. Funct. Program."},{"key":"5_CR8","first-page":"301","volume":"15","author":"D.A.S. Fraser","year":"1995","unstructured":"Fraser, D.A.S., McDunnough, P., Naderi, A., Plante, A.: On the definition of probability densities and sufficiency of the likelihood map. J. Probability and Mathematical Statistics\u00a015, 301\u2013310 (1995)","journal-title":"J. Probability and Mathematical Statistics"},{"key":"5_CR9","unstructured":"Goodman, N., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: UAI, pp. 220\u2013229. AUAI Press (2008)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, V., Jagadeesan, R., Panangaden, P.: Stochastic processes as concurrent constraint programs. In: POPL 1999, pp. 189\u2013202 (1999)","DOI":"10.1145\/292540.292558"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Minka, T., Graepel, T.: TrueSkill(TM): A Bayesian skill rating system. In: Advances in Neural Information Processing Systems 20 (2007)","DOI":"10.7551\/mitpress\/7503.003.0076"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Jaynes, E.T.: 15.7 The Borel-Kolmogorov paradox. In: Probability Theory: The Logic of Science, pp. 467\u2013470. CUP (2003)","DOI":"10.1017\/CBO9780511790423"},{"key":"5_CR13","first-page":"186","volume-title":"LICS","author":"C. Jones","year":"1989","unstructured":"Jones, C., Plotkin, G.D.: A probabilistic powerdomain of evaluations. In: LICS, pp. 186\u2013195. IEEE Computer Society, Los Alamitos (1989)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., Shan, C.: Monolingual probabilistic programming using generalized coroutines. In: UAI (2009)","DOI":"10.1007\/978-3-642-03034-5_17"},{"key":"5_CR15","volume-title":"Probabilistic Graphical Models","author":"D. Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models. The MIT Press, Cambridge (2009)"},{"key":"5_CR16","unstructured":"Koller, D., McAllester, D.A., Pfeffer, A.: Effective Bayesian inference for stochastic programs. In: AAAI\/IAAI, pp. 740\u2013747 (1997)"},{"issue":"3","key":"5_CR17","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 probabilistic programs. J. Comput. Syst. Sci.\u00a022(3), 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F.R. Kschischang","year":"2001","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory\u00a047(2), 498\u2013519 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"5_CR19","first-page":"5","volume":"153","author":"M.Z. Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: Quantitative analysis with the probabilistic model checker PRISM. ENTCS\u00a0153(2), 5\u201331 (2006)","journal-title":"ENTCS"},{"key":"5_CR20","first-page":"18","volume-title":"CSFW","author":"G. Lowe","year":"2002","unstructured":"Lowe, G.: Quantifying information flow. In: CSFW, pp. 18\u201331. IEEE Computer Society, Los Alamitos (2002)"},{"key":"5_CR21","unstructured":"MacKay, D.J.C.: Information Theory, Inference, and Learning Algorithms. CUP (2003)"},{"key":"5_CR22","unstructured":"McCallum, A., Schultz, K., Singh, S.: FACTORIE: Probabilistic programming via imperatively defined factor graphs. In: Poster at 23rd Annual Conference on Neural Information Processing Systems, NIPS (2009)"},{"key":"5_CR23","series-title":"Monographs in computer science","volume-title":"Abstraction, refinement and proof for probabilistic systems","author":"A. McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction, refinement and proof for probabilistic systems. Monographs in computer science. Springer, Heidelberg (2005)"},{"key":"5_CR24","first-page":"19","volume-title":"SIGMOD Conference","author":"F. McSherry","year":"2009","unstructured":"McSherry, F.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: SIGMOD Conference, pp. 19\u201330. ACM, New York (2009)"},{"key":"5_CR25","unstructured":"Minka, T., Winn, J., Guiver, J., Kannan, A.: Infer.NET 2.3 (November 2009), Software available from http:\/\/research.microsoft.com\/infernet"},{"key":"5_CR26","first-page":"1073","volume-title":"NIPS","author":"T. Minka","year":"2008","unstructured":"Minka, T., Winn, J.M.: Gates. In: NIPS, pp. 1073\u20131080. MIT Press, Cambridge (2008)"},{"key":"5_CR27","first-page":"362","volume-title":"UAI","author":"T.P. Minka","year":"2001","unstructured":"Minka, T.P.: Expectation Propagation for approximate Bayesian inference. In: UAI, pp. 362\u2013369. Morgan Kaufmann, San Francisco (2001)"},{"key":"5_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9780470434567","volume-title":"Bayesian Modeling Using WinBUGS","author":"I. Ntzoufras","year":"2009","unstructured":"Ntzoufras, I.: Bayesian Modeling Using WinBUGS. Wiley, Chichester (2009)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Panangaden, P.: Labelled Markov processes. Imperial College Press, London (2009)","DOI":"10.1142\/9781848162891"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/1040305.1040320","volume-title":"POPL","author":"S. Park","year":"2005","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based upon sampling functions. In: POPL, pp. 171\u2013182. ACM, New York (2005)"},{"key":"5_CR31","first-page":"733","volume-title":"IJCAI","author":"A. Pfeffer","year":"2001","unstructured":"Pfeffer, A.: IBAL: A probabilistic rational programming language. In: Nebel, B. (ed.) IJCAI, pp. 733\u2013740. Morgan Kaufmann, San Francisco (2001)"},{"key":"5_CR32","volume-title":"Statistical Relational Learning","author":"A. Pfeffer","year":"2007","unstructured":"Pfeffer, A.: The design and implementation of IBAL: A General-Purpose Probabilistic Language. In: Statistical Relational Learning. MIT Press, Cambridge (2007)"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: POPL, pp. 154\u2013165 (2002)","DOI":"10.1145\/565816.503288"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: A calculus for differential privacy. In: ICFP, pp. 157\u2013168 (2010)","DOI":"10.1145\/1932681.1863568"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-08921-7_92","volume-title":"Mathematical Foundations of Computer Science 1978","author":"N. Saheb-Djahromi","year":"1978","unstructured":"Saheb-Djahromi, N.: Probabilistic LCF. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol.\u00a064, pp. 442\u2013451. Springer, Heidelberg (1978)"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Syme, D., Granicz, A., Cisternino, A.: Expert F#. Apress (2007)","DOI":"10.1007\/978-1-4302-0285-1"},{"key":"5_CR37","unstructured":"Winn, J., Minka, T.: Probabilistic programming with Infer.NET. Machine Learning Summer School lecture notes (2009), http:\/\/research.microsoft.com\/~minka\/papers\/mlss2009\/"},{"key":"5_CR38","first-page":"661","volume":"6","author":"J.M. Winn","year":"2005","unstructured":"Winn, J.M., Bishop, C.M.: Variational message passing. Journal of Machine Learning Research\u00a06, 661\u2013694 (2005)","journal-title":"Journal of Machine Learning Research"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19718-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T07:34:29Z","timestamp":1741073669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19718-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197178","9783642197185"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19718-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}