From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,39579ad87542da0e
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,UTF8
X-Received: by 10.224.42.141 with SMTP id s13mr18076331qae.3.1368417782003;
        Sun, 12 May 2013 21:03:02 -0700 (PDT)
Path: 
 y6ni37759qax.0!nntp.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!news-in-01.newsfeed.easynews.com!easynews.com!easynews!news-out.news.tds.net!news.ripco.com!feeder.erje.net!eu.feeder.erje.net!news.etla.org!aioe.org!.POSTED!not-for-mail
From: =?utf-8?Q?Yannick_Duch=C3=AAne_=28Hibou57?=
 =?utf-8?Q?=29?=
 <yannick_duchene@yahoo.fr>
Newsgroups: comp.lang.ada
Subject: Re: Seeking for papers about tagged types vs access to subprograms
Date: Fri, 10 May 2013 17:20:54 +0200
Organization: Ada @ Home
Message-ID: <op.wwvjk4equle2fv@cardamome>
References: <op.wv8jh1c1ule2fv@cardamome> <kmbohm$elb$1@loke.gir.dk>
 <p0pf97g5w6xg.jhca6ztjwpde$.dlg@40tude.net> <op.wwq9s4l6ule2fv@cardamome>
 <1bfhq7jo34xpi.p8n2vq6yjsea.dlg@40tude.net> <op.wwrefx1pule2fv@cardamome>
 <cps71yzogw24$.7ol98fxcaurj$.dlg@40tude.net> <op.wwriky0dule2fv@cardamome>
 <nd22gfeezrwf$.tlj4yyygrwq3$.dlg@40tude.net> <kmecg6$et4$1@loke.gir.dk>
 <12gn9wvv1gwfk.10ikfju4rzmnj.dlg@40tude.net> <kmh7d4$up3$1@loke.gir.dk>
 <op.wwumn3r2ule2fv@cardamome> <ebebe368y8s9$.vfm8f23pnkjr.dlg@40tude.net>
 <op.wwu8cmo7ule2fv@cardamome> <1cir6d72wemw.qxx9mozot7hl.dlg@40tude.net>
 <op.wwvb4yczule2fv@cardamome> <ljokf4mmu7eb$.1scqg32yzi4hv.dlg@40tude.net>
 <op.wwvfw8vfule2fv@cardamome> <ql414xt63ugl.1d6nkjnyy90w2.dlg@40tude.net>
NNTP-Posting-Host: uGUognJZXpdb++Da0QvCqg.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: Opera Mail/12.15 (Linux)
X-Notice: Filtered by postfilter v. 0.8.2
X-Received-Bytes: 2710
Content-Type: text/plain; charset=utf-8; format=flowed; delsp=yes
Content-Transfer-Encoding: Quoted-Printable
Date: 2013-05-10T17:20:54+02:00
List-Id: <comp.lang.ada>

Le Fri, 10 May 2013 16:27:42 +0200, Dmitry A. Kazakov  =

<mailbox@dmitry-kazakov.de> a =C3=A9crit:
>> 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, n=
ot  =

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.


-- =

=E2=80=9CSyntactic sugar causes cancer of the semi-colons.=E2=80=9D [1]
=E2=80=9CStructured Programming supports the law of the excluded muddle.=
=E2=80=9D [1]
[1]: Epigrams on Programming =E2=80=94 Alan J. =E2=80=94 P. Yale Univers=
ity