write-time call tree?

[Diez B. Roggisch]

> One can even make the claim that such analysis requires a solution
> to the halting problem, which is as of yet unsolved, and believed to be
> unsolvable.

Its proven that it can't be solved. Turing did it 1936. Your conclusion is
thus right of course.

Thats one of the most annoying "features" of java: Their attempt to make
code-reachablility checks when compiling. As hints, these might be ok - but
as you said, it's an instance of the halteproblem, so they cannot solve it.
But having heuristics that nevertheless try it makes code generators using
java more complicated than necessary, cluttering the code with if(true)
statements and the like.


-- 
Regards,

Diez B. Roggisch