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=3.8 required=5.0 tests=BAYES_00,INVALID_MSGID, RATWARE_MS_HASH,RATWARE_OUTLOOK_NONAME 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: "Luis Espinal" Subject: Re: Papers saying Ada as an overly complex language and hard to implement Date: 1998/02/22 Message-ID: <01bd3fc8$13722a20$0f02000a@luisespi>#1/1 X-Deja-AN: 327576753 References: <34E7B551.115C289F@cs.utexas.edu> <34E8AA02.7ED447E0@cs.utexas.edu> <34E91572.CE9CEED2@cs.utexas.edu> <34EB634F.2EDF9B80@cs.utexas.edu> <6cftm9$1p9@saturn.brighton.ac.uk> Organization: Florida International University Newsgroups: comp.lang.ada Date: 1998-02-22T00:00:00+00:00 List-Id: John English wrote in article <6cftm9$1p9@saturn.brighton.ac.uk>... > > Yongxiang Gao (gyx@cs.utexas.edu) wrote: > > : I'm afraid they are very old. > > Maybe so, but please GIVE US THE CITATIONS! It's no good saying "I've > got four papers" and then when asked which ones saying "they are very > old", we'd actually like to know *which papers* they are... > > ----------------------------------------------------------------- > John English | mailto:je@brighton.ac.uk > Senior Lecturer | http://www.it.bton.ac.uk/staff/je > Dept. of Computing | ** NON-PROFIT CD FOR CS STUDENTS ** > University of Brighton | -- see http://burks.bton.ac.uk > ----------------------------------------------------------------- > 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.