Re: Seeking for papers about tagged types vs access to subprograms

["Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr>]

Le Fri, 10 May 2013 16:27:42 +0200, Dmitry A. Kazakov  
<mailbox@dmitry-kazakov.de> a écrit:
>> The time required for a computation, the memory used, are not part of  
>> the
>> semantic.
>
> It is for RT or else irrelevant.
>
>> Computational complexity is not semantic.
>
> And so irrelevant.

I've never asserted semantic is everything (and even suggested the  
opposite). Runtime properties is another aspect. Not the same methods, not  
the same formalisms, these are orthogonal aspects (or more or less).


> Because it is impossible to do. When meant seriously beyond academic
> exercises, it is most likely undecidable, incomputable, halting etc.

That's not impossible nor academic only, that's used for real life case (I  
gave an example, there are many others). Generating program from  
specification does not prevent nor disallow proofs of bounded runtime  
requirement.


-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University