@InProceedings{singhal_et_al:LIPIcs.ECOOP.2024.38,
author = {Singhal, Vidush and Koparkar, Chaitanya and Zullo, Joseph and Pelenitsyn, Artem and Vollmer, Michael and Rainey, Mike and Newton, Ryan and Kulkarni, Milind},
title = {{Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms \{+\} Data Layouts \{=\} Efficient Programs}},
booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)},
pages = {38:1--38:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-341-6},
ISSN = {1868-8969},
year = {2024},
volume = {313},
editor = {Aldrich, Jonathan and Salvaneschi, Guido},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.38},
URN = {urn:nbn:de:0030-drops-208875},
doi = {10.4230/LIPIcs.ECOOP.2024.38},
annote = {Keywords: Tree traversals, Compilers, Data layout optimization, Dense data layout}
}