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 21:28:24 PST Path: nntp.gmd.de!newsserver.jvnc.net!nntpserver.pppl.gov!princeton!udel!gatech!bloom-beacon.mit.edu!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: 21 Jan 1995 00:28:24 -0500 Organization: Courant Institute of Mathematical Sciences Message-ID: <3fq61o$l7q@gnat.cs.nyu.edu> References: <3f3rl7$kts@watnews1.watson.ibm.com> <3fduto$ta7@watnews1.watson.ibm.com> <3fj8gs$h9b@watnews1.watson.ibm.com> NNTP-Posting-Host: gnat.cs.nyu.edu Date: 1995-01-21T00:28:24-05:00 List-Id: Mats says: "So sad ! I think it is the biggest defect I know of in Ada 95." [it is not having introduced the upwards incompatible feature of user defined equality being compositional] Gosh Mats, if that's the biggest defect, then Ada 95 must be in *very* good shape!