{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:11Z","timestamp":1751662871650,"version":"3.41.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-14-2-0007"],"award-info":[{"award-number":["FA8750-14-2-0007"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1763922"],"award-info":[{"award-number":["1763922"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2019,7,26]]},"abstract":"<jats:p>\n            Probabilistic programming languages are valuable because they allow domain experts to express probabilistic models and inference algorithms without worrying about irrelevant details. However, for decades there remained an important and popular class of probabilistic inference algorithms whose efficient implementation required manual low-level coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires random array variables that are\n            <jats:italic>latent<\/jats:italic>\n            or whose likelihood is\n            <jats:italic>conjugate<\/jats:italic>\n            . Although that is how practitioners communicate and compose these algorithms on paper, executing such expressions requires\n            <jats:italic>eliminating<\/jats:italic>\n            the latent variables and\n            <jats:italic>recognizing<\/jats:italic>\n            the conjugacy by symbolic mathematics. Moreover, matching the performance of handwritten code requires speeding up loops by more than a constant factor.\n          <\/jats:p>\n          <jats:p>We show how probabilistic programs that directly and concisely express these desired inference algorithms can be compiled while maintaining efficiency. We introduce new transformations that turn high-level probabilistic programs with arrays into pure loop code. We then make great use of domain-specific invariants and norms to optimize the code, and to specialize and JIT-compile the code per execution. The resulting performance is competitive with manual implementations.<\/jats:p>","DOI":"10.1145\/3341702","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T20:55:51Z","timestamp":1564433751000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["From high-level inference algorithms to efficient code"],"prefix":"10.1145","volume":"3","author":[{"given":"Rajan","family":"Walia","sequence":"first","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Praveen","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Jacques","family":"Carette","sequence":"additional","affiliation":[{"name":"McMaster University, Canada"}]},{"given":"Sam","family":"Tobin-Hochstadt","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Chung-chieh","family":"Shan","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"1986","unstructured":"Alfred V. Aho , Ravi Sethi , and Jeffrey D . Ullman . 1986 . Compilers : Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Thomas Bayes. 1763. An Essay towards Solving a Problem in the Doctrine of Chances. Philosophical Transactions of the Royal Society of London 53 (1763) 370\u2013418.  Thomas Bayes. 1763. An Essay towards Solving a Problem in the Doctrine of Chances. Philosophical Transactions of the Royal Society of London 53 (1763) 370\u2013418.","DOI":"10.1098\/rstl.1763.0053"},{"key":"e_1_2_2_3_1","unstructured":"Michael Betancourt. 2017. A Conceptual Introduction to Hamiltonian Monte Carlo. e-Print 1701.02434. arXiv.org. https: \/\/arxiv.org\/abs\/1701.02434  Michael Betancourt. 2017. A Conceptual Introduction to Hamiltonian Monte Carlo. e-Print 1701.02434. arXiv.org. https: \/\/arxiv.org\/abs\/1701.02434"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730497"},{"key":"e_1_2_2_5_1","article-title":"Latent Dirichlet Allocation","author":"Blei David M.","year":"2003","unstructured":"David M. Blei , Andrew Y. Ng , and Michael I. Jordan . 2003 . Latent Dirichlet Allocation . Journal of Machine Learning Research 3 , Jan. (Jan. 2003), 993\u20131022. David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent Dirichlet Allocation. Journal of Machine Learning Research 3, Jan. (Jan. 2003), 993\u20131022.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837653"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.62"},{"volume-title":"Practical Aspects of Declarative Languages: 18th International Symposium, PADL 2016 (Lecture Notes in Computer Science), Marco Gavanelli and John H","author":"Carette Jacques","key":"e_1_2_2_8_1","unstructured":"Jacques Carette and Chung-chieh Shan. 2016. Simplifying Probabilistic Programs Using Computer Algebra . In Practical Aspects of Declarative Languages: 18th International Symposium, PADL 2016 (Lecture Notes in Computer Science), Marco Gavanelli and John H . Reppy (Eds.). 135\u2013152. Jacques Carette and Chung-chieh Shan. 2016. Simplifying Probabilistic Programs Using Computer Algebra. In Practical Aspects of Declarative Languages: 18th International Symposium, PADL 2016 (Lecture Notes in Computer Science), Marco Gavanelli and John H. Reppy (Eds.). 135\u2013152."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/83.1.81"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0207"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X136976"},{"key":"e_1_2_2_13_1","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence, Manuela M. Veloso (Ed.). 2462\u20132467","author":"Raedt Luc De","year":"2007","unstructured":"Luc De Raedt , Angelika Kimmig , and Hannu Toivonen . 2007 . ProbLog: A Probabilistic Prolog and its Application in Link Discovery . In Proceedings of the 20th International Joint Conference on Artificial Intelligence, Manuela M. Veloso (Ed.). 2462\u20132467 . Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. 2007. ProbLog: A Probabilistic Prolog and its Application in Link Discovery. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, Manuela M. Veloso (Ed.). 2462\u20132467."},{"volume-title":"Introduction to Statistical Relational Learning","author":"de Salvo Braz Rodrigo","key":"e_1_2_2_14_1","unstructured":"Rodrigo de Salvo Braz , Eyal Amir , and Dan Roth . 2007. Lifted First-Order Probabilistic Inference . In Introduction to Statistical Relational Learning , Lise Getoor and Ben Taskar (Eds.). MIT Press , 433\u2013451. Rodrigo de Salvo Braz, Eyal Amir, and Dan Roth. 2007. Lifted First-Order Probabilistic Inference. In Introduction to Statistical Relational Learning, Lise Getoor and Ben Taskar (Eds.). MIT Press, 433\u2013451."},{"volume-title":"Gal Elidan","author":"de Salvo Braz Rodrigo","key":"e_1_2_2_15_1","unstructured":"Rodrigo de Salvo Braz and Ciaran O\u2019Reilly . 2017. Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories , Gal Elidan , Kristian Kersting, and Alexander T. Ihler (Eds.). AUAI Press . Rodrigo de Salvo Braz and Ciaran O\u2019Reilly. 2017. Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories, Gal Elidan, Kristian Kersting, and Alexander T. Ihler (Eds.). AUAI Press."},{"key":"e_1_2_2_16_1","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3591\u20133599","author":"de Salvo Braz Rodrigo","year":"2016","unstructured":"Rodrigo de Salvo Braz , Ciaran O\u2019Reilly , Vibhav Gogate , and Rina Dechter . 2016 . Probabilistic Inference Modulo Theories . In Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3591\u20133599 . http:\/\/www.ijcai.org\/Abstract\/16\/506 Rodrigo de Salvo Braz, Ciaran O\u2019Reilly, Vibhav Gogate, and Rina Dechter. 2016. Probabilistic Inference Modulo Theories. In Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3591\u20133599. http:\/\/www.ijcai.org\/Abstract\/16\/506"},{"key":"e_1_2_2_17_1","volume-title":"Bucket Elimination: A Unifying Framework for Probabilistic Inference. In Learning and Inference in Graphical Models, Michael I","author":"Dechter Rina","year":"1998","unstructured":"Rina Dechter . 1998 . Bucket Elimination: A Unifying Framework for Probabilistic Inference. In Learning and Inference in Graphical Models, Michael I . Jordan (Ed.). Kluwer, Dordrecht. Paperback : Learning in Graphical Models, MIT Press . Rina Dechter. 1998. Bucket Elimination: A Unifying Framework for Probabilistic Inference. In Learning and Inference in Graphical Models, Michael I. Jordan (Ed.). Kluwer, Dordrecht. Paperback: Learning in Graphical Models, MIT Press."},{"key":"e_1_2_2_18_1","unstructured":"Dua Dheeru and Efi Karra Taniskidou. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml  Dua Dheeru and Efi Karra Taniskidou. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004562"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"e_1_2_2_21_1","volume-title":"Vechev","author":"Gehr Timon","year":"2016","unstructured":"Timon Gehr , Sasa Misailovic , and Martin T . Vechev . 2016 . PSI : Exact Symbolic Inference for Probabilistic Programs. In Proceedings of the 28th International Conference on Computer Aided Verification, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer , 62\u201383. Timon Gehr, Sasa Misailovic, and Martin T. Vechev. 2016. PSI: Exact Symbolic Inference for Probabilistic Programs. In Proceedings of the 28th International Conference on Computer Aided Verification, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer, 62\u201383."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10476213"},{"key":"e_1_2_2_23_1","volume-title":"Rubin","author":"Gelman Andrew","year":"2014","unstructured":"Andrew Gelman , John B. Carlin , Hal S. Stern , David B. Dunson , Aki Vehtari , and Donald B . Rubin . 2014 . Bayesian Data Analysis (third ed.). CRC Press . Andrew Gelman, John B. Carlin, Hal S. Stern, David B. Dunson, Aki Vehtari, and Donald B. Rubin. 2014. Bayesian Data Analysis (third ed.). CRC Press."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214504000001132"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092872"},{"volume-title":"Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, David Allen McAllester and Petri Myllym\u00e4ki (Eds.). 220\u2013229","author":"Goodman Noah D.","key":"e_1_2_2_26_1","unstructured":"Noah D. Goodman , Vikash K. Mansinghka , Daniel Roy , Keith Bonawitz , and Joshua B. Tenenbaum . 2008. Church: A Language for Generative Models . In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, David Allen McAllester and Petri Myllym\u00e4ki (Eds.). 220\u2013229 . Noah D. Goodman, Vikash K. Mansinghka, Daniel Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: A Language for Generative Models. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, David Allen McAllester and Petri Myllym\u00e4ki (Eds.). 220\u2013229."},{"key":"e_1_2_2_27_1","volume-title":"Goodman and Andreas Stuhlm\u00fcller","author":"Noah","year":"2014","unstructured":"Noah D. Goodman and Andreas Stuhlm\u00fcller . 2014 . The Design and Implementation of Probabilistic Programming Languages . http:\/\/dippl.org . Noah D. Goodman and Andreas Stuhlm\u00fcller. 2014. The Design and Implementation of Probabilistic Programming Languages. http:\/\/dippl.org ."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_2_2_29_1","first-page":"1593","article-title":"The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo","volume":"15","author":"Hoffman Matthew D.","year":"2014","unstructured":"Matthew D. Hoffman and Andrew Gelman . 2014 . The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo . Journal of Machine Learning Research 15 , 1 (2014), 1593 \u2013 1623 . Matthew D. Hoffman and Andrew Gelman. 2014. The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo. Journal of Machine Learning Research 15, 1 (2014), 1593\u20131623.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_2_30_1","volume-title":"Autoconj: Recognizing and Exploiting Conjugacy Without a Domain-Specific Language. In Advances in Neural Information Processing Systems, Samy Bengio, Hanna M","author":"Hoffman Matthew D.","year":"2018","unstructured":"Matthew D. Hoffman , Matthew J. Johnson , and Dustin Tran . 2018 . Autoconj: Recognizing and Exploiting Conjugacy Without a Domain-Specific Language. In Advances in Neural Information Processing Systems, Samy Bengio, Hanna M . Wallach, Hugo Larochelle, Kristen Grauman, Nicol\u00f2 Cesa-Bianchi, and Roman Garnett (Eds.). 10739\u201310749. http:\/\/papers.nips.cc\/ paper\/8270-autoconj-recognizing-and-exploiting-conjugacy-without-a-domain-specific-language.pdf Matthew D. Hoffman, Matthew J. Johnson, and Dustin Tran. 2018. Autoconj: Recognizing and Exploiting Conjugacy Without a Domain-Specific Language. In Advances in Neural Information Processing Systems, Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicol\u00f2 Cesa-Bianchi, and Roman Garnett (Eds.). 10739\u201310749. http:\/\/papers.nips.cc\/ paper\/8270-autoconj-recognizing-and-exploiting-conjugacy-without-a-domain-specific-language.pdf"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062375"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645526.657278"},{"volume-title":"Computer Algebra in Quantum Field Theory, Carsten Schneider and Johannes Bl\u00fcmlein (Eds.)","author":"Kauers Manuel","key":"e_1_2_2_33_1","unstructured":"Manuel Kauers . 2013. The Holonomic Toolkit . In Computer Algebra in Quantum Field Theory, Carsten Schneider and Johannes Bl\u00fcmlein (Eds.) . Springer , 119\u2013144. Manuel Kauers. 2013. The Holonomic Toolkit. In Computer Algebra in Quantum Field Theory, Carsten Schneider and Johannes Bl\u00fcmlein (Eds.). Springer, 119\u2013144."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47958-3_19"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03034-5_17"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"Koller Daphne","key":"e_1_2_2_36_1","unstructured":"Daphne Koller and Nir Friedman . 2009. Probabilistic Graphical Models: Principles and Techniques . MIT Press . Daphne Koller and Nir Friedman. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press."},{"key":"e_1_2_2_37_1","first-page":"303","article-title":"Unbiased Estimates","volume":"14","author":"Kolmogorov Andrey N.","year":"1950","unstructured":"Andrey N. Kolmogorov . 1950 . Unbiased Estimates . Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 14 , 4 (1950), 303 \u2013 326 . Andrey N. Kolmogorov. 1950. Unbiased Estimates. Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 14, 4 (1950), 303\u2013326.","journal-title":"Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1994.10476829"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/81.1.27"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008929526011"},{"volume-title":"Learning and Inference in Graphical Models, Michael I","author":"MacKay David J. C.","key":"e_1_2_2_41_1","unstructured":"David J. C. MacKay . 1998. Introduction to Monte Carlo Methods . In Learning and Inference in Graphical Models, Michael I . Jordan (Ed.). Kluwer, Dordrecht. Paperback : Learning in Graphical Models, MIT Press . David J. C. MacKay. 1998. Introduction to Monte Carlo Methods. In Learning and Inference in Graphical Models, Michael I. Jordan (Ed.). Kluwer, Dordrecht. Paperback: Learning in Graphical Models, MIT Press."},{"key":"e_1_2_2_42_1","unstructured":"Vikash Mansinghka Daniel Selsam and Yura Perov. 2014. Venture: a Higher-Order Probabilistic Programming Platform with Programmable Inference. e-Print 1404.0099. arXiv.org.  Vikash Mansinghka Daniel Selsam and Yura Perov. 2014. Venture: a Higher-Order Probabilistic Programming Platform with Programmable Inference. e-Print 1404.0099. arXiv.org."},{"key":"e_1_2_2_43_1","volume-title":"AAAI-98 workshop on learning for text categorization","volume":"752","author":"McCallum Andrew","year":"1998","unstructured":"Andrew McCallum and Kamal Nigam . 1998 . A Comparison of Event Models for Naive Bayes Text Classification . In AAAI-98 workshop on learning for text categorization , Vol. 752 . 41\u201348. Andrew McCallum and Kamal Nigam. 1998. A Comparison of Event Models for Naive Bayes Text Classification. In AAAI-98 workshop on learning for text categorization, Vol. 752. 41\u201348."},{"key":"e_1_2_2_44_1","volume-title":"MALLET: A Machine Learning for Language Toolkit","author":"McCallum Andrew Kachites","year":"2002","unstructured":"Andrew Kachites McCallum . 2002 . MALLET: A Machine Learning for Language Toolkit . http:\/\/mallet.cs.umass.edu Andrew Kachites McCallum. 2002. MALLET: A Machine Learning for Language Toolkit. http:\/\/mallet.cs.umass.edu"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/86.2.301"},{"key":"e_1_2_2_46_1","volume-title":"BLOG: Probabilistic Models with Unknown Objects. In Introduction to Statistical Relational Learning","author":"Milch Brian","year":"2007","unstructured":"Brian Milch , Bhaskara Marthi , Stuart Russell , David Sontag , Daniel L. Ong , and Andrey Kolobov . 2007 . BLOG: Probabilistic Models with Unknown Objects. In Introduction to Statistical Relational Learning , Lise Getoor and Ben Taskar (Eds.). MIT Press , Chapter 13, 373\u2013398. Brian Milch, Bhaskara Marthi, Stuart Russell, David Sontag, Daniel L. Ong, and Andrey Kolobov. 2007. BLOG: Probabilistic Models with Unknown Objects. In Introduction to Statistical Relational Learning, Lise Getoor and Ben Taskar (Eds.). MIT Press, Chapter 13, 373\u2013398."},{"volume-title":"Proceedings of AISTATS 2018: 21st International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research), Amos Storkey and Fernando Perez-Cruz (Eds.). 1037\u20131046","author":"Murray Lawrence M.","key":"e_1_2_2_47_1","unstructured":"Lawrence M. Murray , Daniel Lund\u00e9n , Jan Kudlicka , David Broman , and Thomas B. Sch\u00f6n . 2018. Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs . In Proceedings of AISTATS 2018: 21st International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research), Amos Storkey and Fernando Perez-Cruz (Eds.). 1037\u20131046 . Lawrence M. Murray, Daniel Lund\u00e9n, Jan Kudlicka, David Broman, and Thomas B. Sch\u00f6n. 2018. Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs. In Proceedings of AISTATS 2018: 21st International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research), Amos Storkey and Fernando Perez-Cruz (Eds.). 1037\u20131046."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110255"},{"volume-title":"Handbook of Markov Chain Monte Carlo, Steve Brooks, Andrew Gelman, Galin Jones, and Xiao-Li Meng (Eds.)","author":"Neal Radford M.","key":"e_1_2_2_50_1","unstructured":"Radford M. Neal . 2011. MCMC Using Hamiltonian Dynamics . In Handbook of Markov Chain Monte Carlo, Steve Brooks, Andrew Gelman, Galin Jones, and Xiao-Li Meng (Eds.) . CRC Press , Chapter 5. Radford M. Neal. 2011. MCMC Using Hamiltonian Dynamics. In Handbook of Markov Chain Monte Carlo, Steve Brooks, Andrew Gelman, Galin Jones, and Xiao-Li Meng (Eds.). CRC Press, Chapter 5."},{"key":"e_1_2_2_51_1","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence, Carla E. Brodley and Peter Stone (Eds.). AAAI Press, 2476\u20132482","author":"Nori Aditya V.","year":"2014","unstructured":"Aditya V. Nori , Chung-Kil Hur , Sriram K. Rajamani , and Selva Samuel . 2014 . R2: An Efficient MCMC Sampler for Probabilistic Programs . In Proceedings of the 28th AAAI Conference on Artificial Intelligence, Carla E. Brodley and Peter Stone (Eds.). AAAI Press, 2476\u20132482 . Aditya V. Nori, Chung-Kil Hur, Sriram K. Rajamani, and Selva Samuel. 2014. R2: An Efficient MCMC Sampler for Probabilistic Programs. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, Carla E. Brodley and Peter Stone (Eds.). AAAI Press, 2476\u20132482."},{"key":"e_1_2_2_52_1","volume-title":"Automated Enumeration of Discrete Latent Variables. (2018). Poster at PROBPROG","author":"Obermeyer Fritz H.","year":"2018","unstructured":"Fritz H. Obermeyer , Eli Bingham , Martin Jankowiak , Neeraj Pradhan , and Noah Goodman . 2018. Automated Enumeration of Discrete Latent Variables. (2018). Poster at PROBPROG 2018 . Fritz H. Obermeyer, Eli Bingham, Martin Jankowiak, Neeraj Pradhan, and Noah Goodman. 2018. Automated Enumeration of Discrete Latent Variables. (2018). Poster at PROBPROG 2018."},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v035.i04"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1894.0003"},{"volume-title":"Introduction to Statistical Relational Learning","author":"Pfeffer Avi","key":"e_1_2_2_55_1","unstructured":"Avi Pfeffer . 2007. The Design and Implementation of IBAL: A General-Purpose Probabilistic Language . In Introduction to Statistical Relational Learning , Lise Getoor and Ben Taskar (Eds.). MIT Press , Chapter 14, 399\u2013432. Avi Pfeffer. 2007. The Design and Implementation of IBAL: A General-Purpose Probabilistic Language. In Introduction to Statistical Relational Learning, Lise Getoor and Ben Taskar (Eds.). MIT Press, Chapter 14, 399\u2013432."},{"volume-title":"Practical Probabilistic Programming","author":"Pfeffer Avi","key":"e_1_2_2_56_1","unstructured":"Avi Pfeffer . 2016. Practical Probabilistic Programming . Manning Publications . Avi Pfeffer. 2016. Practical Probabilistic Programming. Manning Publications."},{"key":"e_1_2_2_57_1","volume-title":"Proceedings of the 3rd International Workshop on Distributed Statistical Computing.","author":"Plummer Martyn","year":"2003","unstructured":"Martyn Plummer . 2003 . JAGS: A program for analysis of Bayesian graphical models using Gibbs sampling . In Proceedings of the 3rd International Workshop on Distributed Statistical Computing. Martyn Plummer. 2003. JAGS: A program for analysis of Bayesian graphical models using Gibbs sampling. In Proceedings of the 3rd International Workshop on Distributed Statistical Computing."},{"volume-title":"A User\u2019s Guide to Measure Theoretic Probability","author":"Pollard David","key":"e_1_2_2_58_1","unstructured":"David Pollard . 2001. A User\u2019s Guide to Measure Theoretic Probability . Cambridge University Press . David Pollard. 2001. A User\u2019s Guide to Measure Theoretic Probability. Cambridge University Press."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1122"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/108235.108253"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503288"},{"key":"e_1_2_2_62_1","first-page":"81","article-title":"Information and Accuracy Attainable in the Estimation of Statistical Parameters","volume":"37","author":"Rao C. Radhakrishna","year":"1945","unstructured":"C. Radhakrishna Rao . 1945 . Information and Accuracy Attainable in the Estimation of Statistical Parameters . Bulletin of the Calcutta Mathematical Society 37 , 3 (1945), 81 \u2013 91 . C. Radhakrishna Rao. 1945. Information and Accuracy Attainable in the Estimation of Statistical Parameters. Bulletin of the Calcutta Mathematical Society 37, 3 (1945), 81\u201391.","journal-title":"Bulletin of the Calcutta Mathematical Society"},{"key":"e_1_2_2_64_1","volume-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence, J\u00f6rg Hoffmann and Bart Selman (Eds.). AAAI Press","author":"Sanner Scott","year":"2012","unstructured":"Scott Sanner and Ehsan Abbasnejad . 2012 . Symbolic Variable Elimination for Discrete and Continuous Graphical Models . In Proceedings of the 26th AAAI Conference on Artificial Intelligence, J\u00f6rg Hoffmann and Bart Selman (Eds.). AAAI Press , 1954\u20131960. Scott Sanner and Ehsan Abbasnejad. 2012. Symbolic Variable Elimination for Discrete and Continuous Graphical Models. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, J\u00f6rg Hoffmann and Bart Selman (Eds.). AAAI Press, 1954\u20131960."},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009852"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54434-1_32"},{"volume-title":"5th International Conference on Learning Representations.","author":"Tran Dustin","key":"e_1_2_2_67_1","unstructured":"Dustin Tran , Matthew D. Hoffman , Rif A. Saurous , Eugene Brevdo , Kevin Murphy , and David M. Blei . 2017. Deep Probabilistic Programming. e-Print 1701.03757. arXiv.org . 5th International Conference on Learning Representations. Dustin Tran, Matthew D. Hoffman, Rif A. Saurous, Eugene Brevdo, Kevin Murphy, and David M. Blei. 2017. Deep Probabilistic Programming. e-Print 1701.03757. arXiv.org. 5th International Conference on Learning Representations."},{"key":"e_1_2_2_68_1","unstructured":"Jean-Baptiste Tristan Daniel Huang Joseph Tassarotti Adam C. Pocock Stephen J. Green and Guy Lewis Steele Jr. 2014. Augur: a Modeling Language for Data-Parallel Probabilistic Inference. e-Print 1312.3613. arXiv.org. http:\/\/arxiv.org\/abs\/ 1312.3613  Jean-Baptiste Tristan Daniel Huang Joseph Tassarotti Adam C. Pocock Stephen J. Green and Guy Lewis Steele Jr. 2014. Augur: a Modeling Language for Data-Parallel Probabilistic Inference. e-Print 1312.3613. arXiv.org. http:\/\/arxiv.org\/abs\/ 1312.3613"},{"key":"e_1_2_2_69_1","volume-title":"Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence, Ann Nicholson and Padhraic Smyth (Eds.). 664\u2013673","author":"Venugopal Deepak","year":"2013","unstructured":"Deepak Venugopal and Vibhav Gogate . 2013 . Dynamic Blocking and Collapsing for Gibbs Sampling . In Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence, Ann Nicholson and Padhraic Smyth (Eds.). 664\u2013673 . Deepak Venugopal and Vibhav Gogate. 2013. Dynamic Blocking and Collapsing for Gibbs Sampling. In Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence, Ann Nicholson and Padhraic Smyth (Eds.). 664\u2013673."},{"key":"e_1_2_2_70_1","first-page":"557","article-title":"An Algorithmic Proof Theory for Hypergeometric (Ordinary and \u201cq","volume":"108","author":"Wilf Herbert S.","year":"1992","unstructured":"Herbert S. Wilf and Doron Zeilberger . 1992 . An Algorithmic Proof Theory for Hypergeometric (Ordinary and \u201cq \u201d ) Multisum\/Integral Identities. Inventiones mathematicae 108 (1992), 557 \u2013 633 . Herbert S. Wilf and Doron Zeilberger. 1992. An Algorithmic Proof Theory for Hypergeometric (Ordinary and \u201cq\u201d) Multisum\/Integral Identities. Inventiones mathematicae 108 (1992), 557\u2013633.","journal-title":") Multisum\/Integral Identities. Inventiones mathematicae"},{"key":"e_1_2_2_71_1","volume-title":"Goodman","author":"Wingate David","year":"2011","unstructured":"David Wingate , Andreas Stuhlm\u00fcller , and Noah D . Goodman . 2011 . Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation. In Proceedings of AISTATS 2011: 14th International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings), Geoffrey Gordon, David Dunson, and Miroslav Dud\u00edk (Eds.). MIT Press , 770\u2013778. David Wingate, Andreas Stuhlm\u00fcller, and Noah D. Goodman. 2011. Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation. In Proceedings of AISTATS 2011: 14th International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings), Geoffrey Gordon, David Dunson, and Miroslav Dud\u00edk (Eds.). MIT Press, 770\u2013778."},{"volume-title":"Proceedings of AISTATS 2014: 17th International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings). 1024\u20131032","author":"Wood Frank","key":"e_1_2_2_72_1","unstructured":"Frank Wood , Jan Willem van de Meent, and Vikash Mansinghka. 2014. A New Approach to Probabilistic Programming Inference . In Proceedings of AISTATS 2014: 17th International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings). 1024\u20131032 . Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka. 2014. A New Approach to Probabilistic Programming Inference. In Proceedings of AISTATS 2014: 17th International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings). 1024\u20131032."},{"key":"e_1_2_2_73_1","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3637\u20133645","author":"Wu Yi","year":"2016","unstructured":"Yi Wu , Lei Li , Stuart J. Russell , and Rastislav Bod\u00edk . 2016 . Swift: Compiled Inference for Probabilistic Programming Languages . In Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3637\u20133645 . http:\/\/www.ijcai.org\/Abstract\/16\/512 Yi Wu, Lei Li, Stuart J. Russell, and Rastislav Bod\u00edk. 2016. Swift: Compiled Inference for Probabilistic Programming Languages. In Proceedings of the 25th International Joint Conference on Artificial Intelligence, Subbarao Kambhampati (Ed.). AAAI Press, 3637\u20133645. http:\/\/www.ijcai.org\/Abstract\/16\/512"},{"volume-title":"Proceedings of the 10th Canadian Conference on Artificial Intelligence. 171\u2013178","author":"Zhang Nevin Lianwen","key":"e_1_2_2_74_1","unstructured":"Nevin Lianwen Zhang and David L. Poole . 1994. A Simple Approach to Bayesian Network Computations . In Proceedings of the 10th Canadian Conference on Artificial Intelligence. 171\u2013178 . Nevin Lianwen Zhang and David L. Poole. 1994. A Simple Approach to Bayesian Network Computations. In Proceedings of the 10th Canadian Conference on Artificial Intelligence. 171\u2013178."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622756.1622765"},{"volume-title":"Gal Elidan","author":"Zinkov Robert","key":"e_1_2_2_76_1","unstructured":"Robert Zinkov and Chung-chieh Shan. 2017. Composing Inference Algorithms as Program Transformations , Gal Elidan , Kristian Kersting, and Alexander T. Ihler (Eds.). AUAI Press . Robert Zinkov and Chung-chieh Shan. 2017. Composing Inference Algorithms as Program Transformations, Gal Elidan, Kristian Kersting, and Alexander T. Ihler (Eds.). AUAI Press."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341702","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:23Z","timestamp":1750207403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":75,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2019,7,26]]}},"alternative-id":["10.1145\/3341702"],"URL":"https:\/\/doi.org\/10.1145\/3341702","relation":{},"ISSN":["2475-1421"],"issn-type":[{"type":"electronic","value":"2475-1421"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"assertion":[{"value":"2019-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}