{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:52Z","timestamp":1750220932614,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1725672, CCF-1725679"],"award-info":[{"award-number":["CCF-1725672, CCF-1725679"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DOE","award":["DE-SC0010295"],"award-info":[{"award-number":["DE-SC0010295"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,8]]},"DOI":"10.1145\/3314221.3314631","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"48-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["LoCal: a language for programs operating on serialized data"],"prefix":"10.1145","author":[{"given":"Michael","family":"Vollmer","sequence":"first","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Chaitanya","family":"Koparkar","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Mike","family":"Rainey","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Laith","family":"Sakka","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}]},{"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}]},{"given":"Ryan R.","family":"Newton","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/615224.615226"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/245882.245905"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158093"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264249"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/301631.301633"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/301589.286865"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503223"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512563"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165854.165907"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065027"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233346"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(90)90231-O"},{"key":"e_1_3_2_2_14_1","volume-title":"Ornamental algebras, algebraic ornaments. Journal of functional programming","author":"McBride Conor","year":"2010","unstructured":"Conor McBride . 2010. Ornamental algebras, algebraic ornaments. Journal of functional programming ( 2010 ). Conor McBride. 2010. Ornamental algebras, algebraic ornaments. Journal of functional programming (2010)."},{"key":"e_1_3_2_2_15_1","unstructured":"Leo A. Meyerovich Todd Mytkowicz and Wolfram Schulte. 2011. Data Parallel Programming for Irregular Tree Computations In HotPAR. https:\/\/www.microsoft.com\/en-us\/research\/publication\/ data-parallel-programming-for-irregular-tree-computations\/  Leo A. Meyerovich Todd Mytkowicz and Wolfram Schulte. 2011. Data Parallel Programming for Irregular Tree Computations In HotPAR. https:\/\/www.microsoft.com\/en-us\/research\/publication\/ data-parallel-programming-for-irregular-tree-computations\/"},{"key":"e_1_3_2_2_16_1","unstructured":"Leo A. Meyerovich Todd Mytkowicz and Wolfram Schulte. 2011. Data Parallel Programming for Irregular Tree Computations In HotPAR. https:\/\/www.microsoft.com\/en-us\/research\/publication\/ data-parallel-programming-for-irregular-tree-computations\/  Leo A. Meyerovich Todd Mytkowicz and Wolfram Schulte. 2011. Data Parallel Programming for Irregular Tree Computations In HotPAR. https:\/\/www.microsoft.com\/en-us\/research\/publication\/ data-parallel-programming-for-irregular-tree-computations\/"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268954"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213866"},{"key":"e_1_3_2_2_19_1","volume-title":"Symposium on Networked Systems Design and Implementation (NSDI\u201909)","author":"Newton Ryan R.","year":"2009","unstructured":"Ryan R. Newton , Sivan Toledo , Lewis Girod , Hari Balakrishnan , and Samuel Madden . 2009 . Wishbone: Profile-based partitioning for sensornet applications . In Symposium on Networked Systems Design and Implementation (NSDI\u201909) . USENIX Association, 395\u2013408. Ryan R. Newton, Sivan Toledo, Lewis Girod, Hari Balakrishnan, and Samuel Madden. 2009. Wishbone: Profile-based partitioning for sensornet applications. In Symposium on Networked Systems Design and Implementation (NSDI\u201909). USENIX Association, 395\u2013408."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6494989"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2632215"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3122948.3122949"},{"key":"e_1_3_2_2_23_1","volume-title":"Amarasinghe","author":"Thies William","year":"2002","unstructured":"William Thies , Michal Karczmarek , and Saman P . Amarasinghe . 2002 . StreamIt: A Language for Streaming Applications. In International Conference on Compiler Construction. Springer-Verlag . William Thies, Michal Karczmarek, and Saman P. Amarasinghe. 2002. StreamIt: A Language for Streaming Applications. In International Conference on Compiler Construction. Springer-Verlag."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:LISP.0000029446.78563.a4"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2613"},{"volume-title":"Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT \u201998)","author":"Truong D. N.","key":"e_1_3_2_2_26_1","unstructured":"D. N. Truong , F. Bodin , and A. Seznec . 1998. Improving Cache Behavior of Dynamically Allocated Data Structures . In Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT \u201998) . IEEE Computer Society, Washington, DC, USA, 322\u2013. http:\/\/portal.acm.org\/citation.cfm?id=522344.825680 D. N. Truong, F. Bodin, and A. Seznec. 1998. Improving Cache Behavior of Dynamically Allocated Data Structures. In Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT \u201998). IEEE Computer Society, Washington, DC, USA, 322\u2013. http:\/\/portal.acm.org\/citation.cfm?id=522344.825680"},{"key":"e_1_3_2_2_27_1","unstructured":"Kenton Varda. 2015. Cap\u2019n Proto. https:\/\/capnproto.org\/  Kenton Varda. 2015. Cap\u2019n Proto. https:\/\/capnproto.org\/"},{"key":"e_1_3_2_2_28_1","volume-title":"Newton","author":"Vollmer Michael","year":"2019","unstructured":"Michael Vollmer , Chaitanya Koparkar , Mike Rainey , Laith Sakka , Milind Kulkarni , and Ryan R . Newton . 2019 . LoCal: A Language for Programs Operating on Serialized Data. Technical Report. Indiana University . https:\/\/help.sice.indiana.edu\/techreports\/TRNNN.cgi? trnum=TR741 . Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni, and Ryan R. Newton. 2019. LoCal: A Language for Programs Operating on Serialized Data. Technical Report. Indiana University. https:\/\/help.sice.indiana.edu\/techreports\/TRNNN.cgi? trnum=TR741 ."},{"key":"e_1_3_2_2_29_1","volume-title":"31st European Conference on Object-Oriented Programming (ECOOP 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Peter M\u00fcller (Ed.)","volume":"74","author":"Vollmer Michael","unstructured":"Michael Vollmer , Sarah Spall , Buddhika Chamith , Laith Sakka , Chaitanya Koparkar , Milind Kulkarni , Sam Tobin-Hochstadt , and Ryan R. Newton . 2017. Compiling Tree Transforms to Operate on Packed Representations . In 31st European Conference on Object-Oriented Programming (ECOOP 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Peter M\u00fcller (Ed.) , Vol. 74 . Schloss Dagstuhl\u2013LeibnizZentrum fuer Informatik, Dagstuhl, Germany, 26:1\u201326:29. Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, and Ryan R. Newton. 2017. Compiling Tree Transforms to Operate on Packed Representations. In 31st European Conference on Object-Oriented Programming (ECOOP 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Peter M\u00fcller (Ed.), Vol. 74. Schloss Dagstuhl\u2013LeibnizZentrum fuer Informatik, Dagstuhl, Germany, 26:1\u201326:29."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/645387.651542"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158109"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784735"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Phoenix AZ USA","acronym":"PLDI '19"},"container-title":["Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314631","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:22Z","timestamp":1750204402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":32,"alternative-id":["10.1145\/3314221.3314631","10.1145\/3314221"],"URL":"https:\/\/doi.org\/10.1145\/3314221.3314631","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}