What&#39;s the chance you have generational graphs for the rest of your examples like you do with the first? I&#39;d be interested to see those.<br><br><div class="gmail_quote">On Mon, Mar 1, 2010 at 3:02 AM, Don Stewart <span dir="ltr">&lt;<a href="mailto:dons@galois.com">dons@galois.com</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><br>
<a href="http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/" target="_blank">http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/</a><br>
<br>
… In which I use genetic algorithms to search for optimal LLVM optimizer<br>
passes to make Haskell programs faster …<br>
<br>
LLVM + GHC is a lot of fun.<br>
<br>
-- Don<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</blockquote></div><br>