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
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
