A compiler automatically derives pruning and inclusion conditions for tree traversals, enabling generated filters, reductions, and non-equijoins that match expert-written code.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
EggMind automates EqSat strategy synthesis via LLMs and EqSatL, cutting final cost 45.1% and peak RAM 69.1% versus full equality saturation on vectorization benchmarks while transferring to tensor compilers.
citing papers explorer
-
Bonsai: Compiling Queries to Pruned Tree Traversals
A compiler automatically derives pruning and inclusion conditions for tree traversals, enabling generated filters, reductions, and non-equijoins that match expert-written code.
-
LLM-Guided Strategy Synthesis for Scalable Equality Saturation
EggMind automates EqSat strategy synthesis via LLMs and EqSatL, cutting final cost 45.1% and peak RAM 69.1% versus full equality saturation on vectorization benchmarks while transferring to tensor compilers.