pith. sign in

Title resolution pending

If (๐‘™๐‘œ๐‘ ๐‘– โ†ฆโ†’ (projFieldLoc( K, i)๐‘™๐‘œ๐‘ 1)) โˆˆ CandM (๐‘™๐‘œ๐‘ 1) is a factored concrete root whose component structure contains(K,i, ๐‘๐‘™๐‘œ๐‘ ๐‘– ), thenM(๐‘™๐‘œ๐‘ ๐‘– )=๐‘๐‘™๐‘œ๐‘ ๐‘–

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.PL 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes

cs.PL ยท 2026-05-01 ยท unverdicted ยท novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes cs.PL ยท 2026-05-01 ยท unverdicted ยท none ยท ref 20

    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.