On 12/08/2013 07:53 PM, Walter Bright wrote:
On 12/8/2013 2:13 AM, Araq wrote:
From this list only (7) is a valid point. All the others can be
trivially dealt
with whole program optimization (1,2,3)
If it's trivial, it's not happening. (1) would require solving the
halting problem. ...
No it would not. If all you need to do is catching up with D, just infer
where immutability qualifiers should go. This is decidable (the search
space is finite). Of course, an analysis of this style could infer more
fine-grained global aliasing information anyway.
