Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-08 Thread Henning Thielemann
On Thu, 6 Aug 2009, Don Stewart wrote: Someone please file a bug report, http://hackage.haskell.org/trac/ghc/newticket?type=bug Done, Don! http://hackage.haskell.org/trac/ghc/ticket/3424 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org ht

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-07 Thread Henning Thielemann
On Thu, 6 Aug 2009, Dan Weston wrote: Neil Mitchell wrote: Hi I think the issue you're running in to with 6.4 is this one: http://hackage.haskell.org/trac/ghc/ticket/830 - known and fixed a while back. No, I am using the latest released ghc: I think Neil refered to my experiences with GHC

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Don Stewart
felipe.lessa: > On Thu, Aug 06, 2009 at 04:25:07PM -0700, Dan Weston wrote: > > > ghc --version > > The Glorious Glasgow Haskell Compilation System, version 6.10.4 > > Confirmed on Gento amd64 with custom-built GHC from Haskell overlay: > > $ ghc --version > The Glorious Glasgow Haskell Compilati

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Felipe Lessa
On Thu, Aug 06, 2009 at 04:25:07PM -0700, Dan Weston wrote: > > ghc --version > The Glorious Glasgow Haskell Compilation System, version 6.10.4 Confirmed on Gento amd64 with custom-built GHC from Haskell overlay: $ ghc --version The Glorious Glasgow Haskell Compilation System, version 6.10.4 $ u

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Dan Weston
I should clarify that this was done on an older kernel (bootstrapped from ghc 6.4 as Jeff Heard suggested), in case that makes any difference: Main memory size: 7971 Mbytes 1 GenuineIntel Intel(R) Xeon(TM) CPU 3.40GHz processor Swap Size: 2047 Mbytes Num Processors: 1 Processor Type:

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Jeff Heard
Yes, the GHC compiler will work on older kernels and CentOS kernels if you bootstrap it with 6.4 On Thu, Aug 6, 2009 at 4:51 PM, Jason Dagit wrote: > > > On Thu, Aug 6, 2009 at 1:39 PM, Henning Thielemann > wrote: >> >> Today a student has shown me a program that consists of a large 'do' block >>

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Dan Weston
No, I am using the latest released ghc: > ghc --version The Glorious Glasgow Haskell Compilation System, version 6.10.4 [ z.hs is attached ] > time ghc -O0 --make z.hs [1 of 1] Compiling Main ( z.hs, z.o ) Linking z ... 14.422u 0.630s 0:15.10 99.6%0+0k 0+0io 0pf+0w > time ./z z

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Henning Thielemann
On Thu, 6 Aug 2009, Jason Dagit wrote: 'timer_create' problem. (At least, the 'cabal' executable that I generated with a GHC-6.8.2 had this problem when running on the cluster which reminded me on the problems with GHC-6.8 itself running on older Linux kernels.) I just goo

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Henning Thielemann
On Thu, 6 Aug 2009, Dan Weston wrote: I assume for the return line, you meant to return a list, not a tuple. ghc doesn't support a 600-tuple. Maybe that it was a list. In any case, returning a list, I have verified that this problem exists in ghc 6.10.3, for -O0 and -O2. For -O0, it compi

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Neil Mitchell
Hi I think the issue you're running in to with 6.4 is this one: http://hackage.haskell.org/trac/ghc/ticket/830 - known and fixed a while back. Thanks Neil On Thu, Aug 6, 2009 at 9:59 PM, Dan Weston wrote: > I assume for the return line, you meant to return a list, not a tuple. ghc > doesn't sup

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Dan Weston
I assume for the return line, you meant to return a list, not a tuple. ghc doesn't support a 600-tuple. In any case, returning a list, I have verified that this problem exists in ghc 6.10.3, for -O0 and -O2. For -O0, it compiles and links fine, but gives this runtime message: z: internal error

Re: [Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Jason Dagit
On Thu, Aug 6, 2009 at 1:39 PM, Henning Thielemann < lemm...@henning-thielemann.de> wrote: > > Today a student has shown me a program that consists of a large 'do' block > for the list monad. The program looks like > > do x1 <- [0..3] > x2 <- [0..2] > ... > x600 <- [0..5] > g

[Haskell-cafe] Hugs faster and more reliable than GHC for large list monad 'do' block

2009-08-06 Thread Henning Thielemann
Today a student has shown me a program that consists of a large 'do' block for the list monad. The program looks like do x1 <- [0..3] x2 <- [0..2] ... x600 <- [0..5] guard (x1+x2+2*x3 >= 0) ... return (x1,x2,,x600) It was actually generated by anothe