Well said!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
To those looking for me: I live! And I got reminded to get back in touch via
http://www.well-typed.com/blog/66 (kudos to them!).
protocol-buffers is updated, now on to regex-*
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.or
> From: wren ng thornton
> Sent: Saturday, May 19, 2012 12:49 AM
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
-snip-
> "Fair" in what sense? That is, what _exactly_ are you hoping to
> compare?
>
> If the goal is to benchmark the implementation of the runtime, VM, or
> built-in
I have returned from the shadows of the intenet to maintain some packages!
Version 2.0.7 of protocol-buffers (3 packages) has been uploaded to hackage.
This makes it compile with
ghc-7.4.1 and handle missing package names better.
Thanks to everyone who sent email and patches, including Nathan How
I'm happy to announce the first, experimental version of the
time-lens library.
http://hackage.haskell.org/package/time-lens
https://github.com/feuerbach/time-lens
Its goal is to simplify working with time and date data structures in
Haskell by providing lens-based overloaded accessors for Da
Am 19.05.2012 12:00, schrieb wren ng thornton:
Exactly. That's what I was trying to get at re the problems of comparing
Haskell to C++ (or indeed any pair of dissimilar languages). A
legitimate comparison will involve far more than microbenchmarks, but
then a legitimate comparison must always hav
> Date: Sat, 19 May 2012 08:57:38 +0200
> From: Ertugrul S?ylemez
> Subject: Re: [Haskell-cafe] Can Haskell outperform C++?
> To: haskell-cafe@haskell.org
> Message-ID: <20120519085738.37548...@tritium.streitmacht.eu>
> Content-Type: text/plain; charset="us-ascii"
> Haskell delivers reasonable p
Hello,
I would like to add questions to yours. I'm not sure that C++ programs
are same performance as C actually, so I can have a bad logic.
How much is hard to port a haskell program to C ?
If it will become harder and harder, (i.e. for parallelizations) than
it's fair to choose haskell for perf
On 5/16/12 4:37 PM, Gregg Lebovitz wrote:
1) Outstanding best practices documents that capture this knowledge and
provides useful answers. Organizing this information in an online
document that can be searched by keyword or index would be really
helpful. The hard part will be maintaining it. As s
On 5/18/12 7:45 AM, Roman Werpachowski wrote:
On Fri, 18 May 2012 15:30:09 +1200, "Richard O'Keefe"
wrote:
The claim was and remains solely that
THE TIME DIFFERENCE BETWEEN *ALGORITHMS*
can be bigger than
THE TIME DIFFERENCE BETWEEN *LANGUAGES*
and is in this particular case.
Yes, but a
On 5/16/12 3:57 PM, Bardur Arantsson wrote:
Comparing languages is a highly non-trivial matter involving various
disciplines (including various squidgy ones) and rarely makes sense
without a very specific context for comparison.
Exactly. That's what I was trying to get at re the problems of com
11 matches
Mail list logo
