Malcolm Wallace wrote:
Simon Marlow <[EMAIL PROTECTED]> wrote:
Another part of our vague debugging plan was to add a cheap form of
cost-centre stacks to the byte code interpreter, so that you could
always get a backtrace at a breakpoint or an exception. We don't know
what this "cheap form of CCS" would look like, though.
I do! It would look a lot like a cut-down version of the Hat trace
format.
Neat, I'll take a look. Where's the best place to get an overall
description of how it works? Does it give you a lexical call stack, or
a dynamic call stack? (I'm after the former)
I'm particularly interested in what happens with CAFs, and what the
backtrace looks like for higher order functions - these are the parts we
have difficulty with in CCSs.
Cheers,
Simon
_______________________________________________
Cvs-ghc mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/cvs-ghc
