{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:44:49Z","timestamp":1770277489540,"version":"3.49.0"},"reference-count":95,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["ERC Project BLAST and AFOSR Award No. FA9550?21?1?003"],"award-info":[{"award-number":["ERC Project BLAST and AFOSR Award No. FA9550?21?1?003"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["CoCoSys, one of seven centers in JUMP 2.0, a Semiconductor Research Corporation (SRC) program"],"award-info":[{"award-number":["CoCoSys, one of seven centers in JUMP 2.0, a Semiconductor Research Corporation (SRC) program"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00279680 and NRF-2018R1A5A1059921"],"award-info":[{"award-number":["RS-2023-00279680 and NRF-2018R1A5A1059921"]}],"id":[{"id":"10.13039\/501100003725","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":[[2024,1,2]]},"abstract":"<jats:p>We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic programming language corresponds to a graphon, and conversely, every graphon arises in this way.<\/jats:p>\n          <jats:p>We provide three constructions for showing that every graphon arises from an equational theory. The first is an abstract construction, using Markov categories and monoidal indeterminates. The second and third are more concrete. The second is in terms of traditional measure theoretic probability, which covers \u2018black-and-white\u2019 graphons. The third is in terms of probability monads on the nominal sets of Gabbay and Pitts. Specifically, we use a variation of nominal sets induced by the theory of graphs, which covers Erd\u0151s-R\u00e9nyi graphons. In this way, we build new models of graph probabilistic programming from graphons.<\/jats:p>","DOI":"10.1145\/3632903","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T20:48:51Z","timestamp":1704487731000},"page":"1819-1849","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8059-7497","authenticated-orcid":false,"given":"Nate","family":"Ackerman","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1791-6843","authenticated-orcid":false,"given":"Cameron E.","family":"Freer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7366-9889","authenticated-orcid":false,"given":"Younesse","family":"Kaddar","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8361-2912","authenticated-orcid":false,"given":"Jacek","family":"Karwowski","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, UK"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3930-5340","authenticated-orcid":false,"given":"Sean","family":"Moss","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8930-0058","authenticated-orcid":false,"given":"Daniel","family":"Roy","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0141-8922","authenticated-orcid":false,"given":"Sam","family":"Staton","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1502-2942","authenticated-orcid":false,"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}]}],"member":"320","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"e_1_3_1_2_1","unstructured":"Nathanael Ackerman. 2015. Representations of Aut(M)-Invariant Measures. arXiv e-print 1509.06170 (2015)."},{"key":"e_1_3_1_3_1","unstructured":"Nathanael Ackerman Cameron Freer Alex Kruckman and Rehana Patel. 2017b. Properly ergodic structures. arXiv e-print 1710.09336 (2017)."},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2016.15"},{"key":"e_1_3_1_5_1","unstructured":"Nathanael L. Ackerman Jeremy Avigad Cameron E. Freer Daniel M. Roy and Jason M. Rute. 2017a. On computable representations of exchangeable data. Workshop on Probabilistic Programming Semantics (PPS 2017). https:\/\/pps2017.luddy.indiana.edu\/files\/2016\/12\/compAH.pdf"},{"key":"e_1_3_1_6_1","doi-asserted-by":"crossref","unstructured":"Nathanael L. Ackerman Jeremy Avigad Cameron E. Freer Daniel M. Roy and Jason M. Rute. 2019. Algorithmic barriers to representing conditional independence. In Proc. 34th ACM\/IEEE Symp. Logic in Comp. Sci. (LICS 2019). 1\u201313.","DOI":"10.1109\/LICS.2019.8785762"},{"key":"e_1_3_1_7_1","unstructured":"Nathanael L. Ackerman Cameron E. Freer and Daniel M. Roy. 2016b. Exchangeable Random Primitives. Workshop on Probabilistic Programming Semantics (PPS 2016). http:\/\/pps2016.luddy.indiana.edu\/files\/2015\/12\/xrp.pdf"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594179"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579"},{"key":"e_1_3_1_10_1","doi-asserted-by":"crossref","unstructured":"Pablo Andr\u00e9s-Mart\u00ednez Chris Heunen and Robin Kaarsgaard. 2022. Universal Properties of Partial Quantum Maps. In Proc QPL 2022.","DOI":"10.4204\/EPTCS.394.11"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/483"},{"key":"e_1_3_1_12_1","unstructured":"Pedro Henrique Azevedo de Amorim. 2023. A Higher-Order Language for Markov Kernels and Linear Operators. In Proc. FOSSACS 2023."},{"key":"e_1_3_1_13_1","doi-asserted-by":"crossref","unstructured":"Nick Benton Gavin Bierman Valeria de Paiva and Martin Hyland. 1992. Linear \ud835\udf06-calculus and categorical models revisited. In Proc. CSL 1992.","DOI":"10.1007\/3-540-56992-8_6"},{"issue":"3","key":"e_1_3_1_14_1","article-title":"Automata theory in nominal sets","volume":"10","author":"Bojanczyk Mikolaj","year":"2014","unstructured":"Mikolaj Bojanczyk, Bartek Klin, and Slawomir Lasota. 2014. Automata theory in nominal sets. Logical Methods in Computer Science 10, 3 (2014).","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_1_15_1","doi-asserted-by":"crossref","unstructured":"M. Boja\u0144czyk and T. Place. 2012. Towards model theory with data values. In Proc. ICALP 2012.","DOI":"10.1007\/978-3-642-31585-5_14"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/3527602755"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20633"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.3150\/22-BEJ1533"},{"key":"e_1_3_1_19_1","doi-asserted-by":"crossref","unstructured":"Olivia Caramello. 2013. Topological Galois Theory. Advances in Mathematics 291 (2013).","DOI":"10.1016\/j.aim.2015.11.050"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11787-014-0104-6"},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(93)90035-R"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12233"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000232"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2017.61"},{"key":"e_1_3_1_25_1","doi-asserted-by":"crossref","unstructured":"Geoffrey S. H. Cruttwell Bruno Gavranovic Neil Ghani Paul Wilson and Fabio Zanasi. 2021. Categorical Foundations of Gradient-Based Learning. In Proc. ESOP 2021.","DOI":"10.1007\/978-3-030-99336-8_1"},{"key":"e_1_3_1_26_1","doi-asserted-by":"crossref","unstructured":"Fredrik Dahlqvist Louis Parlant and Alexandra Silva. 2018. Layer by layer: composing monads. In Proc. ICTAC 2018.","DOI":"10.1007\/978-3-030-02508-3_9"},{"key":"e_1_3_1_27_1","doi-asserted-by":"crossref","unstructured":"S. Dash Y. Kaddar H. Paquet and S. Staton. 2023. Affine monads and lazy structures for Bayesian programming. In Proc. POPL 2023.","DOI":"10.1145\/3571239"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158147"},{"issue":"1","key":"e_1_3_1_29_1","article-title":"Probabilistic call by push value","volume":"15","author":"Ehrhard Thomas","year":"2019","unstructured":"Thomas Ehrhard and Christine Tasson. 2019. Probabilistic call by push value. Logical Methods in Computer Science 15, 1 (2019).","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_1_31_1","doi-asserted-by":"crossref","unstructured":"M P Fiore. 2005. Mathematical models of computational and combinatorial structures. In Proc. FOSSACS 2005.","DOI":"10.1007\/978-3-540-31982-5_2"},{"key":"e_1_3_1_32_1","first-page":"11","volume-title":"Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (Vancouver, Canada) (LICS \u201919)","author":"Fong Brendan","year":"2021","unstructured":"Brendan Fong, David Spivak, and R\u00e9my Tuy\u00e9ras. 2021. Backprop as Functor: A Compositional Perspective on Supervised Learning. In Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (Vancouver, Canada) (LICS \u201919). IEEE Press, Article 11, 13 pages."},{"key":"e_1_3_1_33_1","unstructured":"Cameron Freer and Daniel Roy. 2010. Posterior distributions are computable from predictive distributions. In Proc. 13th Int. Conf. Artificial Intelligence and Statistics (AISTATS 2010). 233\u2013240."},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2011.06.011"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2020.107239"},{"key":"e_1_3_1_36_1","unstructured":"Tobias Fritz Fabio Gadducci Paolo Perrone and Davide Trotta. 2023. Weakly affine monads. arXiv e-print 2303.14049 (2023)."},{"key":"e_1_3_1_37_1","doi-asserted-by":"crossref","unstructured":"Murdoch Gabbay and Andrew M Pitts. 1999. A New Approach to Abstract Syntax Involving Binders. In Proc. LICS 1999. 214\u2013224.","DOI":"10.1109\/LICS.1999.782617"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759729"},{"key":"e_1_3_1_39_1","doi-asserted-by":"crossref","unstructured":"Mich\u00e8le Giry. 1980. A categorical approach to probability theory. In Categorical aspects of topology and analysis (Lecture Notes in Math. Vol. 915). 68\u201385.","DOI":"10.1007\/BFb0092872"},{"key":"e_1_3_1_40_1","first-page":"220","volume-title":"Proc. 24th Conf. Uncertainty in Artificial Intelligence (UAI 2008)","author":"Goodman Noah","year":"2008","unstructured":"Noah Goodman, Vikash K. Mansinghka, Daniel Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: A universal language for generative models. In Proc. 24th Conf. Uncertainty in Artificial Intelligence (UAI 2008). AUAI Press, 220\u2013229."},{"key":"e_1_3_1_41_1","unstructured":"N. D. Goodman and J. B. Tenenbaum. 2023. Probabilistic Models of Cognition. http:\/\/v1.probmods.org"},{"key":"e_1_3_1_42_1","unstructured":"Jean Goubault-Larrecq Xiaodong Jia and Cl\u00e9ment Th\u00e9ron. 2021. A Domain-Theoretic Approach to Statistical Programming Languages. arXiv e-print 2106.16190 (2021)."},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.01.001"},{"key":"e_1_3_1_44_1","doi-asserted-by":"crossref","unstructured":"Chris Heunen Ohad Kammar Sam Staton and Hongseok Yang. 2017. A convenient category for higher-order probability theory. In Proc. LICS 2017.","DOI":"10.1109\/LICS.2017.8005137"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(94)00153-7"},{"key":"e_1_3_1_46_1","unstructured":"Mathieu Huot and Sam Staton. 2018. Universal Properties in Quantum Theory. In Proc. QPL 2018."},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)90020-5"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2016.11.006"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.95.12"},{"key":"e_1_3_1_51_1","article-title":"Graphons, cut norm and distance, couplings and rearrangements","volume":"4","author":"Janson Svante","year":"2013","unstructured":"Svante Janson. 2013. Graphons, cut norm and distance, couplings and rearrangements. New York Journal of Mathematics Monographs 4 (2013).","journal-title":"New York Journal of Mathematics Monographs"},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90059-3"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470611"},{"key":"e_1_3_1_54_1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198515982.001.0001"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.5802\/ahl.74"},{"key":"e_1_3_1_56_1","doi-asserted-by":"crossref","unstructured":"Younesse Kaddar and Sam Staton. 2023. A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories. In Proc. MFPS 2023. To appear.","DOI":"10.46298\/entics.12291"},{"key":"e_1_3_1_57_1","volume-title":"Foundations of Modern Probability","author":"Kallenberg Olav","year":"2010","unstructured":"Olav Kallenberg. 2010. Foundations of Modern Probability (2nd ed.). Springer New York.","edition":"2"},{"key":"e_1_3_1_58_1","volume-title":"An algebraic theory of type-and-effect systems","author":"Kammar Ohad","year":"2014","unstructured":"Ohad Kammar. 2014. An algebraic theory of type-and-effect systems. Ph.D. Dissertation. University of Edinburgh."},{"key":"e_1_3_1_59_1","doi-asserted-by":"crossref","unstructured":"Ohad Kammar and Dylan McDermott. 2018. Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics. In Proc. MFPS 2018. 239\u2013260.","DOI":"10.1016\/j.entcs.2018.11.012"},{"key":"e_1_3_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-005-0503-1"},{"key":"e_1_3_1_61_1","unstructured":"Oleg Kiselyov and Chung-Chieh Shan. 2010. Probabilistic programming using first-class stores and first-class continuations. In Proc. 2010 ACM SIGPLAN Workshop on ML."},{"key":"e_1_3_1_62_1","unstructured":"Bartek Klin Slawomir Lasota Joanna Ochremiak and Szymon Torunczyk. 2016. Homomorphism Problems for First-Order Definable Structures. In Proc. FSTTCS 2016."},{"key":"e_1_3_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01220868"},{"issue":"4","key":"e_1_3_1_64_1","first-page":"97","article-title":"Commutative monads as a theory of distributions","volume":"26","author":"Kock Anders","year":"2012","unstructured":"Anders Kock. 2012. Commutative monads as a theory of distributions. Theory Appl. Categ. 26, 4 (2012), 97\u2013131.","journal-title":"Theory Appl. Categ."},{"key":"e_1_3_1_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"e_1_3_1_66_1","doi-asserted-by":"crossref","unstructured":"H. Lindner. 1979. Affine parts of monads. Arch. Math. (1979).","DOI":"10.1007\/BF01222782"},{"key":"e_1_3_1_67_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. 2012. Large networks and graph limits. Amer. Math. Soc. Providence RI. xiv+475 pages.","DOI":"10.1090\/coll\/060"},{"key":"e_1_3_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.05.002"},{"key":"e_1_3_1_69_1","volume-title":"Categories for the Working Mathematician","author":"Lane Saunders Mac","year":"1998","unstructured":"Saunders Mac Lane. 1998. Categories for the Working Mathematician. Springer."},{"key":"e_1_3_1_70_1","unstructured":"Vikash Mansinghka Daniel Selsam and Yura Perov. 2014. Venture: a higher-order probabilistic programming platform with programmable inference. arXiv e-print 1404.0099 (2014)."},{"key":"e_1_3_1_71_1","volume-title":"Model Theory : An Introduction","author":"Marker David","year":"2002","unstructured":"David Marker. 2002. Model Theory : An Introduction. Springer Science & Business Media."},{"key":"e_1_3_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531130.3533370"},{"key":"e_1_3_1_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77353"},{"key":"e_1_3_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2334607"},{"key":"e_1_3_1_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/967313.967316"},{"key":"e_1_3_1_76_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"e_1_3_1_77_1","doi-asserted-by":"publisher","DOI":"10.5555\/373919.373928"},{"key":"e_1_3_1_78_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139084673"},{"key":"e_1_3_1_79_1","doi-asserted-by":"crossref","unstructured":"Gordon D. Plotkin and John Power. 2002. Notions of Computation Determine Monads. In Proc. FOSSACS 2002.","DOI":"10.1007\/3-540-45931-6_24"},{"key":"e_1_3_1_80_1","doi-asserted-by":"crossref","unstructured":"A J Power. 2006a. Semantics for local computational effects. In Proc. MFPS 2006.","DOI":"10.1016\/j.entcs.2006.04.018"},{"key":"e_1_3_1_81_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.006"},{"key":"e_1_3_1_82_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"e_1_3_1_83_1","unstructured":"Daniel Roy Vikash K. Mansinghka Noah Goodman and Joshua B. Tenenbaum. 2008. A stochastic programming perspective on nonparametric Bayes. In Workshop on Nonparametric Bayes (co-located with ICML 2008)."},{"issue":"1","key":"e_1_3_1_84_1","article-title":"Categorical Stochastic Processes and Likelihood","volume":"3","author":"Shiebler Dan","year":"2021","unstructured":"Dan Shiebler. 2021. Categorical Stochastic Processes and Likelihood. Compositionality 3 (April 2021). Issue 1.","journal-title":"Compositionality"},{"key":"e_1_3_1_85_1","doi-asserted-by":"crossref","unstructured":"Sam Staton. 2017. Commutative Semantics for Probabilistic Programming. In Proc. ESOP 2017. 855\u2013879.","DOI":"10.1007\/978-3-662-54434-1_32"},{"key":"e_1_3_1_86_1","unstructured":"Sam Staton Dario Stein Hongseok Yang Nathanael L. Ackerman Cameron E. Freer and Daniel M. Roy. 2018. The Beta-Bernoulli Process and Algebraic Effects. In Proc. ICALP 2018. Appendix at arXiv:1802.09598."},{"key":"e_1_3_1_87_1","unstructured":"Sam Staton Hongseok Yang Nathanael Ackerman Cameron Freer and Daniel M. Roy. 2017. Exchangeable Random Processes and Data Abstraction. Workshop on Probabilistic Programming Semantics (PPS 2017). https:\/\/pps2017.luddy.indiana.edu\/files\/2017\/01\/staton-yang-ackerman-freer-roy.pdf"},{"key":"e_1_3_1_88_1","volume-title":"Structural Foundations for Probabilistic Programming Languages","author":"Stein Dario","year":"2021","unstructured":"Dario Stein. 2021. Structural Foundations for Probabilistic Programming Languages. Ph.D. Dissertation. University of Oxford."},{"key":"e_1_3_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(78)90160-6"},{"key":"e_1_3_1_90_1","unstructured":"Terence Tao. 2013. Ultraproducts as a Bridge Between Discrete and Continuous Analysis. https:\/\/terrytao.wordpress.com\/2013\/12\/07\/"},{"key":"e_1_3_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290349"},{"key":"e_1_3_1_92_1","unstructured":"Jan-Willem van de Meent Brooks Paige Hongseok Yang and Frank Wood. 2018. An Introduction to Probabilistic Programming. arXiv e-print 1809.10756 (2018)."},{"key":"e_1_3_1_93_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1778"},{"key":"e_1_3_1_94_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700003506"},{"key":"e_1_3_1_95_1","unstructured":"Frank Wood Jan Willem van de Meent and Vikash Mansinghka. 2014. A New Approach to Probabilistic Programming Inference. In Proc. 17th Int. Conf. on Artificial Intelligence and Statistics (AISTATS 2014). 1024\u20131032."},{"key":"e_1_3_1_96_1","volume-title":"Reduced Traces and JITing in Church","author":"Wu Jeff","year":"2013","unstructured":"Jeff Wu. 2013. Reduced Traces and JITing in Church. Master\u2019s thesis. Mass. Inst. of Tech."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632903","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:02:20Z","timestamp":1751659340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,2]]},"references-count":95,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2024,1,2]]}},"alternative-id":["10.1145\/3632903"],"URL":"https:\/\/doi.org\/10.1145\/3632903","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,2]]},"assertion":[{"value":"2024-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}