{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:24Z","timestamp":1750306284082,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"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":[[2016,4,4]]},"DOI":"10.1145\/2851613.2851732","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T19:23:42Z","timestamp":1464895422000},"page":"1798-1805","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing record data structures in Racket"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Pape","sequence":"first","affiliation":[{"name":"Universtiy of Potsdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasily","family":"Kirilichev","sequence":"additional","affiliation":[{"name":"Universtiy of Potsdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Hirschfeld","sequence":"additional","affiliation":[{"name":"Universtiy of Potsdam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297081.1297091"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646159.680023"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784740"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1565824.1565827"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509531"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89275-5_7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1836089.1836102"},{"key":"e_1_3_2_1_8_1","volume-title":"Workshop on Dynamic Languages and Applications.","author":"Bolz C. F.","year":"2014","unstructured":"C. F. Bolz, T. Pape, J. Siek, and S. Tobin-Hochstadt. \"Metatracing makes a fast Racket\". In: Workshop on Dynamic Languages and Applications. 2014."},{"key":"e_1_3_2_1_9_1","volume-title":"Scheme and Functional Programming Workshop.","author":"C\u00e9rat B.","year":"2014","unstructured":"B. C\u00e9rat and M. Feeley. \"Structure Vectors and their Implementation\". In: Scheme and Functional Programming Workshop. 2014."},{"key":"e_1_3_2_1_10_1","volume-title":"Cambridge","author":"Davison A. C.","year":"1997","unstructured":"A. C. Davison and D. V. Hinkley. In: Bootstrap Methods and Their Application. Cambridge, 1997. Chap. 5."},{"key":"e_1_3_2_1_11_1","volume-title":"Control Operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen M.","year":"1986","unstructured":"M. Felleisen and D. P. Friedman. Control Operators, the SECD-machine, and the \u03bb-calculus. Indiana University, Computer Science Department, 1986."},{"key":"e_1_3_2_1_12_1","volume-title":"Tech. rep. PLT-TR-2010-1","author":"Flatt M.","year":"2010","unstructured":"M. Flatt. Reference: Racket. Tech. rep. PLT-TR-2010-1. PLT Design Inc., 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11924661_17"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/263700.263754"},{"key":"e_1_3_2_1_15_1","article-title":"A run-time representation of scheme record types","volume":"24","author":"Keep A. W.","unstructured":"A. W. Keep and R. Dybvig. \"A run-time representation of scheme record types\". In: J Funct Program 24 (Special Issue 06 2014), pp. 675--716.","journal-title":"J Funct Program"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/501881"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/997482"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695837"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176617.1176753"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010035624696"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660197"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2647508.2647517"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509578.2509581"}],"event":{"name":"SAC 2016: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Pisa Italy","acronym":"SAC 2016"},"container-title":["Proceedings of the 31st Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851613.2851732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:56Z","timestamp":1750221536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":23,"alternative-id":["10.1145\/2851613.2851732","10.1145\/2851613"],"URL":"https:\/\/doi.org\/10.1145\/2851613.2851732","relation":{},"subject":[],"published":{"date-parts":[[2016,4,4]]},"assertion":[{"value":"2016-04-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}