<br><br><div class="gmail_quote">On Sat, Feb 21, 2009 at 11:35 PM, Bulat Ziganshin <span dir="ltr">&lt;<a href="mailto:bulat.ziganshin@gmail.com">bulat.ziganshin@gmail.com</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Hello Louis,<br>
<br>
Sunday, February 22, 2009, 2:30:23 AM, you wrote:<br>
<br>
yes, you are right. Don also compared results of 64x-reduced<br>
computation with full one. are you think that these results are more<br>
fair?</blockquote><div><br></div><div>Yes. Clearly so.</div><div>It still computes the result from scratch - it just uses a trick which generates better code. This is clearly a useful and worthwhile exercise as it shows A) A neat trick with TH, B) A reasonably practical way to produce fast code for the critical parts of a Haskell app, C) a motivating example for implementing a compiler optimization to do it automatically.</div>
<div><br></div><div>Just outputting the precomputed result means nothing.</div><div><br></div><div><br></div><div><br></div></div>-- <br>Sebastian Sylvan<br>+44(0)7857-300802<br>UIN: 44640862<br>