Very helpful -- thanks everyone! The handling of currency amounts in hledger
is what I was looking for in terms of alternate ways to parse and represent
dollar amounts in Haskell.
On Wed, May 11, 2011 at 6:05 PM, Simon Michael wrote:
> On 5/10/11 2:52 PM, Roman Cheplyaka wrote:
>
>> You could re
Hi,
I browsed the current AVL tree implementation in Hackage
http://hackage.haskell.org/packages/archive/AvlTree/4.2/doc/html/src/Data-Tree-AVL-Push.html
AVL tree denote the different of height from right sub-tree to left
sub-tree as delta, to keep the
balance, abs(delta)<=1 is kept as invariant.
Welcome to issue 181 of the HWN, a newsletter covering developments
in the Haskell community. This release covers the week of May 1 to
7, 2011.
Announcements
Last week I failed to note the announcement [http://goo.gl/ApClU]
of a new version of Leksah (0.10.0). If you haven't yet, g
On 5/11/11 3:11 PM, Bryan O'Sullivan wrote:
It's a fairly terrible piece of software.
My experience is that it is the only cross-platform build system I have
used to date that hasn't made my eyes bleed, though I only use it for
C/C++/Fortran. I suppose that counts as a personal testimonial in
On 5/10/11 2:52 PM, Roman Cheplyaka wrote:
You could read hledger[1] sources for inspiration: it's written in
Haskell and contains some (quite generic) currency parsing.
Hi Eric.. here's the code in question:
http://hackage.haskell.org/packages/archive/hledger-lib/0.14/doc/html/src/Hledger-Rea
Excerpts from Robert Clausecker's message of Wed May 11 21:54:32 +0200 2011:
> Because I want to get a good answer, I cross post it here. It may be
> interesting:
If you do this you should consider adding a reference to this thread on
stackoverflow as well .. You can read this mailinglist online
(h
The html version of All About Monads has dissapeared, so I am making
due with the pdf version. As a consequence I don't have access to the
example code files referenced. I know someone out there has them.
Could you make them available please?
___
Haskell
At Wed, 11 May 2011 13:02:21 +0100,
Simon Marlow wrote:
>
> > However, if there's some simpler way to guarantee that>>= is the
> > point where exceptions are thrown (and might be the case for GHC in
> > practice), then I basically only need to update the docs. If someone
> > with more GHC underst
On Wed, May 11, 2011 at 12:54 PM, Robert Clausecker wrote:
>Is it possible to use cmake for Haskell projects?
>
Yes, but you shouldn't. Just use the cabal build system instead. It solves
the same kinds of problems, but requires far less effort than dealing with
CMake.
>I heard a
Just a thought -- I'd rather pay for a journal or the like than only give a
donation. (The web journals are great, but I find it easier on the eyes to
read print instead of a computer screen.)
cheers,
Nicholas — https://ntung.com — CS and Mathematics major @ UC Berkeley
On Tue, May 10, 2011 at 3:
Parallel Haskell Digest
===
Edition 2
2011-05-11
Hello Haskellers!
Welcome to the second edition of the Parallel Haskell Digest, bringing you
news, discussions and tasters of parallelism and concurrency in Haskell.
The digest is made possible by the Parallel GHC project.
More
Hello readers of haskell-cafe!
I asked this question on Stackoverflow:
http://stackoverflow.com/q/5969616/417501
Because I want to get a good answer, I cross post it here. It may be
interesting:
Is it possible to use cmake for Haskell projects?
I am planning a p
At Wed, 11 May 2011 13:02:21 +0100,
Simon Marlow wrote:
>
> There's no guarantee of the form that you mention - asynchronous
> exceptions can occur anywhere. However, there might be a way to do what
> you want (disclaimer: I haven't looked at the implementation of iterIO).
>
> Control.Exceptio
At Wed, 11 May 2011 13:02:21 +0100,
Simon Marlow wrote:
>
> There's no guarantee of the form that you mention - asynchronous
> exceptions can occur anywhere. However, there might be a way to do what
> you want (disclaimer: I haven't looked at the implementation of iterIO).
>
> Control.Exceptio
I would like to add a big thank you to everyone involved and a huge thanks
to the SFC.
I believe this move is the right one and it will be tremendously valuable to
the community going forward.
Thanks!
On Wed, May 11, 2011 at 9:11 AM, Don Stewart wrote:
> The intent is that all management of ha
The intent is that all management of haskell.org infrastructure
continues to be done by the haskell.org committee, following this
charter (e.g. the team that has been making decisions about
haskell.org servers and systems for the past 6 months):
http://www.haskell.org/haskellwiki/Haskell.org_c
I wonder if I need something like your use of 'representation' types, i.e.
to restrict what sort of elements can be stored in a collection.
I've just recently hit on the idea of using a barrier type 'V' to wrap a
synchronous value. A 'synchronous value' is one that can be observed at a
single time
On Wednesday 11 May 2011 17:39:39, michael rice wrote:
> It's hard to improve on a 20 line Awk program for generating text but I
> thought it would be fun to investigate a Haskell solution. Why can't I
> cons an element onto an existing list?
> Michael
> Prelude Data.List Data.Map> insertWith (:) (
Because insertWith has a different type than your code needs.
It's not like a -> b -> b, it's a -> a -> a and (:) is not like this.
Try insertWith (++ or flip (++)) [("Moby", "Dick")]
2011/5/11 michael rice
> It's hard to improve on a 20 line Awk program for generating text but I
> thought
It's hard to improve on a 20 line Awk program for generating text but I thought
it would be fun to investigate a Haskell solution.
Why can't I cons an element onto an existing list?
Michael
Prelude Data.List Data.Map> insertWith (:) ("Moby", "Dick") "will" (fromList
[(("Joe", "Blow"),["is"]), (("
[Apparently I forgot to hit reply-all.]
Thanks for your response, Adam.
On Tue, May 10, 2011 at 1:25 PM, Adam Megacz wrote:
> > class (GArrowMap a (**) u c) => GArrowJoin a (**) u c where
> >join :: a d (c r) -> a (c d) (c r)
>
> I like these; I think you're on the right track. The last on
On 06/05/2011 16:56, dm-list-haskell-c...@scs.stanford.edu wrote:
At Fri, 6 May 2011 10:15:50 +0200,
Gregory Collins wrote:
Hi David,
Re: this comment from catchI:
It is not possible to catch asynchronous exceptions, such as
lazily evaluated divide-by-zero errors, the throw function, or
exce
On 11/05/2011 10:33, Yitzchak Gale wrote:
> Don Stewart wrote:
>> The haskell.org committee... has decided to
>> incorporate haskell.org as a legal entity. This email outlines our
>> recommendation, and seeks input from the community on this decision.
>
> Thanks, good news! And thanks for posting
On Wednesday 11 May 2011 09:25:05, Bin Jin wrote:
> sorry, it's 15 seconds. It's a typo
It's less for me, something like 5.8s compiled without optimisations, 3.6s
with -O2 (Pentium4, 3.06GHz).
The overwhelming part of that is spent in GC:
MUT time0.69s ( 0.73s elapsed)
GCtime
Don Stewart wrote:
> The haskell.org committee... has decided to
> incorporate haskell.org as a legal entity. This email outlines our
> recommendation, and seeks input from the community on this decision.
Thanks, good news! And thanks for posting to multiple
lists for maximum public notification t
Dear haskell.org committee
Great stuff. Thanks for getting this together.
Things I wondered about are:
- who will run the haskell.org entity?
- how are they chosen? do they have fixed terms?
- how are they accountable to the Haskell Community
(eg an a brief an
Hi,
I'm using Bryan's bloomfilter package, and I would like to calculate the
false positive rate after constructing the bloom filter. Two reasons:
1. Bloom filters have a power-of-two size, which means that the FP rate
you ask for becomes an approximation (upper bound), and the real FP rate
mig
sorry, it's 15 seconds. It's a typo
On Wed, May 11, 2011 at 3:20 PM, Bin Jin wrote:
> Hi, cafe
>
> I'm recently solving some algorithm puzzles from previous Google Code Jam
> rounds, and today I met some problem I can't solve now.
> It's a problem (Round 3 2010, B) that the solution require to f
Hi, cafe
I'm recently solving some algorithm puzzles from previous Google Code Jam
rounds, and today I met some problem I can't solve now.
It's a problem (Round 3 2010, B) that the solution require to find a
shortest path in a graph with about 100,000 vertices
and 50 edges from each vertex. Apart
29 matches
Mail list logo
