From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=0.1 required=3.0 tests=BAYES_05,NICE_REPLY_A,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.6
Path: eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: "G.B." <bauhaus@notmyhomepage.invalid>
Newsgroups: comp.lang.ada
Subject: Re: calling function but ignoring results
Date: Fri, 9 Jul 2021 20:14:07 +0200
Organization: A noiseless patient Spider
Message-ID: <sca3lg$de5$1@dont-email.me>
References: <69a59fdc-72bb-4202-99fc-d776530de653n@googlegroups.com>
 <sbftm5$1gn$1@dont-email.me> <sbg04v$i7i$1@gioia.aioe.org>
 <sbh1lf$i1c$1@franka.jacob-sparre.dk>
Reply-To: nonlegitur@notmyhomepage.de
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 9 Jul 2021 18:14:08 -0000 (UTC)
Injection-Info: reader02.eternal-september.org; posting-host="a72b7055ca4d63c93f2dd0e320924cec";
	logging-data="13765"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18B+D0csjVa+fbJYEozCvNFnoPDimd7k4w="
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:78.0)
 Gecko/20100101 Thunderbird/78.11.0
Cancel-Lock: sha1:m0mtJS7tgd9ZCL4mEelU+T7+14k=
In-Reply-To: <sbh1lf$i1c$1@franka.jacob-sparre.dk>
Content-Language: en-US
Xref: reader02.eternal-september.org comp.lang.ada:62367
List-Id: <comp.lang.ada>

On 30.06.21 08:06, Randy Brukardt wrote:

> In Ada 202x, renaming is easier (assuming the usual case where overloading
> isn't involved):
> 
>     declare
>        Ignore renames Foo (Baz);
>     begin
>        null;
>     end;

Is this "type-less" naming a copy of the popular omission schemes
like auto in C++? Optional type annotations in Swift, or Scala?
Too many of those omissions have invited, uhm, a number of things.

They'll be good, for sure, when securing the workplace semantically;
also good for implementors of more complex type inference algorithms
and, consequently, for makers of the CPUs that are needed to properly
handle the omissions. I think the proper number of omissions is
a subject of research at ETH Zürich. They are trying to find
a sweet spot that makes inference finish in reasonable time.