Why CTFE is context-sensitive?

Timon Gehr timon.gehr at gmx.ch
Tue Jan 28 08:29:24 PST 2014


On 01/28/2014 05:18 PM, "Ola Fosheim Grøstad" 
<ola.fosheim.grostad+dlang at gmail.com>" wrote:
>
>>  Anyway, the reasoning does not hold anyway, because there is an
>> inifinite number
>>> of programs that can be proved to terminate… So you just do those
>>> instead!
>>
>> I assume you mean finite.
>
> No, only if you assume finite resources. Proof is trivial: you can just
> add an infinite number of NOPs (like a= a+1-1) without affecting semantics.

_Now_ you mean finite. :o)

(In any case, there is even an infinite number of programs that are not 
behaviourally equal but can be automatically proved to terminate by one 
and the same algorithm.)


More information about the Digitalmars-d mailing list