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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ca0b11ae1c9a00cb
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Papers saying Ada as an overly complex language and hard to
 implement
Date: 1998/02/22
Message-ID: <dewar.888196787@merv>#1/1
X-Deja-AN: 327680097
References: <34E7B551.115C289F@cs.utexas.edu> <dewar.887600858@merv>
 <34E8AA02.7ED447E0@cs.utexas.edu> <dewar.887670974@merv>
 <34E91572.CE9CEED2@cs.utexas.edu> <dewar.887723305@merv>
 <34EB634F.2EDF9B80@cs.utexas.edu> <6cftm9$1p9@saturn.brighton.ac.uk>
 <01bd3fc8$13722a20$0f02000a@luisespi>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 888196970 19800 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-02-22T00:00:00+00:00
List-Id: <comp.lang.ada>


Luis said

<<Maybe these four papers don't exists at all. This reminds me of Fermat's
Last Theorem;
he claimed that he had the solution for the problem, yet never published.
Did he really had it?
Do these four papers exists at all?

Luis Espinal.
>>


Probably the questioner is no longer around. He was tasked by his boss
to find papers critical of Ada, he found some, and his job is done :-)