3 ms·
> They won't find new equivalences on their own though. From Tate et al 2009: Better yet, because optimizations are allowed to freely interact during equality
by UncleEntity 6y ago
> They won't find new equivalences on their own though.
From Tate et al 2009:
Better yet, because optimizations are allowed to freely interact during equality saturation, without any consideration for ordering, our approach can discover intricate optimization opportunities that compiler writers may not have anticipated, and hence would not have implemented in a general purpose compiler.
- webmaven 6y ago> > They won't find new equivalences on their own though. > From Tate et al 2009: > Better yet, because optimizations are allowed to freely interact during equality saturation, without any consideration for ordering, our approach can discover intricate optimization opportunities that compiler writers may not have anticipated, and hence would not have implemented in a general purpose compiler. That's not finding new equivalences, it is finding known equivalences that are nested or composed. I suppose you could look at it as a form of unobfuscating the equivalences.