{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:55:33Z","timestamp":1773194133360,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,17]]},"DOI":"10.1145\/3579990.3580020","type":"proceedings-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T10:27:10Z","timestamp":1677061630000},"page":"41-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Looplets: A Language for Structured Coiteration"],"prefix":"10.1145","author":[{"given":"Willow","family":"Ahrens","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Daniel","family":"Donenfeld","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Fredrik","family":"Kjolstad","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Saman","family":"Amarasinghe","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2022. TIFF Revision 6.0. https:\/\/www.loc.gov\/preservation\/digital\/formats\/fdd\/fdd000022.shtml"},{"key":"e_1_3_2_1_2_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Abadi Martin","year":"2016","unstructured":"Martin Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek G. Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng. 2016. TensorFlow: A system for large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). 265\u2013283. https:\/\/www.usenix.org\/system\/files\/conference\/osdi16\/osdi16-abadi.pdf"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523442"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7499790"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661197"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1564507"},{"key":"e_1_3_2_1_7_1","volume-title":"Compiler Support for Sparse Matrix Computations. Ph. D. Dissertation. LIACS","author":"Bik Aart J. C.","unstructured":"Aart J. C. Bik. 1996. Compiler Support for Sparse Matrix Computations. Ph. D. Dissertation. LIACS, Leiden University. https:\/\/theses.liacs.nl\/1315"},{"key":"e_1_3_2_1_8_1","unstructured":"Aart J. C. Bik Penporn Koanantakool Tatiana Shpeisman Nicolas Vasilache Bixia Zheng and Fredrik Kjolstad. 2022. Compiler Support for Sparse Tensor Computations in MLIR. arXiv:2202.04305 [cs] Feb. arxiv:2202.04305 arXiv: 2202.04305"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/165939.166023"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57659-2_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/567806.567807"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Gregory Cohen Saeed Afshar Jonathan Tapson and Andr\u00e9 van Schaik. 2017. EMNIST: an extension of MNIST to handwritten letters. https:\/\/doi.org\/10.48550\/arXiv.1702.05373 arXiv:1702.05373 [cs]","DOI":"10.48550\/arXiv.1702.05373"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322125"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO53902.2022.9741282"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185540"},{"key":"e_1_3_2_1_18_1","volume-title":"Mowry","author":"Fegade Pratik","year":"2021","unstructured":"Pratik Fegade, Tianqi Chen, Phillip B. Gibbons, and Todd C. Mowry. 2021. The CoRa Tensor Compiler: Compilation for Ragged Tensors with Minimal Padding. arXiv:2110.10221 [cs], Oct., arxiv:2110.10221 arXiv: 2110.10221"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511528.3511535"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485505"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971033.ch5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Olivia Hsu Maxwell Strange Jaeyeon Won Ritvik Sharma Kunle Olukotun Joel Emer Mark Horowitz and Fredrik Kjolstad. 2022. The Sparse Abstract Machine. https:\/\/doi.org\/10.48550\/arXiv.2208.14610 arXiv:2208.14610 [cs]","DOI":"10.48550\/arXiv.2208.14610"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356506"},{"key":"e_1_3_2_1_25_1","volume-title":"A programming language","author":"Iverson Kenneth E.","unstructured":"Kenneth E. Iverson. 1962. A programming language. John Wiley & Sons, Inc., USA. isbn:978-0-471-43014-8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093333.3009880"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661185"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28928307"},{"key":"e_1_3_2_1_31_1","unstructured":"Vladimir Kotlyar. 1999. Relational Algebraic Techniques for the Synthesis of Sparse Matrix Programs. Cornell. 00000"},{"key":"e_1_3_2_1_32_1","unstructured":"Vladimir Kotlyar Keshav Pingali and Paul Stodghill. 1997. Compiling parallel sparse code for user-defined data structures. Cornell. 00000"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0002751"},{"key":"e_1_3_2_1_34_1","unstructured":"Scott Kovach and Fredrik Kjolstad. 2022. Correct Compilation of Semiring Contractions. arxiv:2207.13291 arXiv:2207.13291 [cs]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aab3050"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_1_37_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498717"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060597"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670338"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351476.2351493"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002940"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"William Pugh and Tatiana Shpeisman. 1999. SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations. In Languages and Compilers for Parallel Computing Siddhartha Chatterjee Jan F. Prins Larry Carter Jeanne Ferrante Zhiyuan Li David Sehr and Pen-Chung Yew (Eds.) (Lecture Notes in Computer Science). Springer Berlin Heidelberg. 213\u2013229. isbn:978-3-540-48319-9 https:\/\/doi.org\/10.1007\/3-540-48319-5_14 10.1007\/3-540-48319-5_14","DOI":"10.1007\/3-540-48319-5_14"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185528"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428226"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Jessica Shi Stephen Chou Fredrik Kjolstad and Saman Amarasinghe. 2021. An Attempt to Generate Code for Symmetric Tensor Computations. https:\/\/doi.org\/10.48550\/arXiv.2110.00186 arXiv:2110.00186 [cs]","DOI":"10.48550\/arXiv.2110.00186"},{"key":"e_1_3_2_1_49_1","unstructured":"Edgar Solomonik and Torsten Hoefler. 2015. Sparse Tensor Algebra as a Parallel Programming Model. arXiv:1512.00066 [cs] Nov. arxiv:1512.00066 arXiv: 1512.00066"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.06.002"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.2200\/S01004ED1V01Y202004CAC050"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1631272.1631319"},{"key":"e_1_3_2_1_54_1","unstructured":"Ruiqin Tian Luanzheng Guo Jiajia Li Bin Ren and Gokcen Kestor. 2021. A High-Performance Sparse Tensor Algebra Compiler in Multi-Level IR. arXiv:2102.05187 [cs] Feb. arxiv:2102.05187 arXiv: 2102.05187"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5441\/002"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523437"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","unstructured":"Zihao Ye Ruihang Lai Junru Shao Tianqi Chen and Luis Ceze. 2022. SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning. https:\/\/doi.org\/10.48550\/arXiv.2207.04606 arXiv:2207.04606 [cs]","DOI":"10.48550\/arXiv.2207.04606"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Tuowen Zhao Tobi Popoola Mary Hall Catherine Olschanowsky and Michelle Mills Strout. 2022. Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-Iteration. https:\/\/doi.org\/10.48550\/arXiv.2208.11858 arXiv:2208.11858 [cs]","DOI":"10.48550\/arXiv.2208.11858"},{"key":"e_1_3_2_1_60_1","unstructured":"Ningxin Zheng Bin Lin Quanlu Zhang Lingxiao Ma Yuqing Yang Fan Yang Yang Wang Mao Yang and Lidong Zhou. 2022. SparTA: Deep Learning Model Sparsity via Tensor with Sparsity Attribute. 21."}],"event":{"name":"CGO '23: 21st ACM\/IEEE International Symposium on Code Generation and Optimization","location":"Montr\u00e9al QC Canada","acronym":"CGO '23","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","SIGPLAN ACM Special Interest Group on Programming Languages","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 21st ACM\/IEEE International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579990.3580020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579990.3580020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:19Z","timestamp":1750183699000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579990.3580020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":60,"alternative-id":["10.1145\/3579990.3580020","10.1145\/3579990"],"URL":"https:\/\/doi.org\/10.1145\/3579990.3580020","relation":{},"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"2023-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}