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=0.6 required=5.0 tests=BAYES_05,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU Path: utzoo!linus!decvax!ittatc!dcdwest!sdcsvax!ucbvax!jpl-vlsi.arpa!larry From: larry@JPL-VLSI.ARPA Newsgroups: net.lang.ada Subject: ...Ada Technology... Message-ID: <8604010641.AA14073@ucbvax.berkeley.edu> Date: Mon, 31-Mar-86 22:34:36 EST Article-I.D.: ucbvax.8604010641.AA14073 Posted: Mon Mar 31 22:34:36 1986 Date-Received: Wed, 2-Apr-86 08:32:56 EST Sender: daemon@ucbvax.BERKELEY.EDU Organization: The ARPA Internet List-Id: The only thing I would add to Ed Berard's comments is some comments of my own on the myth of Ada's complexity. I don't mean that Ada is NOT complex; rather I think we tend to underestimate the complexity of our favorite languages. We usually know them so well that we forget the trouble we had bending our mindsaround the new syntax and semantics of the language. Further, we usually have to get deeply involved with an operating system. In ForTran, for instance, to do real-time programming you have to have available and understand the interac- tions of a dozen or two subprograms, typically the ISA (Industrial Society of America, I believe) standard extensions. Another universe of examples could be given in the C language. I'm peripherallyinvolved in the process of porting a number of SW tools from Berkely Unix to AT&T System V Unix and VAX-11 VMS. What a headache that is. There are at leastthree major types of concurrency involved and several variations on each