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=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a37:395:: with SMTP id 143mr41659928qkd.317.1565015709548;
        Mon, 05 Aug 2019 07:35:09 -0700 (PDT)
X-Received: by 2002:aca:f256:: with SMTP id q83mr11074897oih.99.1565015709316;
 Mon, 05 Aug 2019 07:35:09 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!news.gegeweb.eu!gegeweb.org!usenet-fr.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!b26no3580828qtq.0!news-out.google.com!a5ni1256qtd.0!nntp.google.com!b26no3580817qtq.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Mon, 5 Aug 2019 07:35:09 -0700 (PDT)
In-Reply-To: <qi3up9$q4d$1@gioia.aioe.org>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=146.5.2.29;
 posting-account=lJ3JNwoAAAAQfH3VV9vttJLkThaxtTfC
NNTP-Posting-Host: 146.5.2.29
References: <qh3ejl$fle$1@gioia.aioe.org> <qi3up9$q4d$1@gioia.aioe.org>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <caae003e-2a33-463b-92b6-8fc9c38b7509@googlegroups.com>
Subject: Re: The answer to "Can Ada replace FORTRAN for numerical computation?
From: Shark8 <onewingedshark@gmail.com>
Injection-Date: Mon, 05 Aug 2019 14:35:09 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Xref: reader01.eternal-september.org comp.lang.ada:56994
Date: 2019-08-05T07:35:09-07:00
List-Id: <comp.lang.ada>

On Saturday, August 3, 2019 at 6:30:36 AM UTC-6, Nasser M. Abbasi wrote:
> There are also significant limitation to Ada as a language
> for scientific computation, in particular with regard to
> dynamic typing and storage allocation.

I think this is referring to things like dynamically-sized arrays, rather t=
han "X is an integer there, now it's a String!" when talking about dynamic-=
typing, as it's obvious that the latter would obliviate the aforementioned =
properties of finding conceptual errors.

As to the storage-allocation, I suspect it is also referring to Ada arrays =
needing definite bounds in certain cases -- the ability to return properly-=
sized arrays from a function *should* be enough to ease this complaint *EXC=
EPT*, perhaps, when dealing with Very Large Arrays.