[Haskell-cafe] Is there a way to see the equation reduction?

Bernie Pope florbitous at gmail.com
Tue Mar 31 21:49:26 EDT 2009

2009/4/1 Daryoush Mehrtash <dmehrtash at gmail.com>

> I am trying to write out the execution of the recursive calls in mkDList
> example<http:/http://www.haskell.org/haskellwiki/Tying_the_Knot/www.haskell.org/haskellwiki/Tying_the_Knot>for different size lists.  Is there a way in ghc, or ghci where for a given
> list I can see the intermediate recursive and evaluation steps?

Have you tried stepping through the code using the GHCi debugger?


If you have tried, but it didn't satisfy your needs, could you explain what
is lacking?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090401/d14ebf61/attachment.htm

More information about the Haskell-Cafe mailing list