Why I chose D over Ada and Eiffel

[Walter Bright]

On 8/22/2013 7:52 PM, Manfred Nowak wrote:
> Walter Bright wrote:
>> semantically identical
>
> This would be equivalent to finding plagiarisms and result in a semantical
> compression of a software base---and seems to be computational intractable
> unless severely restricted.

I don't think it would be that hard. The structure of the ASTs would need to 
match, and the types would have to match depending on the operation - for 
example, a + gives the same result for signed and unsigned types, whereas < does 
not.