{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:14:24Z","timestamp":1784211264396,"version":"3.55.0"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00279680"],"award-info":[{"award-number":["RS-2023-00279680"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-CE39-0014"],"award-info":[{"award-number":["ANR-22-CE39-0014"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-PECY-0005"],"award-info":[{"award-number":["ANR-22-PECY-0005"]}],"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":[[2026,1,8]]},"abstract":"<jats:p>Probabilistic programming languages (PPLs) are a popular tool for high-level modelling across many fields. They provide a range of algorithms for probabilistic inference, which analyse models by learning their parameters from a dataset or estimating their posterior distributions. However, probabilistic inference is known to be very costly. One of the bottlenecks of probabilistic inference stems from the iteration over entries of a large dataset or a long series of random samples. Vectorisation can mitigate this cost, but manual vectorisation is error-prone, and existing automatic techniques are often ad-hoc and limited, unable to handle general repetition structures, such as nested loops and loops with data-dependent control flow, without significant user intervention. To address this bottleneck, we propose a sound and effective method for automatically vectorising loops in probabilistic programs. Our method achieves high throughput using speculative parallel execution of loop iterations, while preserving the semantics of the original loop through a fixed-point check. We formalise our method as a translation from an imperative PPL into a lower-level target language with primitives geared towards vectorisation. We implemented our method for the Pyro PPL and evaluated it on a range of probabilistic models. Our experiments show significant performance gains against an existing vectorisation baseline, achieving 1.1\u20136\u00d7 speedups and reducing GPU memory usage in many cases. Unlike the baseline, which is limited to a subset of models, our method effectively handled all the tested models.<\/jats:p>","DOI":"10.1145\/3776663","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"597-627","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimising Density Computations in Probabilistic Programs via Automatic Loop Vectorisation"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6172-0644","authenticated-orcid":false,"given":"Sangho","family":"Lim","sequence":"first","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9728-3125","authenticated-orcid":false,"given":"Hyoungjin","family":"Lim","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0301-0872","authenticated-orcid":false,"given":"Wonyeol","family":"Lee","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2875-6171","authenticated-orcid":false,"given":"Xavier","family":"Rival","sequence":"additional","affiliation":[{"name":"DIENS - \u00c9cole Normale Sup\u00e9rieure de Paris - CNRS - PSL University, Ecole Normale Sup\u00e9rieur de Paris - PSL, Paris, France"},{"name":"Inria Paris, Inria, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1502-2942","authenticated-orcid":false,"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1516"},{"key":"e_1_3_2_3_2","unstructured":"Ashish Agarwal. 2019. Static automatic batching in TensorFlow. In International Conference on Machine Learning (ICML). 92\u2013101. https:\/\/proceedings.mlr.press\/v97\/agarwal19a.html"},{"key":"e_1_3_2_4_2","unstructured":"Ran Aroussi. 2020. yfinance: Download market data from Yahoo! Finance\u2019s API. https:\/\/github.com\/ranaroussi\/yfinance Accessed: 2025-07-10."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1201\/9780203487808"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Joao Barreto Aleksandar Dragojevic Paulo Ferreira Ricardo Filipe and Rachid Guerraoui. 2012. Unifying thread-level speculation and transactional memory. In International Middleware Conference (Middleware). 187\u2013207. doi:10.1007\/978-3-642-35170-9_10","DOI":"10.1007\/978-3-642-35170-9_10"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","unstructured":"Guillaume Baudart Javier Burroni Martin Hirzel Louis Mandel and Avraham Shinnar. 2021. Compiling Stan to generative probabilistic languages and extension to deep probabilistic programming. In ACM Conference on Programming Language Design and Implementation (PLDI). 497\u2013510. doi:10.1145\/3453483.3454058","DOI":"10.1145\/3453483.3454058"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656463"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Maria A Berezina Daniel Rudoy and Patrick J Wolfe. 2010. Autoregressive modeling of voiced speech. In International Conference on Acoustics Speech and Signal Processing (ICASSP). 5042\u20135045. doi:10.1109\/ICASSP.2010.5495058","DOI":"10.1109\/ICASSP.2010.5495058"},{"issue":"28","key":"e_1_3_2_10_2","first-page":"1","article-title":"Pyro: Deep Universal Probabilistic Programming","volume":"20","author":"Bingham Eli","year":"2019","unstructured":"Eli Bingham, Jonathan P. Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul A. Szerlip, Paul Horsfall, and Noah D. Goodman. 2019. Pyro: Deep Universal Probabilistic Programming. Journal of Machine Learning Research 20, 28 (2019), 1\u20136. http:\/\/jmlr.org\/papers\/v20\/18-403.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_11_2","unstructured":"Eli Bingham Jonathan P. Chen Martin Jankowiak Fritz Obermeyer Neeraj Pradhan Theofanis Karaletsos Rohit Singh Paul A. Szerlip Paul Horsfall and Noah D. Goodman. 2019. Pyro: Deep Universal Probabilistic Programming with Python and PyTorch. https:\/\/github.com\/pyro-ppl\/pyro Accessed: 2025-07-10."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1088\/0967-3334\/23\/2\/308"},{"key":"e_1_3_2_13_2","unstructured":"Nicolas Boulanger-Lewandowski Yoshua Bengio and Pascal Vincent. 2012. Modeling temporal dependencies in high-dimensional sequences: application to polyphonic music generation and transcription. In International Conference on Machine Learning (ICML). 1159\u20131166. https:\/\/icml.cc\/2012\/papers\/590.pdf"},{"key":"e_1_3_2_14_2","unstructured":"James Bradbury Roy Frostig Peter Hawkins Matthew James Johnson Chris Leary Dougal Maclaurin George Necula Adam Paszke Jake VanderPlas Skye Wanderman-Milne and Qiao Zhang. 2018. JAX: composable transformations of Python+NumPy programs. http:\/\/github.com\/jax-ml\/jax Accessed: 2025-07-10."},{"key":"e_1_3_2_15_2","unstructured":"James Bradbury and Chunli Fu. 2018. Automatic batching as a compiler pass in PyTorch. In Workshop on Systems for ML at NeurIPS 2018. http:\/\/learningsys.org\/nips18\/assets\/papers\/107CameraReadySubmissionMatchbox__LearningSys_Abstract_%20(2).pdf"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.62"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2403.14488"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"e_1_3_2_19_2","first-page":"7731","volume-title":"International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 235)","author":"Chen Wenlin","year":"2024","unstructured":"Wenlin Chen, Mingtian Zhang, Brooks Paige, Jos\u00e9 Miguel Hern\u00e1ndez-Lobato, and David Barber. 2024. Diffusive Gibbs Sampling. In International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 235). PMLR, 7731\u20137747. https:\/\/proceedings.mlr.press\/v235\/chen24be.html"},{"key":"e_1_3_2_20_2","unstructured":"Wenlin Chen Mingtian Zhang Brooks Paige Jos\u00e9 Miguel Hern\u00e1ndez-Lobato and David Barber. 2024. Diffusive Gibbs Sampling. https:\/\/github.com\/Wenlin-Chen\/DiGS Accessed: 2025-10-20."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1201\/9780429113352"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"F. Dang Hao Yu and L. Rauchwerger. 2002. The R-LRPD test: speculative parallelization of partially parallel loops. In International Parallel and Distributed Processing Symposium (IPDPS). doi:10.1109\/IPDPS.2002.1015493","DOI":"10.1109\/IPDPS.2002.1015493"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2006.00553.x"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Joshua V Dillon Ian Langmore Dustin Tran Eugene Brevdo Srinivas Vasudevan Dave Moore Brian Patton Alex Alemi Matt Hoffman and Rif A Saurous. 2017. Tensorflow distributions. arXiv:1711.10604 (2017). doi:10.48550\/arXiv.1711.10604","DOI":"10.48550\/arXiv.1711.10604"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0370-2693(87)91197-X"},{"key":"e_1_3_2_26_2","unstructured":"Hong Ge Kai Xu and Zoubin Ghahramani. 2018. Turing: a language for flexible probabilistic inference. In International Conference on Artificial Intelligence and Statistics (AISTATS). 1682\u20131690. http:\/\/proceedings.mlr.press\/v84\/ge18b.html"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3490421"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502622"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","unstructured":"Justin Holewinski Ragavendar Ramamurthi Mahesh Ravishankar Naznin Fauzia Louis-No\u00ebl Pouchet Atanas Rountev and P Sadayappan. 2012. Dynamic trace-based analysis of vectorization potential of applications. In ACM Conference on Programming Language Design and Implementation (PLDI). 371\u2013382. doi:10.1145\/2254064.2254108","DOI":"10.1145\/2254064.2254108"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Midori Hyndman Allan D Jepson and David J Fleet. 2007. Higher-order Autoregressive Models for Dynamic Textures. In British Machine Vision Conference (BMVC). doi:10.5244\/C.21.76","DOI":"10.5244\/C.21.76"},{"key":"e_1_3_2_33_2","unstructured":"Krishna Murthy Jatavallabhula Miles Macklin Dieter Fox Animesh Garg and Fabio Ramos. 2023. Bayesian Object Models for Robotic Interaction with Differentiable Probabilistic Programming. In Conference on Robot Learning (CoRL). 1563\u20131574. https:\/\/proceedings.mlr.press\/v205\/jatavallabhula23a.html"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/C2022-0-02766-5"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729392"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In International Conference on Learning Representations (ICLR). doi:10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","unstructured":"Rahul Krishnan Uri Shalit and David Sontag. 2017. Structured Inference Networks for Nonlinear State Space Models. In AAAI Conference on Artificial Intelligence (AAAI). doi:10.1609\/aaai.v31i1.10779","DOI":"10.1609\/aaai.v31i1.10779"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","unstructured":"Junpeng Lao Christopher Suter Ian Langmore Cyril Chimisov Ashish Saxena Pavel Sountsov Dave Moore Rif A Saurous Matthew D Hoffman and Joshua V Dillon. 2020. tfp.mcmc: Modern Markov chain Monte Carlo tools built for modern hardware. arXiv:2002.01184 (2020). doi:10.48550\/arXiv.2002.01184","DOI":"10.48550\/arXiv.2002.01184"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3571205"},{"key":"e_1_3_2_40_2","unstructured":"Wonyeol Lee Hangyeol Yu and Hongseok Yang. 2018. Reparameterization Gradient for Non-differentiable Models. In Annual Conference on Neural Information Processing Systems (NeurIPS). https:\/\/dl.acm.org\/doi\/10.5555\/3327345.3327459"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","unstructured":"Sangho Lim Hyoungjin Lim Wonyeol Lee Xavier Rival and Hongseok Yang. 2025. Optimising Density Computations in Probabilistic Programs via Automatic Loop Vectorisation. arXiv:2511.11070 (2025). doi:10.48550\/arXiv.2511.11070","DOI":"10.48550\/arXiv.2511.11070"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Mojtaba Mehrara Jeff Hao Po-Chun Hsu and Scott Mahlke. 2009. Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory. In ACM Conference on Programming Language Design and Implementation (PLDI). 166\u2013176. doi:10.1145\/1542476.1542495","DOI":"10.1145\/1542476.1542495"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1201\/b10905"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1701.03980"},{"key":"e_1_3_2_46_2","unstructured":"Graham Neubig Yoav Goldberg and Chris Dyer. 2017. On-the-fly operation batching in dynamic computation graphs. In Annual Conference on Neural Information Processing Systems (NeurIPS). https:\/\/dl.acm.org\/doi\/10.5555\/3294996.3295153"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","unstructured":"Cosmin E Oancea Alan Mycroft and Tim Harris. 2009. A lightweight in-place implementation for software thread-level speculation. In Annual Symposium on Parallelism in Algorithms and Architectures (SPAA). 223\u2013232. doi:10.1145\/1583991.1584050","DOI":"10.1145\/1583991.1584050"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","unstructured":"Fritz Obermeyer Eli Bingham Martin Jankowiak Du Phan and Jonathan Chen. 2020. Functional Tensors for Probabilistic Programming. arXiv:1910.10775 (2020). doi:10.48550\/arXiv.1910.10775","DOI":"10.48550\/arXiv.1910.10775"},{"key":"e_1_3_2_49_2","first-page":"4871","article-title":"Tensor Variable Elimination for Plated Factor Graphs","volume":"97","author":"Obermeyer Fritz","year":"2019","unstructured":"Fritz Obermeyer, Eli Bingham, Martin Jankowiak, Neeraj Pradhan, Justin Chiu, Alexander Rush, and Noah Goodman. 2019. Tensor Variable Elimination for Plated Factor Graphs. In International Conference on Machine Learning (ICML), Vol. 97. 4871\u20134880. https:\/\/proceedings.mlr.press\/v97\/obermeyer19a.html","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","unstructured":"Jingwen Pan and Amir Shaikhha. 2023. Compiling discrete probabilistic programs for vectorized exact inference. In International Conference on Compiler Construction (CC). 13\u201324. doi:10.1145\/3578360.3580258","DOI":"10.1145\/3578360.3580258"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178964"},{"key":"e_1_3_2_52_2","unstructured":"Adam Paszke Sam Gross Francisco Massa Adam Lerer James Bradbury Gregory Chanan Trevor Killeen Zeming Lin Natalia Gimelshein Luca Antiga Alban Desmaison Andreas K\u00f6pf Edward Z. Yang Zachary DeVito Martin Raison Alykhan Tejani Sasank Chilamkurthy Benoit Steiner Lu Fang Junjie Bai and Soumith Chintala. 2019. PyTorch: An Imperative Style High-Performance Deep Learning Library. In Annual Conference on Neural Information Processing Systems (NeurIPS). 8024\u20138035. https:\/\/dl.acm.org\/doi\/10.5555\/3454287.3455008"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","unstructured":"Du Phan Neeraj Pradhan and Martin Jankowiak. 2019. Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro. arXiv:1912.11554 (2019). doi:10.48550\/arXiv.1912.11554","DOI":"10.48550\/arXiv.1912.11554"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.12691\/ajeid-9-1-4"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781351018784"},{"key":"e_1_3_2_56_2","first-page":"390","article-title":"Automatically batching control-intensive programs for modern accelerators","volume":"2","author":"Radul Alexey","year":"2020","unstructured":"Alexey Radul, Brian Patton, Dougal Maclaurin, Matthew Hoffman, and Rif A. Saurous. 2020. Automatically batching control-intensive programs for modern accelerators. In Machine Learning and Systems (MLSys), Vol. 2. 390\u2013399. https:\/\/proceedings.mlsys.org\/paper_files\/paper\/2020\/file\/39945d578f616735572174bf5e8f155d-Paper.pdf","journal-title":"Machine Learning and Systems (MLSys)"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2976316"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1101\/2023.10.10.561673"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00753"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66335-7_24"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","unstructured":"Gintautas Tamulevi\u010dius and Jonas Kaukenas. 2017. High-order Autoregressive Modeling of Individual Speaker\u2019s Qualities. In IEEE Workshop on Advances in Information Electronic and Electrical Engineering (AIEEE). doi:10.1109\/AIEEE.2017.8270551","DOI":"10.1109\/AIEEE.2017.8270551"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3631709"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","unstructured":"David Tolpin Jan-Willem van de Meent Hongseok Yang and Frank Wood. 2016. Design and Implementation of Probabilistic Programming Language Anglican. In Symposium on the Implementation and Application of Functional Programming Languages (IFL). Article 6. doi:10.1145\/3064899.3064910","DOI":"10.1145\/3064899.3064910"},{"key":"e_1_3_2_65_2","unstructured":"Dustin Tran Matthew D. Hoffman Dave Moore Christopher Suter Srinivas Vasudevan Alexey Radul Matthew Johnson and Rif A. Saurous. 2018. Simple Distributed and Accelerated Probabilistic Programming. In Annual Conference on Neural Information Processing Systems (NeurlPS). https:\/\/dl.acm.org\/doi\/10.5555\/3327757.3327859"},{"key":"e_1_3_2_66_2","unstructured":"Bay Area Rapid Transit. 2024. Ridership Reports. https:\/\/www.bart.gov\/about\/reports\/ridership Accessed: 2025-07-10."},{"key":"e_1_3_2_67_2","unstructured":"Uber Technologies Inc. 2025. Pyro Documentation: Distributions (DiscreteHMM). https:\/\/docs.pyro.ai\/en\/dev\/distributions.html#pyro.distributions.DiscreteHMM Accessed: 2025-07-10."},{"key":"e_1_3_2_68_2","unstructured":"Uber Technologies Inc. 2025. Pyro Documentation: Funsor-Based Pyro (vectorized_markov). https:\/\/docs.pyro.ai\/en\/dev\/contrib.funsor.html#pyro.contrib.funsor.vectorized_markov Accessed: 2025-07-10."},{"key":"e_1_3_2_69_2","unstructured":"Uber Technologies Inc. 2025. Pyro Documentation: Primitives (plate). https:\/\/docs.pyro.ai\/en\/dev\/primitives.html#pyro.primitives.plate Accessed: 2025-07-10."},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2011.37"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2011.37"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2021.550603"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","unstructured":"Chenggang Zhang Guodong Han and Cho-Li Wang. 2013. GPU-TLS: An Efficient Runtime for Speculative Loop Parallelization on GPUs. In International Symposium on Cluster Cloud and Grid Computing (CCGrid). 120\u2013127. doi:10.1109\/CCGrid.2013.34","DOI":"10.1109\/CCGrid.2013.34"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010893"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T13:45:39Z","timestamp":1784209539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":73,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776663"],"URL":"https:\/\/doi.org\/10.1145\/3776663","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-07-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}