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, MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,bcdac28207102750 X-Google-Attributes: gid103376,public From: Robert Dewar Subject: Re: Ada95 speed Date: 1999/06/07 Message-ID: <7jgol9$qd8$1@nnrp1.deja.com>#1/1 X-Deja-AN: 486673446 References: <7jer69$j8n@lotho.delphi.com> <7jf27g$94g$1@nnrp1.deja.com> X-Http-Proxy: 1.0 x29.deja.com:80 (Squid/1.1.22) for client 166.72.71.254 Organization: Deja.com - Share what you know. Learn what you don't. X-Article-Creation-Date: Mon Jun 07 15:31:52 1999 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I) Date: 1999-06-07T00:00:00+00:00 List-Id: In article , "David C. Hoos, Sr." wrote: > It doesn't take much to realize that a language which has > matrix inversion as a primitive, is a pretty high-level > language. That's actually a poor example, any language can add a matrix inversion function easily enough, and you are implying that all you are talking about is syntactic sugar. But in fact, the "very-high-level-ness" of APL is much deeper, involving higher order operators, and a very dynamic view of data and memory. If you tried to make an APL package, it is in these areas that you would have fundamental difficulties. Sent via Deja.com http://www.deja.com/ Share what you know. Learn what you don't.