Expand description
Identifies common relation subexpressions and places them behind Let
bindings.
All structurally equivalent expressions, defined recursively as having
structurally equivalent inputs, and identical parameters, will be placed
behind Let bindings. The resulting expressions likely have an excess of
Let expressions, and therefore this transform is usually followed by a
NormalizeLets application.