Hello,
This is to remind you that you are kindly invited to attend our next meeting.
The original email follows below.
The Functional Programming Group Ghent (GhentFPG) [1] is a friendly group for
all people interested in functional programming, with a tendency towards
Haskell.
It is
Hi Simon et al,
On Jun 25, 2010, at 14:39 PM, Simon Marlow wrote:
On 25/06/2010 00:24, Andy Georges wrote:
snip
Are there any inputs available that allow the real part of the suite
to run for a sufficiently long time? We're going to use criterion in
any case given our own expertise
with inputs that are open source
... let us know.
-- Andy
[1] COLE: Compiler Optimization Level Exploration, Kenneth Hoste and Lieven
Eeckhout, CGO 2008
[2] Automated Just-In-Time Compiler Tuning, Kenneth Hoste, Andy Georges and
Lieven Eeckhout, CGO 2010
[3] Statistically Rigorous Java
Hi Kenneth,
I've thrown my current code online at http://boegel.kejo.be/files/Netflix_read-and-parse_24-02-2009.hs
,
let me know if it's helpful in any way...
Maybe you could set up a darcs repo for this, such that we can submit
patches against your code?
-- Andy
Hello,
A while back, we had a discussion on #haskell about assembling a
Haskell benchmark suite, that is suitable for doing performance tests.
A preliminary page was erected athttp://www.haskell.org/haskellwiki/HaBench
. In the meantime, Donald Steward extended the original nofib suite
Hi,
On 1 Feb 2007, at 00:50, Alexy Khrabrov wrote:
Also see that sequence.complete.org has many code snippets in the blog
section. What would be a good way to systematize all such snippets
together with hpaste.org and those scrolling through the mailing list?
Perhaps some kind of ontology of
Hi,
Following up and the threads on haskell and haskell-cafe, I'd like
to gather ideas, comments and suggestions for a standarized Haskell
Benchmark Suite.
The idea is to gather a bunch of programs written in Haskell, and
which are representative for the Haskell community (i.e. apps,
On 28 Jan 2007, at 12:57, Joel Reymont wrote:
On Jan 28, 2007, at 8:51 AM, Andy Georges wrote:
it is nice to know that e.g., Data.ByteString performs as good as
C, but is would be even nicer to see that large, real-life apps
can reach that same performance.
What about using darcs
Hi,
version 1.0 of package rdtsc has just been released.
This small package contains one module called 'Rdtsc.Rdtsc'.
I am wondering what it would take to get rdpmc in there as well. Of
course, you'd need some way to set the pmcs before running, but that
can be done using e.g. perfctr.
Alexey,
Well, AFAIK, PAPI abstracts away the platform dependencies quite
well, so I guess your code can be run straightforward on all IA-32
platforms (depending on the events you wish to measure, which may
or may not be present on all platforms). PowerPC, Itanium, Mips,
Alpha should work
Hi,
The GHC head can currently build against PAPI[1], a library for
gathering CPU statistics.
I did not know that. I know PAPI, though I prefer using perfctr
directly, at least for what I'm doing (stuff in a JVM) [1], [2], [3].
At the moment you can only gather such statistics for AMD
Hi,
I have to dispute this Bulat's characterisation here. We can solve
lots
of nice problems and have high performance *right now*. Particularly
concurrency problems, and ones involving streams of bytestrings.
No need to leave the safety of GHC either, nor resort to low level
evil
code.
Hi,
Actually, the more I think of it, the more I think we should rename
the language altogether. It seems like people say Haskell with
stress on the first syllable if they were either on the committee or
learned it inside academia, and Haskell with stress on the second
syllable if they learned
Hi,
On 13 Dec 2006, at 00:17, Joachim Durchholz wrote:
Kirsten Chevalier schrieb:
I think that it would serve this
community well if somebody was able to achieve a better understanding
of the social reasons why some programming languages are adopted and
some aren't. I think all of us already
On 11 Dec 2006, at 19:35, Kirsten Chevalier wrote:
On 12/11/06, Andrew Wagner [EMAIL PROTECTED] wrote:
Well, perhaps if nothing else, we could use a wikibook to
collaboratively work on the structure of such a book, and then from
that you could publish a real book. I don't really know the
Hi,
I wonder if a similar theme is apropriate for proposed book.
Graphics and sounds give a very direct feedback to the programmer, and
I expect that helps with the motivation.
Perhaps a single largish application could be the end product of the
book. Like a game or something. You'd start off
Hi,
one particular thing that we still lack is something like book
Haskell in
real world
We need a 'Dive into Haskell' book.
-- Andy
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Lemmih,
Have you tried profiling the code?
You can find a guide to profiling with GHC here:
http://www.haskell.org/ghc/docs/latest/html/users_guide/profiling.html
I did that ... it shows that updateState is retaining most data (-hr
switch), as well as updateMap, which is increasing it's
Hello,
I'm looking for a bit of help (ok, a lot) the speed up my program
which I use to build a calltree out of an annotated program execution
trace. To give you an idea about the sluggishness at the moment, for
a trace containing 70MB, it has been running for about 10 hours
straight
On 12 Jul 2005, at 14:39, Dinh Tien Tuan Anh wrote:
parts 0 = [[]]
parts x = [concat (map (y:) parts(x-y) | y-[1..(x `div` 2)]]
First of all ... there is a ) missing ... I guess the line should read
parts x = [concat (map (y:) parts(x-y)
)
| y-[1..(x `div`
On 11 Jul 2005, at 17:37, Dinh Tien Tuan Anh wrote:
sumHam :: Integer - Float
sumHam n = sum [1/x | x-[1..n]]
Try this:
sumHam :: Integer - Float
sumHam n = sum [1.0/(fromIntegral x) | x-[-1..n]]
-- Andy
___
Hi all,
when this example occurs in the text the new Haskell coder has not been
introduced to most of what you suggest.
I didn't realise that. All apologies.
mvg,
Andy
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi Kaoru,
I have been working through the exercises in Thompson's The Craft of
Functional Programming 2nd Ed book. I am looking for a solution web
site for Thompson's book. Or maybe the people here can help.
In exercise 4.4, I am asked to define a function
howManyOfFourEqual :: Int - Int
23 matches
Mail list logo
