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

[Daryoush Mehrtash]

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?

thanks,

Daryoush
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090331/37d4caf9/attachment.htm