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

I am trying to write out the execution of the recursive calls in mkDList example 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?

    http://www.haskell.org/ghc/docs/latest/html/users_guide/ghci-debugger.html

If you have tried, but it didn't satisfy your needs, could you explain what is lacking?