urations
> was basically non-terminating without special effort. I was going to
> make a routine to compute the minimum depth given any particular
> primitive, then removed any primitive from consideration if the
> minimum depth put me over the maximum depth for the individual.
&g
Hi Jonathan,
On 21 Sep 2011, at 22:41, Jonathan Frywater wrote:
> How does one go about getting an account?
> I sent an email to the address provided at
> http://hackage.haskell.org/packages/accounts.html but haven't received any
> response yet.
> Since it's been over 3 weeks, I decided to try
Hello,
I'm proud to announce the v1.0 release of GA [1], my library for working with
genetic algorithms in Haskell.
Source repo is available on github. [2]
This is a major version bump compared to the previous v0.2 release, because the
library is pretty mature now in my view.
Major features:
Hi,
The links to the supposedly brilliant Template Haskell tutorials by Bulat are
broken.
http://www.haskell.org/bz/thdoc.htm
http://www.haskell.org/bz/th3.htm
Does anyone know if these tutorials moved to somewhere else?
greetings,
Kenneth___
Haske
ke the runtime clean up the mess the
function made).
Of course this assumes performGC to be called before using "benchmark".
Note: MicroBench was doing something similar, but was using mapM_
instead,
which no longer seems to fool GHC into evaluating the function n
times. mapM
does see
On May 19, 2009, at 13:24 , Daniel Schüssler wrote:
Hello!
On Monday 18 May 2009 14:37:51 Kenneth Hoste wrote:
I'm mostly interested in the range 10D to 100D
is the dimension known at compile-time? Then you could consider
Template
Haskell.
In general, no. :-)
It will be know
I posted earlier yield the desired
result?
Yes. Note that the original poster also reported slowdown from
use of 'dist_fast_inlined'.
Don, you were defining dist inside the main module, while in our
case the dist functions are defined in a seperate Dist.hs module...
Would that matter?
p body is ridiculously small, so it would make sense to
unroll it somewhat to help avoid the loop overhead.
However, it seems like GHC isn't able to do that now.
Is there any way to unroll the loop myself, to speed things up?
Seems hard, because I'm using uvector...
K.
--
Ken
will allow me to come up with a more easy to maintain code base.
However,
I don't want to pay a huge price for this in terms of performance.
greetings,
Kenneth
[1] MicroBench:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/microbench
--
Kenneth Hoste
Paris r
the IntMap and the UArray data types is just way
too big with 480k different keys...
I never looked into it thoroughly, but if you look at the definition
of IntMap, each key causes several words
of overhead, along with one word or so for each UArray.
K.
--
Kenneth Hoste
Paris research group
814 MB used
This is better memory usage, respect to:
real 7m17.853s
user 3m38.506s
sys0m7.612s
1586 MB used
However, Kenneth Hoste reported (http://boegel.kejo.be/):
26 minutes, with 700 MB used.
Maybe he was using the latest GHC version.
I would also like to check how performa
On Feb 26, 2009, at 13:00 , Manlio Perillo wrote:
Kenneth Hoste ha scritto:
Hello,
I'm having a go at the Netflix Prize using Haskell. Yes, I'm brave.
[...]
To see if I could efficiently represent the data set in this way, I
wrote a small
Haskell program (attached) which uses the
On Feb 23, 2009, at 19:57 , Don Stewart wrote:
bos:
2009/2/23 Kenneth Hoste
Does anyone know why the Word8 version is not significantly
better in terms
of memory usage?
Yes, because there's a typo on line 413 of Data/Array/Vector/Prim/
BUArr.hs.
How's that f
can be followed at http://boegel.kejo.be.
--
Kenneth Hoste
ELIS - Ghent University
email: kenneth.ho...@elis.ugent.be
blog: http://www.elis.ugent.be/~kehoste/blog
website: http://www.elis.ugent.be/~kehoste
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
is vital (Aaron Levenstein)
Kenneth Hoste
ELIS - Ghent University
[EMAIL PROTECTED]
http://www.elis.ugent.be/~kehoste
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
nterested in such a thing though, we might join to make this a
succes. I'm not LLVM expert, and surely no Haskell expert either, but
I think such a project can be pretty interesting.
greetings,
Kenneth
--
Statistics are like a bikini. What they reveal is suggestive, but
what th
Greetings,
As you all might know, the Haskell community has it's own informal
magazine, The Monad.Reader (http://haskell.org/tmrwiki).
I'm planning to write (with some support from the frequent users of
#haskell @ irc.freenode.net) a series of articles for TMR,
which describe some aspect of Has
Steven Elkins wrote:
Hello everyone,
I'm a Haskell newbie trying out various programs from the web. I'm
trying to compile one called bjpop-ray (from Bernie Pope, I think) and
I hit this at link-time:
Can you tell us where you got bjpop-ray ? I wrote my own raytracer in
Haskell, and would
Hello,
I'm planning to start up a project to build a 3D modelling application
in Haskell. I don't know which direction I would want to follow, hence
this mail.
I've set up a small wiki page @ http://haskell.org/hawiki/H3D.
I'm looking for neat idea's, existing projects, articles, suggestions
19 matches
Mail list logo
