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 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4961da398a273222
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-03-09 17:20:19 PST
Path: 
 bga.com!news.sprintlink.net!cs.utexas.edu!news.cs.utah.edu!news.cc.utah.edu!cs.weber.edu!val
From: val@cs.weber.edu (Val Kartchner)
Newsgroups: comp.lang.ada
Subject: Re: Ada self-referential operators
Date: 8 Mar 1995 23:26:21 GMT
Organization: Weber State University, Ogden, Utah
Message-ID: <3jleet$1l2@news.cc.utah.edu>
References: <3gnkjb$gso@miranda.gmrc.gecm.com>
 <3hnoe6$1aoi@info4.rus.uni-stuttgart.de> <3ht1cp$jgt@gnat.cs.nyu.edu>
 <3id9qi$a7m@usenet.srv.cis.pitt.edu>
NNTP-Posting-Host: cs.weber.edu
Date: 1995-03-08T23:26:21+00:00
List-Id: <comp.lang.ada>

In article <3id9qi$a7m@usenet.srv.cis.pitt.edu>,
Jacob S. Andersen <sparre+@pitt.edu> wrote:
>Some comments to the proposal about the proposal for automatic generation of 
>relational operators (">", "<", ">=" and "<=").
>
>I too would like this in Ada [....]

This would mean that the compiler would be behaving in a reasonable,
predictable way, but not under the explicit command of the programmer.
This would be akin to automatic type conversions.  It is not the Ada way
to do something implicitly just for the convenience of the programmer.

-- 
|================= #include <stddisclaimer.h> ================/// KB7VBF/P11 =|
| "AMIGA: The computer for the creative mind" (tm) Commodore /// Weber State  |
| "Macintosh: The computer for the rest of us"(tm) Apple \\\///   University  |
|=== "I think, therefore I AMiga" -- val@cs.weber.edu ====\///= Ogden UT USA =|