> try to compute their length<br><br>Yes ^^, that's silly.<br><br>> I don't see any reason why using multiple infinite lists would have anything to do with the performance<br><br>That's comforting. Well, it seems to be a very simple, haskellish and elegant solution, so basic pragmatism -- with an slice of pessimism -- tells it was too good too be true ^^.<br>
<br><div class="gmail_quote">2010/12/15 Brent Yorgey <span dir="ltr"><<a href="mailto:byorgey@seas.upenn.edu">byorgey@seas.upenn.edu</a>></span><br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
On Wed, Dec 15, 2010 at 02:52:11PM +0100, Yves Parès wrote:<br>
> Hello Café,<br>
<div class="im">><br>
> So is it viable or would the use of multiple infinite lists kill the<br>
> performances?<br>
<br>
</div>Sounds perfectly reasonable to me. I don't see any reason why using<br>
multiple infinite lists would have anything to do with the performance<br>
of your program -- unless you do something silly like try to compute<br>
their length. =)<br>
<br>
-Brent<br>
<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>