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.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4c86cf2332cbe682
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-20 09:00:01 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!nntpserver.pppl.gov!princeton!udel!gatech!swrinde!pipex!uunet!panix!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Ada.strings.bounded problems?
Date: 20 Jan 1995 12:00:01 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3foq6h$9n3@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no> <D29L78.J9@nntpa.cb.att.com>
 <3f3rl7$kts@watnews1.watson.ibm.com>
 <Mats.Weber-1301952029290001@mlma11.matrix.ch>
 <3fduto$ta7@watnews1.watson.ibm.com>
 <Mats.Weber-1701951908250001@mlma11.matrix.ch>
 <3fj8gs$h9b@watnews1.watson.ibm.com> <1995Jan19.124412@lglsun.epfl.ch>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1995-01-20T12:00:01-05:00
List-Id: <comp.lang.ada>

There would be problems in implementation of generics with shared code if   
equal were always compositional. Certainly a consideration (it would mean
that equality had to be passed in for all types, quite expensive).

Second: it IS possible to define equality on non-limited types in Ada 83
using the generic trick. This trick is well known, and widely used, so you
cannot ignore it in considering upwards compatibility.