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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,c4cb2c432feebd9d X-Google-Thread: 1094ba,c4cb2c432feebd9d X-Google-Attributes: gid103376,gid1094ba,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news3.google.com!news.glorb.com!news.hub.org!lon-transit.news.telstra.net!lon-in.news.telstra.net!news.telstra.net!news-server.bigpond.net.au!53ab2750!not-for-mail From: "robin" Newsgroups: comp.lang.ada,comp.lang.fortran References: Subject: Re: Ada vs Fortran for scientific applications X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2800.1106 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 Message-ID: Date: Wed, 24 May 2006 05:26:37 GMT NNTP-Posting-Host: 144.139.71.210 X-Complaints-To: abuse@bigpond.net.au X-Trace: news-server.bigpond.net.au 1148448397 144.139.71.210 (Wed, 24 May 2006 15:26:37 EST) NNTP-Posting-Date: Wed, 24 May 2006 15:26:37 EST Organization: BigPond Internet Services Xref: g2news2.google.com comp.lang.ada:4402 comp.lang.fortran:10172 Date: 2006-05-24T05:26:37+00:00 List-Id: "Nasser Abbasi" wrote in message news:sxlcg.75860$F_3.64697@newssvr29.news.prodigy.net... > > "Dan Nagle" wrote in message > news:tHkcg.6937$kR6.484@trnddc05... > > >> 11) Operators on any types, including arrays. Define a matrix product as > >> "*"... > > > > How is Ada's operators for types better or worse than Fortran's? > > Is Ada's "*" operator better than Fortran's matmul()? > > I'll answer the easy one for now since I have not had my coffee yet: > > It is clear that > > A*B > > is easier to read and understand than > > MATMUL(A,B) > > would you not agree? But a casual user would ask, does A*B mean term by term or matrix product? If one, then how is the other distinguished? A casual user would probably recognize MATMUL as being matrix multiplication, not term by term.