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.2 required=5.0 tests=BAYES_00,FROM_WORDY, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,fd3a5ba6349a6060 X-Google-Attributes: gid103376,public From: "Nick Roberts" Subject: Re: should I be interested in ada? Date: 1999/02/19 Message-ID: <7aingo$orv$2@plug.news.pipex.net>#1/1 X-Deja-AN: 445943658 References: <7a72e6$g55$1@probity.mcc.ac.uk> <36C93BB4.1429@ecs.soton.ac.uk> <7afc1o$3mi$2@plug.news.pipex.net> <7afttr$7v3$1@nnrp1.dejanews.com> <7aganu$qsc$1@plug.news.pipex.net> <7ai4rb$5vn$1@nnrp1.dejanews.com> X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Organization: UUNET WorldCom server (post doesn't reflect views of UUNET WorldCom) Newsgroups: comp.lang.ada Date: 1999-02-19T00:00:00+00:00 List-Id: Perhaps you would care to produce some 'powerful examples' yourself? Bear in mind, my original claim was that "there is nothing that can be done in Fortran that cannot be done in Ada." I didn't say "that cannot be done just as neatly" and I didn't mean it. I just meant "that cannot also be done _reasonably easily_ in Ada." I chose simple examples so as to keep the examples simple, and they are very realistic; examination of typical Fortran programs shows this. I am not an _experienced_ Fortran 90 programmer, and never claimed to be. ------------------------------------- Nick Roberts -------------------------------------