On 2/5/07, Kirsten Chevalier <[EMAIL PROTECTED]> wrote:
On 2/5/07, Tays Soares <[EMAIL PROTECTED]> 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?
Another post (where someone didn't change the subject line) mentioned looking at existing research in order to get an idea of what methodology people used for profiling, so while we're at it, I might as well plug my own master's thesis, where, in chapter 4, I wrote about how I measured the performance of a Haskell optimization I implemented externally to GHC: http://lafalafu.com/krc/Writing/chevalier_ms_2004_type_inference.pdf Maybe it'll be helpful to you. Cheers, Kirsten -- Kirsten Chevalier* [EMAIL PROTECTED] *Often in error, never in doubt "What doesn't kill you makes you look really, really bad."--Carrie Fisher _______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
