On 5/12/12 8:52 AM, Sönke Hahn wrote:
Any comments or suggestions?
Cabalize it and release it on Hackage. But especially the cabalization
part :)
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
On 5/12/12 8:52 AM, Sönke Hahn wrote:
Any comments or suggestions?
Cabalize it and release it on Hackage. But especially the cabalization part
:)
You should probably farm out the toDot rendering to one of the libraries
that
On 5/10/12 8:44 PM, Ryan Newton wrote:
through the trouble of writing my algorithms in C/C++, but simple-minded
people often have a desire to get the best performance possible, in
which case you really want to use C, C++, Fortran or whatever high level
assembler language you like.
I think this
On the one hand, characterizing those who desire the best performance
possible as simple-minded is, at best, a gross over-generalization. Like
you, I work in a field where optimization is king (e.g., in machine
translation, program runtimes are measured in days).
You misread the logical
Wren,
I see at least three different issues being discussed here. I think it
is important to delineate them:
1) Does Haskell and its libraries need performance improvements?
Probably yes. Some of the performance issues seem to be related to the
way the language is implemented and others by
The buffer http://hpaste.org/68595 presents a simple code I tried to
profile.
I spotted what I strongly think to be an abusive memoization. The problem
is that I don't see how to (simply) get rid of it.
Compiled with -O2, it consumes 130MB of memory, however lines A and B
executed separately
On May 16, 2012, at 12:08 PM, Yves Parès wrote:
The buffer http://hpaste.org/68595 presents a simple code I tried to profile.
I spotted what I strongly think to be an abusive memoization. The problem is
that I don't see how to (simply) get rid of it.
Compiled with -O2, it consumes 130MB of
Thanks ^^
My other solution was a dirty trick:
Changing the second (l 1) by a (l (div 2 2)), which would only be good
until GHC knows how to statically analyse it (2-1 wasn't working for
instance).
I also noticed (while profiling to confirm that this was the source of the
memory leak) that
Hi,
I'm newbie and I've got a problem.
I'm trying to get example programs from plugins-auto [1] or hotswap [2] to work.
I think question on stackoverflow [3] somewhat related to my problem.
They are compiled well, but in runtime I get either
segfault
or Prelude.undefined
or internal error: PAP
Wed May 16 16:40:26 CEST 2012, Gregg Lebovitz wrote:
2) ... I think the problem with current comparisons,
is that they are designed to favor imperative languages.
Please be specific:
- Which current comparisons?
- How do you know what they are designed to favor?
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
issues--- or if they haven't, then you can contribute improvements there,
helping
On Wed, May 16, 2012 at 8:40 AM, Gregg Lebovitz glebov...@gmail.com wrote:
1) Does Haskell and its libraries need performance improvements? Probably
yes. Some of the performance issues seem to be related to the way the
language is implemented and others by how it is defined. Developers really
Isaac,
I was looking at the debian coding contest benchmarks referenced by
others in this discussion. All of the benchmarks algorithms, appear to
be short computationally intensive programs with a fairly low level of
abstraction.
In almost all examples, the requirement says: you must
Hi all,
I'm pleased to announce variable-precision-0.2:
http://hackage.haskell.org/package/variable-precision
There was no announcement for previous versions, as I quickly found
their flaws to be too irritating in practice.
--8-- excerpt from the hackage page
Software floating point with
Kevin,
Interesting point.
Over the past few weeks as part of my work, I have interviewed a
large numbers of Haskell developers from many different industries
and have been hearing the same points you are making. Space leaks
that were address by learning how
Hi folks
I need a little help.
I had a hiccup upgrading my Ubuntu system, and eventually did a fresh
install.
Its mostly fixed to my old favourite ways but I cannot remember what's
needed to install the stuff that the import IO statement uses!
--
Andrew
On Wed, May 16, 2012 at 3:32 PM, A Smith asmith9...@gmail.com wrote:
Hi folks
I need a little help.
I had a hiccup upgrading my Ubuntu system, and eventually did a fresh
install.
Its mostly fixed to my old favourite ways but I cannot remember what's
needed to install the stuff that the
On 05/16/2012 09:02 PM, Gregg Lebovitz wrote:
Isaac,
I was looking at the debian coding contest benchmarks referenced by
others in this discussion. All of the benchmarks algorithms, appear to
be short computationally intensive programs with a fairly low level of
abstraction.
In almost
On Wed, May 16, 2012 at 1:17 PM, Gregg Lebovitz glebov...@gmail.com wrote:
Also interesting is that in all my interviews, GHC performance was never
raised. No one said I have to drop into C to solve that performance
problem.
That's been my experience too. I've so far been able to get
Kevin Charter kchar...@gmail.com writes:
snip
For example, imagine you're new to the language, and as an exercise decide
to write a program that counts the characters on standard input and writes
the count to standard output. A naive program in, say, Python will probably
use constant space
Ben,
This is precisely the kind of problem I am currently thinking about and
why I asked for pointers to documents on best practices. The current
model for gaining the necessary experience to use Haskell effectively
does not scale well.
Here are some ideas on how to address the knowledge
The profiler is certainly useful (and much better with GHC 7.4)
What are the improvements in that matter? (I just noticed that some GHC
flags wrt profiling have been renamed)
2012/5/16 Ben Gamari bgamari.f...@gmail.com
Kevin Charter kchar...@gmail.com writes:
snip
For example, imagine
Yves Parès yves.pa...@gmail.com writes:
The profiler is certainly useful (and much better with GHC 7.4)
What are the improvements in that matter? (I just noticed that some GHC
flags wrt profiling have been renamed)
The executive summary can be found in the release notes[1]. There was
also a
On 5/16/2012 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. So the short answer
is: mu. Discovering the long answer
On 17 May 2012 03:31, Stephen Tetley stephen.tet...@gmail.com wrote:
On 16 May 2012 19:43, wren ng thornton w...@freegeek.org wrote:
You should probably farm out the toDot rendering to one of the libraries
that focuses on that[1], since they'll have focused on the efficiency
issues--- or if
From: Gregg Lebovitz glebov...@gmail.com
Sent: Wednesday, May 16, 2012 12:02 PM
I was looking at the debian coding contest benchmarks referenced by others in
this discussion.
debian coding contest ?
It's been called many things but, until now, not that.
All of the benchmarks
[Deadline for submission of abstracts is in two weeks. The submission
page is open, earlier submissions welcome.]
Haskell 2012
ACM SIGPLAN Haskell Symposium 2012
Welcome to issue 227 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of May 6 to 12, 2012.
Announcements
Doaitse Swierstra reminded us about the Summer School on Applied
Functional Programming, at Utrech University.
In a lecture today I presented (for quite other reasons) a simple combinatorial
enumeration problem where the difference between two algorithms was far larger
than any plausible difference between programming languages. If a programming
language makes it easier to explore high level
Richard,
Thank you. This is an example of what I had in mind when I talked about
changing the playing field. Do you have a slide deck for this lecture
that you would be willing to share with me? I am very interested in
learning more.
Gregg
On 5/16/2012 9:13 PM, Richard O'Keefe wrote:
In a
I am planning on doing this early next week, probably in two phases.
As part of the import process, github will generate a *lot* of notification
emails. I'm afraid there is nothing I can do to stem the tide, as github
does not provide a mechanism to suppress these. If you have a github
account,
Hello,
The context in your example serves an important purpose: it records the
fact that the behavior of the function may differ depending on which type
it is instantiated with. This is quite different from ordinary
polymorphic functions, such as `const` for example, which work in exactly
the
On 17/05/2012, at 2:04 PM, Gregg Lebovitz wrote:
Richard,
Thank you. This is an example of what I had in mind when I talked about
changing the playing field. Do you have a slide deck for this lecture that
you would be willing to share with me? I am very interested in learning more.
No
33 matches
Mail list logo
