- Glasgow-haskell-users

haddock and associated data families
by Christian Höner zu Siederdissen 03 Oct '10

03 Oct '10

Hi, haddock seems to produce an error on associated data family decls.: http://hackage.haskell.org/packages/archive/PrimitiveArray/0.0.2.1/logs/fai… line 22, where the errors occurs is exactly this one: class PrimArrayOps a b where data PrimArray a b :: * -- ^ PrimArray data type I'll fix it by trying other methods to put comments there. Could someone enter this as a bug, if it is not done yet? (Assuming it is a bug ;-) Thanks, Christian

3 2

Re: Cabal constraint solver
by Christian Höner zu Siederdissen 03 Oct '10

03 Oct '10

Hi, thanks to you all for the answers. I will then go with increasing the version number for testing, this seems to be the easiest way to go. And indeed, 'cabal unpack' fetches ( ;-) ) the package without checking that constraints are met. Gruss, Christian * Christian Höner zu Siederdissen <choener(a)tbi.univie.ac.at> [03.10.2010 00:07]: > Hi, > > does the Cabal constraint solver always try to solve the complete graph? > > example: (ghc-7.0.0-rc1) > > $ cabal install parsec-3.1.0 > cabal: cannot configure syb-0.2.1. It requires base >=4.0 && <4.3 > > cd syb-0.2.1 > * remove base<4.3 constraint from syb.cabal > cabal install > * syb-0.2.1 is now installed and works! > > $ cabal install parsec-3.1.0 > cabal: cannot configure syb-0.2.1. It requires base >=4.0 && <4.3 > > > > This is rather annoying: the constraint is solved (eg. syb is installed) > but we /still/ assume that we can not continue. So obviously, I would > like to be able to have cabal assume constraints fullfilled if the > package is installed. > > Am I missing something? (Otherwise, testing packages with 7-rc1 is > becoming annoying as almost everything depends on syb) > > === > > And a second thing: cabal fetch > How does one disable the solver for fetching packages? It is a bit > annoying (here too) that 'cabal fetch parsec-3.1.0' fails. (It should > maybe warn that constraints can not be fulfilled but the idea here is to > get the packages to change them manually) > > === > > So did I miss anything or can I write a bug report? ;-) > > > > Gruss, > Christian > > _______________________________________________ > Glasgow-haskell-users mailing list > Glasgow-haskell-users(a)haskell.org > http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

1 0

Parallel build broken
by Florian Weimer 30 Sep '10

30 Sep '10

<http://hackage.haskell.org/trac/ghc/wiki/Building/Hacking> says that parallel builds are supported, but this doesn't seem to be true anymore. This is a bit unfortunate because in theory, builds should parallelize quite well.

2 2

GHC 7.0.1 rc1: Could not deduce (Typeable a) from the context (Typeable a, …)
by Malte Sommerkorn 30 Sep '10

30 Sep '10

While compile failures were easy to fix for syb, X11 and xmonad, here's a more mysterious encounter with xmonad-contrib. The module in question is http://code.haskell.org/XMonadContrib/XMonad/Layout/MultiToggle.hs and the rest of this mail is the error: XMonad/Layout/MultiToggle.hs:194:30: Could not deduce (Typeable a) from the context (Typeable a, Show ts, HList ts a, LayoutClass l a) arising from a use of `fromMessage' Possible fix: add (Typeable a) to the context of the instance declaration In a stmt of a pattern guard for an equation for `handleMessage': Just (Toggle t) <- fromMessage m In an equation for `handleMessage': handleMessage mt m | Just (Toggle t) <- fromMessage m, i@(Just _) <- find (transformers mt) t = case currLayout mt of { EL l det -> do { l' <- fromMaybe l `fmap` handleMessage l (SomeMessage ReleaseResources); .... } where cur = (i == currIndex mt) } | otherwise = case currLayout mt of { EL l det -> fmap (fmap (\ x -> mt {currLayout = EL x det})) $ handleMessage l m } In the instance declaration for `LayoutClass (MultiToggle ts l) a' XMonad/Layout/MultiToggle.hs:195:25: Could not deduce (HList ts a) from the context (Typeable a, Show ts, HList ts a, LayoutClass l a, Transformer t a) arising from a use of `find' Possible fix: add (HList ts a) to the context of the data constructor `Toggle' or the instance declaration In a stmt of a pattern guard for an equation for `handleMessage': i@(Just _) <- find (transformers mt) t In a stmt of a pattern guard for an equation for `handleMessage': Just (Toggle t) <- fromMessage m In an equation for `handleMessage': handleMessage mt m | Just (Toggle t) <- fromMessage m, i@(Just _) <- find (transformers mt) t = case currLayout mt of { EL l det -> do { l' <- fromMaybe l `fmap` handleMessage l (SomeMessage ReleaseResources); .... } where cur = (i == currIndex mt) } | otherwise = case currLayout mt of { EL l det -> fmap (fmap (\ x -> mt {currLayout = EL x det})) $ handleMessage l m }

2 3

report on 7.01-pre
by Serge D. Mechveliani 30 Sep '10

30 Sep '10

Dear GHC developers, http://botik.ru/pub/local/Mechveliani/ghcBugs/ghc701preBug.zip contains a bug report on ghc-7.0.0.20100924 tested on Debian Linux, i386-family. Its essence is as follows. At the fragment of --------------------------------------------------------------------- instance (LinSolvRing (Pol a), CommutativeRing a) => -- (1) LinSolvRing (UPol (Pol a)) where gxBasis [] = ([], []) gxBasis fs@(f:_) = let UPol _ p y dP = f (o, n) = (pPPO p, genericLength $ pVars p) (toLex, fromLex) = (reordPol $ lexPPO n, reordPol o) p' = toLex p dP' = upLinSolvRing p' Map.empty s' = cToUPol y dP' p' ... --------------------------------------------------------------------- in the module Pol3_.hs, ghc-7.0.0.20100924 reports that the line of `s' =' needs (EuclideanRing a) and that it cannot deduce it. ghc-6.12.2 compiles this in a correct way: (EuclideanRing a) is not necessary here, while the context (1) is more generic and sufficient. For example, for a = DirectSum Integer Integer, `a' has the instances (1) and has not the instance of Euclidean, and the above code must work. This is the idea of the author of the application; this idea is supported by ghc-6.12.2 and not supported by ghc-7.0.0.20100924. There are the two questions. 1) Whether this intention with instances is correct in the meaning of Haskell + ghcExt (I hope, it is correct, at least, ghc-6.12.2 accepts it). 2) If it is correct, why ghc-7.0.0.20100924 requires (Euclidean a) ? Notices ------- a) This application uses multiparametric classes and overlapping instances (see docon.cabal for language and other options). b) The example code can be reduced further, many times. But I may have time to reduce it maybe only in the middle of December 2010. Regards, ----------------- Serge Mechveliani mechvel(a)botik.ru

1 0

testing 7.01-pre
by Serge D. Mechveliani 30 Sep '10

30 Sep '10

Dear GHC developers, I have tested ghc-7.0.0.20100924 on Debian Linux, i386-family on making it by ghc-6.12.3, on the DoCon test, -- with skipping profiling. There are visible the following changes in GHC: (1) Usage of ./Main +RTS .. -RTS needs linking with -rtsopts (2) ghc-6.12.2 compiles docon-2.11 (download it via http://haskell.org/ghc/docon/ and follow install.txt ) and ghc-7.0.0.20100924 cannot. It declares ... DPair.hs:316:35: Couldn't match type `b' with `a' `b' is a rigid type variable bound by the instance declaration at DPair.hs:222:38 `a' is a rigid type variable bound by the instance declaration at DPair.hs:222:23 In the first argument of `restore', namely `zrB' In the expression: restore zrB bs qB' In an equation for `qB': qB = restore zrB bs qB' (3) I also tried docon-2.12 (which differs very slightly from docon-2.11 and which I can provide if asked). ghc-6.12.3 makes it and runs the test successfully. Compiling it by ghc-7.0.0.20100924 stops (close to end) at Pol3_.hs at the fragment of --------------------------------------------------------------------- instance (LinSolvRing (Pol a), CommutativeRing a) => LinSolvRing (UPol (Pol a)) where gxBasis [] = ([], []) gxBasis fs@(f:_) = let UPol _ p y dP = f (o, n) = (pPPO p, genericLength $ pVars p) (toLex, fromLex) = (reordPol $ lexPPO n, reordPol o) p' = toLex p dP' = upLinSolvRing p' Map.empty s' = cToUPol y dP' p' ... ---------------------------------------------------------------- It declares that the line of `s' =' needs (EuclideanRing a) and that it cannot deduce it. I think, for the need of this particular application it is indeed better to change the context to `EuclideanRing a =>' (probably, the initial complicated context was forced by old GHC). After changing it to `EuclideanRing a =>', ghc-7.0.0.20100924 makes docon-2.12 and runs the test successfully. You see, the points (2) and (3) present a certain question about the compler. I wonder wich complier is more correct. (Recall also that Docon uses an extension with overlapping instances, multiparametric classes, and such). (4) At the docon-2.12 test made under -O, ghc-7.0.0.20100924 shows the time 3.9 sec instead of 3.3 sec of ghc-6.12.3. Regards, ----------------- Serge Mechveliani mechvel(a)botik.ru

2 2

Hashcode for reference
by Mathieu Giorgino 29 Sep '10

29 Sep '10

Hi all, I'm wondering if there is a way to get an hashcode from references (IORef or STRef)? I have looked in the library and a little in the sources of GHC but haven't found anything allowing to do this. I'm generating Haskell code from the Isabelle/HOL proof assistant, which generate "generic" code for other langages too which all have this notion, and I would so need an equivalent in Haskell. Have you any hint on how to achieve this, or even if it is possible? Mathieu

3 2

how to terminate an external program after timeout?
by Christian Maeder 29 Sep '10

29 Sep '10

Hi, we call from our haskell application the metis prover via System.Process.readProcessWithExitCode "metis" filename "" However, we are not able to get rid of this process if metis does not terminate by itself. In particular, wrapping this call into a System.Timeout.timeout does not work. Any suggestions how we should handle this ideally portably but first of all under unix. (ghc-6.12.3) Thanks Christian

6 11

DPH, granularity, and GPUs
by Vivian McPhail 29 Sep '10

29 Sep '10

Hello, DPH seems to build parallel vectors at the level of scalar elements (doubles, say). Is this a design decision aimed at targettiing GPUs? If I am filtering an hour's worth of multichannel data (an array of (Vector Double)) then off the top of my head I would think that the optimal efficiency would be achieved on n cpu cores with each core filtering one channel, rather than trying to do anything fancy with processing vectors in parallel. I say this because filters (which could be assembled from arrow structures) feedback across (regions of) a vector. Do GPUs have some sort of shift operation optimisation? In other words, if I have a (constant) matrix A, my filter, and a datastream, x, where x_i(t+1) = x_{i-1}(t), can a GPU perform Ax in O(length(x))? Otherwise, given the cost of moving data to and from the GPU, I would guess that one sequential algorithm per core is faster (Concurrent Haskell) and that there is a granularity barrier. Cheers, Vivian

1 0

Version 7.0.1-rc1 bootstrapping
by David Fox 28 Sep '10

28 Sep '10

In order to bootstrap with the compiler we are using, I had to rename the function at line 13 of compiler/utils/Exception.hs from mask_ to mask. Sorry I didn't reply to the announcement, I just found out I wasn't subscribed to this list. (I also had to change <613 to <614, but this won't affect many people.)

4 4