A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
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
fields
cs.PL 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Proposes constraint-based type inference for type-directed synthesis of polymorphic code and GADTs, implemented in the Scythe live programming tool for Haskell.
citing papers explorer
-
Optimal Predicate Pushdown Synthesis
A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
-
Constraint-Based Type-Directed Program Synthesis
Proposes constraint-based type inference for type-directed synthesis of polymorphic code and GADTs, implemented in the Scythe live programming tool for Haskell.