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

I am trying to write out the execution of the recursive calls in mkDList examplehttp:/http://www.haskell.org/haskellwiki/Tying_the_Knot/www.haskell.org/hask...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