Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-15 Thread Isaac Dupree
Dave Bayer wrote: The code is very fast for its size; I haven't seen Haskell code posted on the web that comes close, and it is faster than any of my other tries (I posted this code to http://www.haskell.org/haskellwiki/Prime_numbers). Effectively, it steals a heap data structure out of thin a

Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-10 Thread Janis Voigtlaender
Jonathan Cast wrote: On Tuesday 10 July 2007, Dave Bayer wrote: On Jul 9, 2007, at 6:52 PM, Donald Bruce Stewart wrote: bayer: Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting the implementation of lazy evaluation to avoid explicitly writing an efficient concatenable li

Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-09 Thread Jonathan Cast
On Tuesday 10 July 2007, Dave Bayer wrote: > On Jul 9, 2007, at 6:52 PM, Donald Bruce Stewart wrote: > > bayer: > >> Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting > >> the implementation of lazy evaluation to avoid explicitly writing an > >> efficient concatenable list data

Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-09 Thread Dave Bayer
On Jul 9, 2007, at 6:52 PM, Donald Bruce Stewart wrote: bayer: Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting the implementation of lazy evaluation to avoid explicitly writing an efficient concatenable list data structure. See also http://hackage.haskell.org/cgi-b

Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-09 Thread Donald Bruce Stewart
bayer: > Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting > the implementation of lazy evaluation to avoid explicitly writing an > efficient concatenable list data structure. This felt like cheating, > or at least like using a screwdriver as a crowbar, to be less > judg

Re: [Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-09 Thread Jonathan Cast
On Monday 09 July 2007, Dave Bayer wrote: > Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting > the implementation of lazy evaluation to avoid explicitly writing an > efficient concatenable list data structure. This felt like cheating, > or at least like using a screwdriver as a

[Haskell-cafe] "no-coding" functional data structures via lazyness

2007-07-09 Thread Dave Bayer
Learning Haskell, the Prelude.ShowS type stood out as odd, exploiting the implementation of lazy evaluation to avoid explicitly writing an efficient concatenable list data structure. This felt like cheating, or at least like using a screwdriver as a crowbar, to be less judgmental. Recentl