{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T17:07:55Z","timestamp":1776013675661,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,29]]},"DOI":"10.1145\/3567512.3567528","type":"proceedings-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T21:22:55Z","timestamp":1669929775000},"page":"189-201","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Collection Skeletons: Declarative Abstractions for Data Collections"],"prefix":"10.1145","author":[{"given":"Bj\u00f6rn","family":"Franke","sequence":"first","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibo","family":"Li","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Morton","sequence":"additional","affiliation":[{"name":"Huawei, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Steuwer","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Chirag Agrawal. 2021. kruskal disjoint. https:\/\/www.geeksforgeeks.org\/kruskals-minimum-spanning-tree-using-stl-in-c\/ \t\t\t\t  Chirag Agrawal. 2021. kruskal disjoint. https:\/\/www.geeksforgeeks.org\/kruskals-minimum-spanning-tree-using-stl-in-c\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42061-5_8"},{"key":"e_1_3_2_1_3_1","unstructured":"Manish Bhojasia. 2013. joseph. https:www.sanfoundry.com\/c-program-solve-josephus-problem-using-linked-list \t\t\t\t  Manish Bhojasia. 2013. joseph. https:www.sanfoundry.com\/c-program-solve-josephus-problem-using-linked-list"},{"key":"e_1_3_2_1_4_1","volume-title":"Olden: parallelizing programs with dynamic data structures on distributed-memory machines","author":"Carlisle Martin Christopher","unstructured":"Martin Christopher Carlisle . 1996. Olden: parallelizing programs with dynamic data structures on distributed-memory machines . Princeton University . Martin Christopher Carlisle. 1996. Olden: parallelizing programs with dynamic data structures on distributed-memory machines. Princeton University."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/iiswc.2009.5306797"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3356579"},{"key":"e_1_3_2_1_7_1","unstructured":"Chris. 2020. ising benchmark. https:\/\/github.com\/compor\/mischung-suite\/blob\/master\/programs\/ising\/data\/original_source\/ising.c \t\t\t\t  Chris. 2020. ising benchmark. https:\/\/github.com\/compor\/mischung-suite\/blob\/master\/programs\/ising\/data\/original_source\/ising.c"},{"key":"e_1_3_2_1_8_1","unstructured":"Rosseta Code Contributors. 2022. Rosetta Code \u2014 Rosetta Code . https:\/\/rosettacode.org\/wiki\/Rosetta_Code [Online] \t\t\t\t  Rosseta Code Contributors. 2022. Rosetta Code \u2014 Rosetta Code . https:\/\/rosettacode.org\/wiki\/Rosetta_Code [Online]"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2032","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2001. Introduction to Algorithms ( 2 nd ed.). The MIT Press . isbn:026 2032 937 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms (2nd ed.). The MIT Press. isbn:0262032937","edition":"2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168825"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3030207.3030221"},{"key":"e_1_3_2_1_12_1","unstructured":"Diego. 2021. infix to postfix. https:\/\/github.com\/dlb04\/infix-to-postfix \t\t\t\t  Diego. 2021. infix to postfix. https:\/\/github.com\/dlb04\/infix-to-postfix"},{"key":"e_1_3_2_1_13_1","unstructured":"Jim Fisher. 2011. libactor. https:\/\/github.com\/airplug\/libactor \t\t\t\t  Jim Fisher. 2011. libactor. https:\/\/github.com\/airplug\/libactor"},{"key":"e_1_3_2_1_14_1","unstructured":"Damian Jarek. 2015. libactor. https:\/\/github.com\/djarek\/md5lamacz \t\t\t\t  Damian Jarek. 2015. libactor. https:\/\/github.com\/djarek\/md5lamacz"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.1993509"},{"key":"e_1_3_2_1_16_1","unstructured":"Chris Lattner and Lauro Venancio. 2021. simple hash benchmark. https:\/\/github.com\/llvm-mirror\/test-suite\/blob\/master\/SingleSource\/Benchmarks\/Shootout\/hash.c \t\t\t\t  Chris Lattner and Lauro Venancio. 2021. simple hash benchmark. https:\/\/github.com\/llvm-mirror\/test-suite\/blob\/master\/SingleSource\/Benchmarks\/Shootout\/hash.c"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800233.807045"},{"key":"e_1_3_2_1_18_1","unstructured":"Gustav Louw. 2020. tinn. https:\/\/github.com\/glouw\/tinn \t\t\t\t  Gustav Louw. 2020. tinn. https:\/\/github.com\/glouw\/tinn"},{"key":"e_1_3_2_1_19_1","unstructured":"Jason Marcell. 2009. scheduler. https:\/\/github.com\/jasmarc\/scheduler \t\t\t\t  Jason Marcell. 2009. scheduler. https:\/\/github.com\/jasmarc\/scheduler"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3191697.3214334"},{"key":"e_1_3_2_1_21_1","unstructured":"Maurice Naftalin and Philip Wadler. 2006. Java Generics and Collections. O\u2019Reilly. \t\t\t\t  Maurice Naftalin and Philip Wadler. 2006. Java Generics and Collections. O\u2019Reilly."},{"key":"e_1_3_2_1_22_1","unstructured":"Martin Odersky and Lex Spoon. 2019. The Architecture of Scala Collections. https:\/\/docs.scala-lang.org\/overviews\/core\/architecture-of-scala-collections.html \t\t\t\t  Martin Odersky and Lex Spoon. 2019. The Architecture of Scala Collections. https:\/\/docs.scala-lang.org\/overviews\/core\/architecture-of-scala-collections.html"},{"key":"e_1_3_2_1_23_1","unstructured":"rafa32. 2017. shor. https:\/\/github.com\/rafa32\/Quantum-Shor \t\t\t\t  rafa32. 2017. shor. https:\/\/github.com\/rafa32\/Quantum-Shor"},{"key":"e_1_3_2_1_24_1","unstructured":"Alexander Stepanov and Lee Meng. 1995. The Standard Template Library. HP Laboratories. \t\t\t\t  Alexander Stepanov and Lee Meng. 1995. The Standard Template Library. HP Laboratories."},{"key":"e_1_3_2_1_25_1","first-page":"27","article-title":"Parboil: A revised benchmark suite for scientific and commercial throughput computing","volume":"127","author":"Stratton John A","year":"2012","unstructured":"John A Stratton , Christopher Rodrigues , I- Jui Sung , Nady Obeid , Li-Wen Chang , Nasser Anssari , Geng Daniel Liu , and Wen-mei W Hwu . 2012 . Parboil: A revised benchmark suite for scientific and commercial throughput computing . Center for Reliable and High-Performance Computing , 127 (2012), 27 . John A Stratton, Christopher Rodrigues, I-Jui Sung, Nady Obeid, Li-Wen Chang, Nasser Anssari, Geng Daniel Liu, and Wen-mei W Hwu. 2012. Parboil: A revised benchmark suite for scientific and commercial throughput computing. Center for Reliable and High-Performance Computing, 127 (2012), 27.","journal-title":"Center for Reliable and High-Performance Computing"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-022-00731-8"},{"key":"e_1_3_2_1_27_1","unstructured":"Timmy Whelan. 2002. mp3. https:\/\/sourceforge.net\/projects\/mp3reorg\/files\/mp3reorg\/ \t\t\t\t  Timmy Whelan. 2002. mp3. https:\/\/sourceforge.net\/projects\/mp3reorg\/files\/mp3reorg\/"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39038-8_1"}],"event":{"name":"SLE '22: 15th ACM SIGPLAN International Conference on Software Language Engineering","location":"Auckland New Zealand","acronym":"SLE '22","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3567512.3567528","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3567512.3567528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:47Z","timestamp":1750286627000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3567512.3567528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":28,"alternative-id":["10.1145\/3567512.3567528","10.1145\/3567512"],"URL":"https:\/\/doi.org\/10.1145\/3567512.3567528","relation":{},"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"2022-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}