Hi Rob, Just to add further comment to what Neil said: 1) Indeed, there is no need for backward jumps so they were deliberately not included. (This makes several of the compiler analyses easier too). Compared to verification of Java verification of YHC should be quite easy for the simple reason that YHC does not include support for unboxed integers, so all variables on the stack must always be pointers to heap nodes (or stack frames). 2) I plan to document my implementation of concurrency on the wiki soon. Since it changes some of the docs. Since the effect of concurrency on non-concurrent programs is fairly small support for concurrency will become part of the standard build soon :-) Cheers :-) Tom Robert Dockins wrote:
Hello YHC hackers,
I've been looking pretty closely at YHC and I have a couple of questions:
1) I'm interested in the possibility of doing Java-style verification of bytecode, so I've been studying the bytecode docs. Looking at the bytecodes, I notice that all the jump bytecodes seem to indicate that jumps are always forward jumps. Upon reflection it makes perfect sense, but I want to make sure that is a conscious design decision. It certainly makes the kinds of analysis I'm interested in easier...
2) I notice that concurrency is a big unclaimed todo item. Are there any concrete plans in this direction? I'm sort of interested in this, but before I think about it too much, I was wondering what has and has not been thought about/done so far.
Thanks! Rob Dockins _______________________________________________ Yhc mailing list Yhc@haskell.org http://haskell.org/mailman/listinfo/yhc