Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Andrew, Saturday, December 15, 2007, 1:17:56 PM, you wrote: http://hackage.haskell.org/trac/ghc/wiki/Status/Nov07 Thanks for posting that. I was unaware of that link, and it was very interesting reading. +1. obviously it's made for forthcoming HCAR but wasn't announced separately --

Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Robin, Saturday, December 15, 2007, 9:54:43 PM, you wrote: you may believe in what you want. i prefer to say about real situation. if it will be possible to quickly write good Haskell compiler, it was be written many years ago No-one is writing a commercial Haskell compiler yet

Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Neil, Saturday, December 15, 2007, 10:07:54 PM, you wrote: I agree with Bulat that Haskell has, if anything, even better optimisation potential than something like C. With Haskell you can do the crazy high-level optimisations that things like C would demand really advanced

Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Don, Saturday, December 15, 2007, 10:57:02 PM, you wrote: Do you have the single loop C program, btw? I'd be curious to see if this is really feasible. It would have to do the buffering, tokenising and accumulating in one go. I'd imagine it is a bit hairy. for (int n; n = read (0, buf,

Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Don, Saturday, December 15, 2007, 11:28:00 PM, you wrote: Do you have the single loop C program, btw? I'd be curious to see if Oh, this isn't the original program, either. You need to find the longest word and print it. Not count the words. i can't understand what you mean by

Re[2]: [Haskell-cafe] #haskell works

2007-12-15 Thread Bulat Ziganshin
Hello Andrew, Sunday, December 16, 2007, 1:39:02 AM, you wrote: Takes 0.016 seconds to process a 2.4 MB file. [But not the same one Don used.] This version takes 0.005 seconds. Don, it seems to be bound by memory speed rather than quality of generated code. i suggest you to test it on fixed

Re[2]: [Haskell-cafe] #haskell works

2007-12-14 Thread Bulat Ziganshin
Hello Dan, Friday, December 14, 2007, 11:57:38 PM, you wrote: to allocate registers do exist. So I'm looking forward to the next version of GHC matching C's performance for inner loops of array manipulation code :-) with support of loop unrolling, smart register allocation, strength reducing

Re: Re[2]: [Haskell-cafe] #haskell works

2007-12-14 Thread Tim Chevalier
On 12/14/07, Bulat Ziganshin [EMAIL PROTECTED] wrote: Hello Dan, Friday, December 14, 2007, 11:57:38 PM, you wrote: to allocate registers do exist. So I'm looking forward to the next version of GHC matching C's performance for inner loops of array manipulation code :-) with support of