On 06/10/12 03:06 PM, Ben Gamari wrote:
Let the list know if you encounter any issues. I'll try to dust off my
own development environment once I get back to the states next week to
ensure that everything still works. I've been meaning to setup the
PandaBoard as a build slave as Karel's has been
An interesting related problem is if you are only allowed one pass through
the data how would you randomly choose one word.
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, Jun 6, 2012 at 6:20 AM, Doug McIlroy wrote:
> Last I looked (admittedly quite a while ago), the state of
> the art was strtod in http://www.netlib.org/fp/dtoa.c.
> (Alas, dtoa.c achieves calculational perfection via a
> murmuration of #ifdefs.)
>
That was indeed the state of the art for
On Sun, Jun 10, 2012 at 6:21 AM, Noon Silk wrote:
> Hi,
>
> I'm clearly new to haskell, and I suppose those is a basic question,
> but after a bit of searching I've been unable to figure out the "best"
> way to do this. I was first trying to find out how to, say, get a
> random element from a li
Hello cafe,
there's an upcomming meeting of the Haskell user group Hamburg next
Thursday (June 14th).
We'll start 19:00 at the Xing AG in Hamburg (Gänsemarkt 43, 20354 Hamburg).
Falko Peters will give a short talk about hedis (
http://hackage.haskell.org/package/hedis), a Redis client written in
Thanks these look very interesting!
It seems that the parallelism is only available vai the JoinList module, am
i correct in thinking this (or at least that is the only place where it is
clearly inidicated in the haddock and source code). Are there any plans to
leverage "Cloud Haskell" once the m
Heyo,
If you use Last.fm/Libre.fm you might be interested in running your own
local scrobbling server in Haskell.
$ cabal update
$ cabal install scrobble
$ scrobble-server 8910
Source is here with further instructions for audio players and such:
https://github.com/chrisdone/scrobble
Exactly wh
Hello everyone,
I, Takayuki, author of Paraiso, would like to make some follow ups.
First, the published version of the first paper on Paraiso is now
available from
http://iopscience.iop.org/1749-4699/5/1/015003 .
Please go ahead and read it because the typeset is better, the journal
is an open-a
Hi,
Look up "reservoir sampling", it will most probably help.
On Sun, Jun 10, 2012 at 6:21 AM, Noon Silk wrote:
> Hi,
>
> I'm clearly new to haskell, and I suppose those is a basic question,
> but after a bit of searching I've been unable to figure out the "best"
> way to do this. I was first t
On Thu, 7 Jun 2012, Simon Peyton-Jones wrote:
Very useful! Maybe worth turning into a page on the Haskell wiki?
I created one:
http://www.haskell.org/haskellwiki/Functional_dependencies_vs._type_families
___
Haskell-Cafe mailing list
Haskell-Caf
Hi,
I'm clearly new to haskell, and I suppose those is a basic question,
but after a bit of searching I've been unable to figure out the "best"
way to do this. I was first trying to find out how to, say, get a
random element from a list, but I'm starting to think that may not be
the best way (bec
Joshua Poehls writes:
> Hello Ben,
>
Hello,
Sorry for the latency. I'm currently on vacation in Germany so I haven't
had terribly consistent Internet access.
I've Cc'd haskell-cafe@ as I've been meaning to document my experiences
anyways and your email seems like a good excuse to do this.
>
Hi,
I'm trying to produce a list in the strict ST monad. The documentation
of ST says that the monad is strict in the state, but not in the values.
So I expect that, when returning a list, I get back only the Cons (with
2 unevaluated thunks). Now, when I need the first element (head), this
w
13 matches
Mail list logo
