[Redirecting to GHC users.]
| Tom Schrijvers wrote:
| The cyclic dictionaries approach is a bit fragile. The problem appears to
| be here that GHC alternates exhaustive phases of constraint reduction and
| functional dependency improvement. The problem is that in your example you
| need both
Duncan Coutts wrote:
On Tue, 2009-03-17 at 11:09 +0100, Christian Maeder wrote:
./bootstrap.sh: !: not found
Under Solaris sh is not bash!
Indeed.
According to the OpenGroup that syntax should be fine:
http://www.opengroup.org/onlinepubs/009695399/utilities/xcu_chap02.html#tag_02_09_02
On Tue, 2009-03-17 at 21:12 -0400, Brandon S. Allbery KF8NH wrote:
On 2009 Mar 17, at 20:28, Duncan Coutts wrote:
It works for me under Solaris 10. Perhaps Solaris 9 or older do not
have a standard compliant /bin/sh program. What do you suggest we use
instead as a workaround?
For
I built ghc-6.10.1.20090314 on OS X 10.5.6 (Intel) using ghc 6.8.2 as
a bootstrap compiler. The build was done using the MacPorts
infrastructure.
Summary test results:
OVERALL SUMMARY for test run started at Tue Mar 17 15:31:38 EDT 2009
2334 total tests, which gave rise to
12487
Hello,
On Sunday 15 March 2009 16:51, Ian Lynagh wrote:
We are pleased to announce the first release candidate for GHC 6.10.2:
...
Please test as much as possible; bugs are much cheaper if we find them
before the release!
...
I have tried the Intel Mac installer and the source package on
I tried again with the same result.
Is this a known problem, or do I have investigate myself?
Colin == Colin Paul Adams co...@colina.demon.co.uk writes:
Colin I have just downloaded a darcs snapshot, pulled patches and
Colin followed the instructions at
Colin
Colin == Colin Paul Adams co...@colina.demon.co.uk writes:
Colin I tried again with the same result. Is this a known
Colin problem, or do I have investigate myself?
Colin == Colin Paul Adams co...@colina.demon.co.uk writes:
Colin I have just downloaded a darcs snapshot, pulled
Colin Paul Adams wrote:
I have just downloaded a darcs snapshot, pulled patches and followed
the instructions at
http://hackage.haskell.org/trac/ghc/wiki/Building/QuickStart
When I got to do
make
it didn't work. The tail of the output looks like this:
[55 of 55] Compiling Main (
Gregory Wright wrote:
I built ghc-6.10.1.20090314 on OS X 10.5.6 (Intel) using ghc 6.8.2 as
a bootstrap compiler. The build was done using the MacPorts
infrastructure.
Summary test results:
OVERALL SUMMARY for test run started at Tue Mar 17 15:31:38 EDT 2009
2334 total tests, which
Simon == Simon Marlow marlo...@gmail.com writes:
Simon Your problem appears to be that you have set $(GHC) to
Simon ghc --make -fno-warn-unrecognised-pragmas
Simon $(GHC) should be set to the path to GHC, nothing else.
You're right.
I was using that prior to cabalizing my other
There should be a file called testlog somewhere, either at the
toplevel or within the tests directory. Could you search for
apirecomp001 and send me the test output from running that test. I
can't reproduce this failure when running it manually even though I'm
on OS X, too.
On 18 Mar
I've just managed to build ghc 6.11 (Thanks Simon).
I did this for two reasons, one of which is I want to try to improve
the speed of the AI for the Chu Shogi program I am writing by making
use of parallel processing. I have a 4-core Xeon runing Fedora Linux
10 (AMD64).
I have a repeatable
Hello Thomas,
On Wednesday 18 March 2009 15:03, Thomas Schilling wrote:
There should be a file called testlog somewhere, either at the
toplevel or within the tests directory. Could you search for
apirecomp001 and send me the test output from running that test. I
can't reproduce this
Am Mittwoch, 18. März 2009 15:28 schrieb Colin Paul Adams:
I've just managed to build ghc 6.11 (Thanks Simon).
I did this for two reasons, one of which is I want to try to improve
the speed of the AI for the Chu Shogi program I am writing by making
use of parallel processing. I have a 4-core
Hi Thomas,
On Mar 18, 2009, at 10:03 AM, Thomas Schilling wrote:
There should be a file called testlog somewhere, either at the
toplevel or within the tests directory. Could you search for
apirecomp001 and send me the test output from running that test.
I can't reproduce this failure
On Wed, Mar 18, 2009 at 12:28:50AM +, Duncan Coutts wrote:
On Tue, 2009-03-17 at 11:09 +0100, Christian Maeder wrote:
unix = 2.0 2.4
Changing to = 2.4 was not sufficient, so I changed it to = 2.5.
This will affect any OS!
Hmm, it's a bit suspicious that the major version
Daniel == Daniel Fischer daniel.is.fisc...@web.de writes:
Daniel generate_moves_for_piece produces a list. rwhnf forces
Daniel this list enough to see if it's [] or (_:_) (rwhnf x = x
Daniel `seq` ()), that doesn't get enough work done in each
Daniel thread to compensate the
On 2009 Mar 18, at 16:34, Colin Paul Adams wrote:
The one routine that stood out was this one (about 35% CPU time, with
0% attributed to children):
-- | Value of one rank of the board
rank_value :: (Int, Array Int Square) - Int
rank_value (rank_coord, rank') = sum (map (cell_value rank_coord)
Brandon == Brandon S Allbery KF8NH allb...@ece.cmu.edu writes:
The array has 12 elements.
Brandon How many times do you call it? Perhaps the real
Brandon optimization you need is to memoize.
Very many times indeed. But it is a different array on most occasions
(I am not updating
On 2009 Mar 18, at 16:59, Colin Paul Adams wrote:
Brandon == Brandon S Allbery KF8NH allb...@ece.cmu.edu
writes:
The array has 12 elements.
Brandon How many times do you call it? Perhaps the real
Brandon optimization you need is to memoize.
Very many times indeed. But it is a
Recursion unfolding spec, 2nd attempt.
The main difference is to look at groups of mutually recursive
definitions as a whole, rather than trying to think about individual
definitions. That step actually seems sufficient to address most of
the shortcomings raised so far, such as avoiding runaway
(I am not updating in place).
The move generator produces a new board for each move.
Well, this is sound design, but current memory managers may not be up to it.
If you check the (board) game programming literature,
you'll find that engine authors take great efforts to bypass automatic
Hi Karel,
On Mon, Mar 16, 2009 at 11:26:05AM +0100, Karel Gardas wrote:
interesting but I'm not able to build this on SunOS 5.11/x86. The build
fails with:
(echo dist/build/cbits/PrelIOUtils.p_o dist/build/cbits/WCsubst.p_o
dist/build/cbits/Win32Utils.p_o dist/build/cbits/consUtils.p_o
{-# INLINE f PEEL n UNROLL m #-}
The problem here is that this only works for directly recursive
functions which I, for instance, don't normally use in high-
performance code. Most of my loops are pipelines of collective
combinators like map, filter, fold etc. because these are the ones
I've installed a GUI application based on gtk2hs.
It frequently crashes with the error:
leksah: error: a C finalizer called back into Haskell.
use Foreign.Concurrent.newForeignPtr for Haskell finalizers.
This error did never occur with the 6.10 released version. It was verified
that
25 matches
Mail list logo
