As part of Ian and my work on synthesizing math libraries, I've been thinking about synthesizing range reductions. I think we've found a beautiful and efficient way to do this tricky bit of synthesis using e-graphs. This idea is also related to recent Herbie work on detecting symmetric expressions. What is range reduction The core of modern library function implementation is the Remez algorithm, which approximates a function f over an interval [a, b] with polynomials.1 [1 When certain conditi...
