There is Hood [11 and its graphical front-end GHood [2]. I have never
used them myself however, only seen them demonstrated. Normally, using
Debug.Trace is enough for me.
[1] http://www.ittc.ku.edu/csdl/fpg/Tools/Hood
[2] http://community.haskell.org/~claus/GHood/
Thomas
Am 10.10.2012
I have been given a piece of code that uses Tie-ing the Knot concept to
label a tree of nodes in breath first manner. It seems to work fine, but
I am having trouble expanding the code on my own to see the evaluation
process. I like to know if there is a tools to use to see
the reduction
Hi Daryoush,
You could add another case to label, importing Debug.Trace:
data Tree = Leaf | Node Tree Int Tree deriving Show
*label t | trace (show $ label ++ show t) False = undefined*
label (Node ln _ rn) ((h:r):rest) = (Node lr h rr, r:r2) where
