[racket] Optimizations at the library level.

On Thu, Sep 2, 2010 at 12:20 PM, Eli Barzilay <eli at barzilay.org> wrote:
> How is the haskell thing different from something like making `map' a
> macro?  One obvious difference is that IIUC you can specify these
> rules in some random library, which doesn't sound too good.

It does to me :) I think the rules can be applied at the whim of the
optimiser so 1) they don't have to reach a fixed point and 2)
execution can be interleaved with other optimisation passes (like
inlining). No macrology for map is going to inline

(let ([a (map foo a-list)])
  (map bar a))

N.