> GHC has profiling support.
> (By the way, many mail servers these days discard mail with no subject.)
> I've seen a number of papers comparing the speed of Haskell code to code of other functional languages; there is a periodic "shoot out" with ocaml.
> Some probably have comparisons with imperative languages, and, even if they do not, the methodology should help you.
> Seth Kurtzberg
> On Mon, 5 Feb 2007 11:28:03 -0800 (PST)
> Tays Soares <[hidden email]> wrote:
> > Hello everyone,
> > I did at my master thesis a compiler that generates Haskell code. Now I need to measure the execution time of my generated code and I've been searched and I don't know if I'm looking with the wrong keywords but I could not find anything. I just need to measure the time of simple functions, like Ackermann and Fibonacci. Does anyone know how to measure the execution time of a Haskell program or function?
> > Thank you,
> > Tays
> > __________________________________________________
> > Fale com seus amigos de gra?a com o novo Yahoo! Messenger
> > http://br.messenger.yahoo.com/ > _______________________________________________
> Glasgow-haskell-users mailing list
> [hidden email] > http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
I think "Haskell GHC #2" doesn't play by the rules:
diff program output for this 6KB input file with this output file to
check your program is correct before contributing.
Each program should be implemented the same way as this Icon program.
The sum-file benchmark measures line-oriented I/O and string conversion.
Each program should:
* read integers from stdin, one line at a time
* print the sum of those integers
Programs should use built-in line-oriented I/O functions rather than
custom-code. No line will exceed 128 characters, including newline.
Reading one line at a time, the programs should run in constant space.