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.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c7ea1cb7a2beb2ee X-Google-Attributes: gid103376,public From: William A Whitaker Subject: Re: Disallowing Pre-Defined Operations Date: 2000/03/17 Message-ID: <38D2E598.262D1CD5@erols.com>#1/1 X-Deja-AN: 599007594 Content-Transfer-Encoding: 7bit References: <8a9eeg$qtv$1@newpoisson.nosc.mil> X-Accept-Language: en,fr Content-Type: text/plain; charset=us-ascii X-Complaints-To: abuse@rcn.com X-Trace: 44pPx/pm2Q1Ei8PJdeAcoRBnIzLuRZIJEkcMAJ3ywxI= Mime-Version: 1.0 Reply-To: whitaker@erols.com NNTP-Posting-Date: 18 Mar 2000 02:10:57 GMT Newsgroups: comp.lang.ada Date: 2000-03-18T02:10:57+00:00 List-Id: I have not been following this thread carefylly. I had no idea it would go on so long. But I would like to toss in a study I did ten years ago along this line for the units problem. This is at http://www.erols.com/whitaker/metric.sty A lot of the intermediate code is left out, only a "final" version given, but discussion is extensive. The study was a failure in the sense that the answer was that while one could do such things (including forbidding unwanted operations) it was completely impractical in a standards situation where one expects lots of unknowable combinations. If the problem was just three units and seven operations, then one could afford this nonsense. I believe that discriminants are teh only practical way to get close to the desired result, and I will try to post a paper on that soon. Of course, the ideal is an Ada recognition of the Units requirement and implementation at the standard/compiler level. Whitaker