SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes
Date:
Poster on SoCal, a typed language for factored, multi-buffer (SoA-like) layouts of serialized recursive datatypes, and Colobus, a compiler from a strict Haskell subset through SoCal to C. Colobus is faster than Gibbon on 77 of 79 fold passes and 28 of 29 map passes, by 3.9x and 5.2x in geometric mean. Poster available here.
