RE: can a lazy language give fast code?

2002-07-29 Thread Simon Marlow
Can one write withthe Haskell compliler faster code than in the examples of http://www.bagley.org/~doug/shootout/ where GHC (old Haskell 98?) seems to be much slower than Ocaml or Mlton both strict functional languages. Can one expect any improvements in speed in the future? Many of

Infix expressions

2002-07-29 Thread Ken Shan
Hello, In Haskell, backquotes can be used to convert individual identifiers into infix operators, but not complex expressions. For example, [1,2,3] `zip` [4,5,6] is OK, but not [1,2,3] `zipWith (+)` [4,5,6] Is there any reason other than potential confusion when one of the two

Re: Infix expressions

2002-07-29 Thread Hal Daume III
Is there any reason other than potential confusion when one of the two backquotes is accidentally omitted? I thought about this a while ago and I think it probably simply has to do with complexity of expressions. If you allow arbitrary expressions to appear within the ticks, you have a

Re: Infix expressions

2002-07-29 Thread Jon Fairbairn
Ken Shan [EMAIL PROTECTED] wrote: In Haskell, backquotes can be used to convert individual identifiers into infix operators, but not complex expressions. For example, [1,2,3] `zip` [4,5,6] is OK, but not [1,2,3] `zipWith (+)` [4,5,6] Is there any reason other than potential

Re: can a lazy language give fast code?

2002-07-29 Thread Scott J.
What I also meant but did not write was this: is there anyone who would like to redo these benchmarks and see what it gives with all the new inventions the DHC supports? Cheers Scott - Original Message - From: Simon Marlow [EMAIL PROTECTED] To: Scott J. [EMAIL PROTECTED]; [EMAIL