andrewcoppin:
Michael Vanier wrote:
Awesome!
I'm reminded of the IRC post that said that Haskell is bad, it makes
you hate other languages.
How true it is...
I've often thought about a sort of elevator pitch for Haskell.
However, every time I sit down to think about this, I come to
sven.panne:
On Monday 10 September 2007 18:21, Thomas Schilling wrote:
On Mon, 2007-09-10 at 18:11 +0200, Sven Panne wrote:
[...]
The library looks quite nice, but I'm missing support for reading/writing
Int{8,16,32,64}
maybe this?
nominolo:
On Mon, 2007-09-10 at 16:17 +0100, Jules Bean wrote:
Thomas Schilling wrote:
On Mon, 2007-09-10 at 11:10 +0100, Jules Bean wrote:
The docs are not as well interlinked as you might hope.
In fact, the docs on hackage are interlinked nicely. That is, for
packages for
sven.panne:
On Monday 10 September 2007 19:50, Thomas Schilling wrote:
[...]
instance Binary MP3 where
get = MP3 $ getHeader * getData -- [*]
where getHeader = do magic - getWord32le
case magic of
...
Of course this works in the
sven.panne:
On Monday 10 September 2007 19:26, Don Stewart wrote:
Yep, just send a patch. Or suggest what needs to happen.
OK, I'll see what I can do next weekend, currently I'm busy with
packaging/fixing GHC. I have similar code lying around in various places, and
it would be nice
bf3:
The way I see it as a newcomer, Haskell shifts the typical imperical
programming bugs like null pointers and buffer overruns towards
space/time leaks, causing programs that either take exponentially long
to complete, stack overflow, or fill up the swap file on disc because
they
bf3:
Well, I actually meant more something like the imperative equivalences
of code coverage tools and unit testing tools, because I've read
rumors that in Haskell, unit testing is more difficult because lazy
evaluation will cause the units that got tested to be evaluated
We have full
andrewcoppin:
Don Stewart wrote:
Just in case people didn't see, the `binary' package lives on
http://darcs.haskell.org/binary/
However, Lennart Kolmodin, Duncan and I are actively maintaining and
reviewing
patches, so send them to one (or all) of us for review.
Right
h._h._h._:
Hello,
I have some questions connected more with the licenses and libraries as the
language itself:
Is it possible to:
- publish Haskell source code under the BSD3 license
- provide an executable binary together with the code including (compiled
e.g. with 'ghc --make')
byorgey:
On 9/11/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
take 1000 [1..3] still yields [1,2,3]
I thought it was supposed to return an error.
Any ideas?
Thanks, Paul
If for some reason you want a version that does return an error in that
situation,
prstanley:
I suppose I'm thinking of head or tail - e.g. head [] or tail [].
I'm trying to write my own version of the find function. I have a few
ideas but not quite sure which would be more suitable in the context of
FP.
Any advice would be gratefully received - e.g. do I use
byorgey:
On 9/11/07, Don Stewart [EMAIL PROTECTED] wrote:
byorgey:
On 9/11/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
take 1000 [1..3] still yields [1,2,3]
I thought it was supposed to return an error.
Any ideas
prstanley:
Let me get this right, are you saying it's unsafe when it returns an
error?
Partial functions may crash your program, so that's unsafe by some definitions,
yep.
We have tools that analyse programs for such bugs, in fact (Neil's `catch'
program).
-- Don
mailing_list:
On Wed, Sep 12, 2007 at 11:16:25AM -0400, Seth Gordon wrote:
It appears that in spite of the locale definition, hGetContents is
treating
each byte as a separate character without translating the multi-byte
sequences *from* UTF-8, and then putStrLn sends each of those
dav.vire+haskell:
On 9/12/07, VinyleEm [EMAIL PROTECTED] wrote:
projects there, some of them being incomplete. Could you please suggest me
some project, from which i can learn the State Monad.
xmonad perhaps ?
Yes, I think xmonad is a good example of the standard Haskell approach to
bf3:
Thanks for all the info.
It's really good news that code coverage is now part of the GHC compiler!
Any more info on that deep seq? I can't find it in the libraries that come
with GHC 6.6.1. It seems to be part of Control.Strategies.DeepSeq of HXT.
This is a separate download?
ok:
In Monad.Reader 8, Conrad Parker shows how to solve the Instant Insanity
puzzle in the Haskell type system. Along the way he demonstrates very
clearly something that was implicit in Mark Jones' Type Classes with
Functional Dependencies paper if you read it very very carefully (which
I
Better here means better -- a functional language on the type
system,
to type a functional language on the value level.
-- Don
For a taste, see Instant Insanity transliterated in this functional
language:
http://hpaste.org/2689
NB: it took me 5 minutes, and that was my first
lgreg.meredith:
Haskellians,
Am i wrong in my assessment that the vast majority of reflective machinery
is missing from Haskell? Specifically,
* there is no runtime representation of type available for programmatic
representation
* there is no runtime
hughperkins:
Just out of curiosity, how could one do something like a factory, so
that by default a library uses, say, Data.Map, but by making a simple
assignment we can switch the library to use a different
implementation?
Polymorphism, specifically, typeclasses, would be one option here.
/gmane.comp.lang.haskell.cafe/28883
Israeli Haskell Programmers Group. B K [18]also seeks to form an
Israeli Haskell user's group
18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/28877
xmonad 0.3. Don Stewart [19]announced the 0.3 release of [20]xmonad.
xmonad is a tiling window
evan:
Has anybody made (or have a link to) a Haskell reference cheat sheet?
I'm thinking of a nice LaTeXed PDF in the 1-10 page range (e.g.
something like this http://www.tug.org/texshowcase/cheat.pdf) with the
basics of the language syntax, the type declarations for the common type
classes,
paul.hudak:
Henning Thielemann wrote:
On Wed, 26 Sep 2007, Peter Verswyvelen wrote:
I hope I won't come to the conclusion that after one year learning
the cool lazy functional programming language Haskell (which I want
to use for making simple videogames in a clean way for teaching),
I
clawsie:
an IMAP library might make for a good bounty project...i figure that
you would indeed need to pay someone to untangle that standard
jmuk's HaskellNet project from last year?
http://darcs.haskell.org/SoC/haskellnet/HaskellNet/IMAP.hs
-- Don
bbrown:
I am trying to print the data from a data type and also get the field
values. How would I reference those values if I am declaring a Show function.
I should probably use a class for this, but so far it is working.
I have something along the lines of this.
data SimplePlayer =
Nice spot, Magnus. We at xmonad.org aim to please :)
People might be also interested in a bit of an experience report on
developing xmonad (and running an open source Haskell project) I gave at
Galois a couple of weeks ago:
http://galois.com/~dons/talks/xmonad-galois-0907.pdf
Finally, while
mail:
Hi,
Am Donnerstag, den 27.09.2007, 21:53 +0100 schrieb Magnus Therning:
Seems xmonad is feeling the love. The attached mail turned up on the
debian-user mailing list. It's high time xmonad gets packaged for
Debian!
note that there is an Intend To Package filed:
prstanley:
Hi
intToBin :: Int - [Int]
intToBin 1 = [1]
intToBin n = (intToBin (n`div`2)) ++ [n `mod` 2]
binToInt :: [Integer] - Integer
binToInt [] = 0
binToInt (x:xs) = (x*2^(length xs)) + (binToInt xs)
Any comments and/or criticisms on the above definitions would be
appreciated.
jens.blanck:
Not being very savvy in building things I got stuck when trying to build
xmonad. It needs X11 1.2.2, so I tried to build that. Configuration step
went fine (I believe), but buiding failed:
runhaskell Setup.hs build
Preprocessing library X11-1.2.2...
aeyakovenko:
Program1:
module Main where
import Data.Binary
import Data.List(foldl')
main = do
let sum' = foldl' (+) 0
let list::[Int] = decode $ encode $ ([1..] :: [Int])
print $ sum' list
print done
vs
Program2:
module Main where
import Data.Binary
import
aeyakovenko:
servers never terminate, pretend that i have a server that reads a
list encoded with data.binary from a socket, and sums it up and
returns the current sum. i would expect it to run in constant memory,
never terminate, and do useful work.
which is basically the problem that I
It was raised at CUFP today that while Python has:
Python is a dynamic object-oriented programming language that can be
used for many kinds of software development. It offers strong
support for integration with other languages and tools, comes with
extensive standard libraries,
Haskell can be about.
-- Don
wagner.andrew:
Wasn't this the point of the elevator speech thread a few weeks ago?
Saying in 30 seconds why haskell is good and what it can do for you?
On 10/4/07, Don Stewart [EMAIL PROTECTED] wrote:
It was raised at CUFP today that while Python has
catamorphism:
On 10/4/07, Don Stewart [EMAIL PROTECTED] wrote:
It was raised at CUFP today that while Python has:
Python is a dynamic object-oriented programming language that can be
used for many kinds of software development. It offers strong
support for integration
lemming:
On Fri, 5 Oct 2007, Albert Y. C. Lai wrote:
Granted, perhaps your perspective is, if every other company is shouting
customers are number one, then ours must too, and who actually lives up
to it is the non-sequitur here. You're in the buzzword war, not the
evidence war. OK,
Just to let everyone know , the Haskell Hackathon is underway (the 2nd
this year), in Freiburg, Germany, and library and infrastructure code is
being worked on furiously -- Cabal and related tools in particular. You
can follow all the action from planet.haskell.org, and from the
hackathon site,
bf3:
For me, a good reason why one should look at Haskell is because you
should NOT look at Haskell since it will change your view on programming
so much, you don't want to go back... ;-)
But where is the great IDE Haskell deserves??? :-) Seriously, 99% of the
programmers I know don't
Binary: high performance, pure binary encoding, decoding and serialisation for
Haskell
--
The Binary Strike Team is pleased to announce release 0.4 of Data.Binary, the
pure, efficient binary serialisation library for
agl:
On 10/6/07, Felipe Almeida Lessa [EMAIL PROTECTED] wrote:
May I ask what are the changes? I didn't find some sort of changelog
anywhere.
There's the darcs changes list. The descriptions there in are .. terse :)
But here's a selection:
* Add getLazyByteStringNul.
-- | Get a
andrewcoppin:
Don Stewart wrote:
*Very* high performance can be expected, with throughput over 1G/sec
observed
in practice (good enough for most networking scenarios, we suspect).
Um... I wasn't aware that there was any harddrive or networking
technology that goes this fast?
My bus
felipe.lessa:
On 10/6/07, Don Stewart [EMAIL PROTECTED] wrote:
The Binary Strike Team is pleased to announce release 0.4 of Data.Binary,
the
pure, efficient binary serialisation library for Haskell, now available from
Hackage:
May I ask what are the changes? I didn't find some sort
ketil:
Don Stewart [EMAIL PROTECTED] writes:
The main thing is porting to ghc 6.8 -- which means the new (*faster*)
lazy bytestring representation, and the smp parallel quickcheck driver
for the testsuite (it'll use N cores, watch the jobs migrate around).
Binary 0.4 seems to require
duncan.coutts:
In message [EMAIL PROTECTED] Don Stewart
[EMAIL PROTECTED] writes:
ketil:
Don Stewart [EMAIL PROTECTED] writes:
The main thing is porting to ghc 6.8 -- which means the new (*faster*)
lazy bytestring representation, and the smp parallel quickcheck driver
jonathanccast:
I just noticed that pi doesn't have a default definition in the standard
prelude, according to the Haddock docs. Why is this?
$ ghci
Prelude :t pi
pi :: (Floating a) = a
Prelude pi
3.141592653589793
It's in the Floating class.
-- Don
magnus:
I recently had reason to do some encoding-related coding and noticed
that Haskell was somewhat lacking (I could only find code for base64, on
the other hand there are two implementations of it :-).
I've almost reached a state where I wouldn't be ashamed of sharing the
code so I
allbery:
On Oct 12, 2007, at 18:35 , Albert Y. C. Lai wrote:
You are not expected to be convinced this, but it seems
continuations completely characterize system programming. :)
Didn't someone already prove all monads can be implemented in terms
of Cont?
Cont and StateT, wasn't
stefanor:
On Sat, Oct 13, 2007 at 12:09:57AM +0200, ntupel wrote:
Dear all,
I have implemented a small module to generate random items with a given
probability distribution using the alias approach [1] and unfortunately
compared to similar implementations in C++ or Java it is about 10
dons:
stefanor:
On Sat, Oct 13, 2007 at 12:09:57AM +0200, ntupel wrote:
Dear all,
I have implemented a small module to generate random items with a given
probability distribution using the alias approach [1] and unfortunately
compared to similar implementations in C++ or Java it
isaacdupree:
ntupel wrote:
Thanks for your reply Stefan. Unfortunately I could measure only a
relatively small improvement by changing to concrete types
the sample code was about one second faster when compiled with -O2.
Profiling again indicated that most time was spend in random and
http://alberrto.googlepages.com/easyvision
An experimental Haskell system for fast prototyping of computer vision
and image processing applications.
Looks ridiculously cool.
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
jgbailey:
I am trying to parse various date and time formats using the parseTime
function found in (GHC 6.6.1) Data.Time.Format. The one that is giving me
trouble looks like this:
2008-06-26T11:00:00.000-07:00
Specifically, the time zone offset isn't covered by the format
stefanor:
On Mon, Oct 15, 2007 at 10:57:48PM +0100, Claus Reinke wrote:
so i wonder why everyone else claims to be happy with the status quo?
We aren't happy with the status quo. Rather, we know that no matter how
much we do, the situation will never improve, so most of us have stopped
simonmarhaskell:
Several good points have been raised in this thread, and while I might not
agree with everything, I think we can all agree on the goal: things
shouldn't break so often.
So rather than keep replying to individual points, I'd like to make some
concrete proposals so we can
dpiponi:
I was just putting together my Amazon wish list and was wondering if
there are any great books on Haskell and/or functional programming
that people think are must-reads. Okasaki's Purely Functional
Programming, Pierce's Types and Programming Languages are frequent
recommendations.
chak:
I wrote a while ago,
There is AngloHaskell and now AmeroHaskell. Doesn't that call for
OzHaskell?
http://haskell.org/haskellwiki/OzHaskell
In the meantime a number of interested people put their name down on
the wiki page. So, let's talk more concretely about a first
are available from the xmonad home page:
http://xmonad.org
The 0.4 release, and its dependencies, are available from
hackage.haskell.org, here:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad
Brought to you by the xmonad team:
Spencer Janssen
Don
briqueabraque:
Don Stewart escreveu:
The xmonad dev team is pleased to announce the 0.4 release of xmonad!
http://xmonad.org
That seems great. Is it possible to use it in a Gnome environment (for
instance, my Ubuntu desktop)?
Initial support for all
magnus:
On Thu, Oct 18, 2007 at 12:05:40 +0100, Jules Bean wrote:
Is there some (easy) way to avoid this while still using readFile?
readFile' f = do s - readFile f
return (length s `seq` s)
(and curse the fact that the default readFile is unsafelazy).
:( Doesn't work.
andrewcoppin:
Hugh Perkins wrote:
You're picking on Andrew Coppin? That's insane. He's got a sense of
humour, and he's a lay (non-phd) person.
Honestly, in one thread you've got Haskell is misunderstood! Its the
greatest language in the world! Why does no-one use it and in
another
briqueabraque:
Hi,
Are there binary constants in Haskell, as
we have, for instance, 0o232 for octal and
0xD29A for hexadecimal?
No, though it is an interesting idea.
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
ndmitchell:
Hi
Are there binary constants in Haskell, as
we have, for instance, 0o232 for octal and
0xD29A for hexadecimal?
No, though it is an interesting idea.
You can get pretty close with existing Haskell though:
(bin 100010011)
where bin :: Integer - Integer, and is
claus.reinke:
From my point of view, the difference between 0b10111011 and
(bin[1,0,1,1,1,0,1,1]) is 22-10 that is 12 characters.
how about using ghc's new overloaded strings for this?
10111011::Binary
there used to be a way to link to ghc head's docs, but
i can't find it right
dons:
claus.reinke:
From my point of view, the difference between 0b10111011 and
(bin[1,0,1,1,1,0,1,1]) is 22-10 that is 12 characters.
how about using ghc's new overloaded strings for this?
10111011::Binary
there used to be a way to link to ghc head's docs, but
i
, organizing, and cataloging
Haskell libraries and tools.
* bytestring 0.9. Uploaded by Don Stewart and Duncan Coutts.
[21]bytestring. fast, packed, strict and lazy byte arrays with a
list interface.
* arrows 0.3. Uploaded by Ross Paterson. [22]arrows, Several classes
jerzy.karczmarczuk:
Stefan O'Rear adds to the dialogue:
Prabhakar Ragde wrote:
Jerzy Karczmarczuk wrote:
Just a trivial comment... 1. Don't speak about comparing *languages*
when you compare *algorithms*,
and in particular data structures.
2. Please, DO code the above in C, using
rendel:
Prabhakar Ragde wrote:
divisors i = [j | j-[1..i-1], i `mod` j == 0]
main = print [i | i-[1..1], i == sum (divisors i)]
Jerzy Karczmarczuk wrote:
My point didn't concern that point. Haskell compiler cannot change an
algorithm using lists into something which deals with
stefanor:
On Sun, Oct 28, 2007 at 01:25:19PM -0700, Don Stewart wrote:
Finally, we can manually translate the C code into a confusing set of nested
loops with interleaved IO,
main = loop 1
where
loop !i | i 1 = return ()
| otherwise = if i
dons:
stefanor:
On Sun, Oct 28, 2007 at 01:25:19PM -0700, Don Stewart wrote:
Finally, we can manually translate the C code into a confusing set of
nested
loops with interleaved IO,
main = loop 1
where
loop !i | i 1 = return
peter:
Daniel Fischer wrote:
What perpetually puzzles me is that in C long long int has very good
performance, *much* faster than gmp, in Haskell, on my computer, Int64 is
hardly faster than Integer.
I tried the example with Int64 and Integer. The integer version
was actually quicker
peter:
Peter Hercek wrote:
C++ version times: 1.125; 1.109; 1.125
Int32 cpu times: 3.203; 3.172; 3.172
Int64 cpu times: 11.734; 11.797; 11.844
Integer cpu times: 9.609; 9.609; 9.500
Ooops, my results ware wrong (nonoptimizing ms cl
compiler used and I used -O instead of -O2 in ghc).
peter:
Don Stewart wrote:
C++ version times: 1.109; 1.125; 1.125
Int32 cpu times: 1.359; 1.359; 1.375
Int64 cpu times: 11.688; 11.719; 11.766
Integer cpu times: 9.719; 9.703; 9.703
Great result from ghc.
What Haskell program were you using for this test? The original
naive/high level
jwlato:
Hello,
I've been following the list optimization thread with great interest,
as it pertains to something I'm working on at the moment. I'm working
with moderate-sized files (tens to hundreds of MBs) that have some
ascii header data followed by a bunch of 32-bit ints. I can read the
ndmitchell:
Hi
I've been working on optimising Haskell for a little while
(http://www-users.cs.york.ac.uk/~ndm/supero/), so here are my thoughts
on this. The Clean and Haskell languages both reduce to pretty much
the same Core language, with pretty much the same type system, once
you get
I often use this in my cabal ghc-options:
ghc-options: -funbox-strict-fields -O2 -fasm -Wall -optl-Wl,-s
the last runs ld's strip automatically.
mnislaih:
Austin Seipp has written about this in his blog:
http://austin.youareinferior.net/?q=node/29
I will take this time to point out
goalieca:
So in a few years time when GHC has matured we can expect performance to
be on par with current Clean? So Clean is a good approximation to peak
performance?
The current Clean compiler, for micro benchmarks, seems to be rather
good, yes. Any slowdown wrt. the same program
bf3:
Are these benchmarks still up-to-date? When I started learning FP, I had
to choose between Haskell and Clean, so I made a couple of little
programs in both. GHC 6.6.1 with -O was faster in most cases, sometimes
a lot faster... I don't have the source code anymore, but it was based
on
prstanley:
Hi folks
Apologies for the off-topic post.
If anyone knows anything about the rules of proof by deduction and
quantifiers I'd be grateful for some assistance.
Much obliged,
http://www.cs.cmu.edu/~rwh/plbook/
Is an excellent introduction to reasoning about programming languages.
lemming:
On Fri, 2 Nov 2007, Felipe Lessa wrote:
On 11/2/07, Stuart Cook [EMAIL PROTECTED] wrote:
The solution would be to use a version of readFile that works in a
stricter way, by reading the file when it's told to, but I don't have
an implementation handy.
I guess this does
garious:
Anybody know of an ARM back end for any of the Haskell compilers?
nhc98 compiles to ARM,
http://www.haskell.org/nhc98/
however its lightly maintained, and many hackage libraries don't work
with nhc. So there's GHC with some effort can be made to work,
igouy2:
--- Sebastian Sylvan [EMAIL PROTECTED] wrote:
-snip-
It still tells you how much content you can see on a given amount of
vertical space.
And why would we care about that? :-)
I think the point, however, is that while LOC is not perfect, gzip is
worse.
How do you
briqueabraque:
Hi,
I understand that many people like using
layout in their code, and 99% of all
Haskell examples use some kind of layout
rule. However, sometimes, I would like
not to use layout, so I can find errors
easier (and maybe convert it to layout for
presentation after all
horng_twu_lihn:
I am looking for a Haskell module that will do multivariate linear
regression. Does someone know which module will do it? That is, the
equivalent of Perl's Statistics::Regression.pm.
alex:
Hi all,
import Random
import System.Environment
import List
import Monad
randMax = 32767
unitRadius = randMax * randMax
rand :: IO Int
rand = getStdRandom (randomR (0, randMax))
randListTail accum 0 = accum
randListTail accum n = randListTail (rand : accum) (n - 1)
timd:
Is it possible to use the forkIO primitive to cause pure computations
to be evaluated in parallel threads?
It seems to me that laziness would always prevent any evaluation until
the result was used in a consuming thread (and hence would occur
serially, in that thread).
Try `par` and
If people write any new variants, please add them to:
http://haskell.org/haskellwiki/The_Fibonacci_sequence
:)
westondan:
Throwing in a trace statement in fibaux tells me that fibaux i a b c is
not being memoized. If I do map fib [7..9], fibaux counts down to 0
afresh for each of 7, 8,
andrewcoppin:
Tim Docker wrote:
Is it possible to use the forkIO primitive to cause pure computations
to be evaluated in parallel threads?
Somebody correct me here - I was under the impression that you only ever
need forkIO if you're doing something strange with FFI, and usually you
lrpalmer:
On Nov 5, 2007 8:11 PM, Alex Young [EMAIL PROTECTED] wrote:
{--}
module Main where
import Random
import System.Environment
import List
import Monad
randMax = 32767
unitRadius = randMax * randMax
rand :: IO Int
joelr1:
Is there such a thing as memory-mapped arrays in GHC?
I'm looking for something that would let me memory-map a file of
floats and access it as an array.
There's a commented out mmapFile for ByteString in Data.ByteString's
source. Use that, and then extract the ForeignPtr from the
bos:
I've packaged up the fast Boyer-Moore and Knuth-Morris-Pratt code that
Chris Kuklewicz posted a few months ago:
http://article.gmane.org/gmane.comp.lang.haskell.libraries/7363
The consensus at the time was that the code was not ready for rolling
into the bytestring package, but
vigalchin:
Hello,
I was watching Simon Peyton-Jones' video on A Taste of Haskell
Part 1. .. Is there any paper discussing the architecture? I am not afraid
to read code but sometimes a paper overview is good ...
Regards, Vasya
There's one quick paper describing the
andrewcoppin:
Don Stewart wrote:
dpiponi:
I was getting about 1.5s for the Haskell program and about 0.08s for
the C one with the same n=10,000,000.
I'm sure we can do better than that!
That's the spirit! :-D
Speaking of which [yes, I'm going to totally hijack
nominolo:
On Thu, 2007-11-08 at 10:33 -0800, Dan Piponi wrote:
I see lots of shootout examples where Haskell programs seem to perform
comparably with C programs, but I find it hard to reproduce anything
like those figures when testing with my own code. So here's a simple
case:
I have
thomas.dubuisson:
Glad you asked!
http://sequence.complete.org/node/367
I just posted that last night! Once I get a a community.haskell.org
login I will put the code on darcs.
Cool. I'll look at this.
You might like to test against,
dpiponi:
On Nov 8, 2007 11:34 AM, Jason Dusek [EMAIL PROTECTED] wrote:
Can you show us your compilation options and timings?
I was simply using -O3. I tried a bunch of other flags (copied from
the shootout examples) but they made no appreciable difference.
Argh, -O2 please. -O3 does
dpiponi:
I see lots of shootout examples where Haskell programs seem to perform
comparably with C programs, but I find it hard to reproduce anything
like those figures when testing with my own code. So here's a simple
case:
I have this C program:
#include stdio.h
#define n 1
dpiponi:
On Nov 8, 2007 12:16 PM, Don Stewart [EMAIL PROTECTED] wrote:
If you can post the code somewhere, that would be great, with examples
of how to reproduce your timings.
The code is exactly what I posted originally (but nore that n is 10
times larger in the C code). I compiled
bulat.ziganshin:
Hello Don,
Thursday, November 8, 2007, 10:53:28 PM, you wrote:
a - newArray (0,n-1) 1.0 :: IO (IOUArray Int Double)
forM_ [0..n-2] $ \i - do { x - readArray a i; y - readArray a
(i+1); writeArray a (i+1) (x+y) }
oh, i was stupid. obviously, first thing you
xj2106:
Don Stewart [EMAIL PROTECTED] writes:
Can you start by retrying with flags from the spectral-norm benchmark:
http://shootout.alioth.debian.org/gp4/benchmark.php?test=spectralnormlang=ghcid=0
The interaction with gcc here is quite important, so forcing -fvia-C
andrewcoppin:
Thomas Schilling wrote:
On Thu, 2007-11-08 at 18:34 +, Andrew Coppin wrote:
Neil Mitchell wrote:
Windows and Haskell is not a well travelled route, but if you
stray of
the cuddly installer packages, it gets even worse.
Is that why Cabal packages
bulat.ziganshin:
definitely, it's a whole new era in low-level ghc programming
victory!
-- Don :D
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
1 - 100 of 1711 matches
Mail list logo
