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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8f8cea8602e61aba
X-Google-Attributes: gid103376,public
From: Brian Rogoff <bpr@shellx.best.com>
Subject: Re: The Red Language
Date: 1997/09/18
Message-ID: <Pine.SGI.3.95.970918183641.18953B-100000@shellx.best.com>#1/1
X-Deja-AN: 273658563
References: <340E2DC5.25D7@worldnet.att.net> <EGEv58.7pn@world.std.com>
 <mheaney-ya023680001309970036280001@news.ni.net> <EGIJ8B.MyM@world.std.com>
 <Pine.SGI.3.95.970916190053.19184D-100000@shellx.best.com>
 <dewar.874578510@merv>
X-Trace: 874633245 27740 (none) 206.86.0.12
Newsgroups: comp.lang.ada
Date: 1997-09-18T00:00:00+00:00
List-Id: <comp.lang.ada>


On 18 Sep 1997, Robert Dewar wrote:
> Brian said
> 
> <<Is this second pass strictly necessary? I seem to remember reading that it
> is possible to do overload resolution in one pass in Ada.
> 
> -- Brian>>
> 
> You remember wrong, yes, of course you need to go up the tree once and
> then down, this is fundamental and obvious if you think about it.

Sheesh, after I had forgiven you, too :-). See my reply to Bob Duff.

-- Brian