 Making Haskell programs faster and smaller
started 8/23/2002; 4:44:52 AM - last post 8/28/2002; 2:50:34 AM
|
|
Ehud Lamm - Making Haskell programs faster and smaller 
8/23/2002; 4:44:52 AM (reads: 2415, responses: 4)
|
|
|
|
Noel Welsh - Re: Making Haskell programs faster and smaller
8/23/2002; 5:06:08 AM (reads: 723, responses: 2)
|
|
|
Interestingly, in processing large data sets I've found laziness to be a good thing, most especially when the data is larger than main memory. Probably lazily reading data and then processing it in a strict fashion is optimal
|
|
Ehud Lamm - Re: Making Haskell programs faster and smaller
8/23/2002; 5:23:24 AM (reads: 782, responses: 1)
|
|
|
lazily reading data and then processing it in a strict fashion is optimal
Right. I remember we had a posting here showing Python code that used a generator to achieve exactly this.
|
|
Ehud Lamm - Re: Making Haskell programs faster and smaller
8/24/2002; 2:55:08 AM (reads: 769, responses: 0)
|
|
|
|
Dan Shappir - Re: Making Haskell programs faster and smaller
8/28/2002; 2:50:34 AM (reads: 591, responses: 0)
|
|
I just notice that one of the new features of Perl6 pattern matching is lazy matching from an input stream!
Which is also a feature of BeyondJS
|
|
|
|