bosity
mysqlConfigProgram (withPrograms lbi)
obviously the new cabal version makes a difference between
"requireProgram" and "requireProgramVersion"
On Thu, Feb 25, 2010 at 08:01:34PM +0100, Thomas Girod wrote:
> Hi there. Looks like hdbc-mysql cannot compile against GHC-6.12 --
> con
Hi there. Looks like hdbc-mysql cannot compile against GHC-6.12 --
confirmed by the hackage build logs. [1]
anyone know a way to dodge the problem ?
cheers,
Tom
[1]
http://hackage.haskell.org/packages/archive/HDBC-mysql/0.6/logs/failure/ghc-6.12
___
Isn't it the kind of things Data Parallel Haskell is achieving ? I'm in
no way an expert of the field, but from what I've read on the subject it
looked like :
I have a list of N elements and I want to map the function F on it.
technically, I could spawn N processes and build the result from that,
thanks Lars and Max. It did the trick, except for one small detail :
MissingH needs the "testpack -any" dependency, but cabal does not
install it automatically.
tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/
Hi there.
I'm trying to reinstall gitit after updating to ghc 6.12 and it's
driving me crazy. I hope you will be able to help me troubleshoot this
mess ... I'm starting from scratch again, using cabal. I will
post more problems as they appears.
$ cabal install gitit
Resolving dependencies...
cab
Hi there. Following this advice
(http://reddit.com/info/6hknz/comments/c03vdc7), I'm posting here.
Recently, I read a few articles about Haskell (and FP in general) and
music/sound.
I remember an article ranting about how lazy evaluation would be great
to do signal processing, but it was la
Hi there.
Let's say I have mathematical model composed of several differential
equations, such as :
di/dt = cos(i)
dc/dt = alpha * (i(t) - c(t))
(sorry my maths are really bad, but I hope you get the point)
I would like to approximate the evolution of such a system iteratively. How
would you do
ff open doors (I guess this doesn't mean
anything in english but it sounds cool) ...
Regards
Thomas Girod
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi there.
recently I was trying to represent complex data by defining several
datatypes and nesting them, such as
data Foo = Foo { foo :: Bar }
deriving (Eq,Show)
data Bar = Bar { bar :: Int }
deriving (Eq,Show)
To change only a part of the data, syntactic sugar is quite convenient. But
Hi there.
I'm trying to define a generic graph type here and don't understand on one
error I get. Here I come.
module Graph
where
class (Eq n, Eq e) => Topo a n e where
empty:: a
nodes:: a -> [n]
edges:: a -> [e]
data Node n = Node n
deriving (Eq,Show)
data Edg
10 matches
Mail list logo