SoCal formalizes factored multi-buffer layouts for recursive algebraic datatypes and Colobus implements automatic transformation of functional programs to these SoA-style representations, delivering a 1.46x geometric mean speedup on tree-processing benchmarks.
In particular, the tag component yields the next constructor position in its buffer, and the field components provide the corresponding end witnesses for the non-tag buffers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes
SoCal formalizes factored multi-buffer layouts for recursive algebraic datatypes and Colobus implements automatic transformation of functional programs to these SoA-style representations, delivering a 1.46x geometric mean speedup on tree-processing benchmarks.