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/16
Message-ID: <Pine.SGI.3.95.970916190053.19184D-100000@shellx.best.com>#1/1
X-Deja-AN: 273139984
References: <340E2DC5.25D7@worldnet.att.net> <EGEv58.7pn@world.std.com>
 <mheaney-ya023680001309970036280001@news.ni.net> <EGIJ8B.MyM@world.std.com>
X-Trace: 874461961 29757 (none) 206.86.0.12
Newsgroups: comp.lang.ada
Date: 1997-09-16T00:00:00+00:00
List-Id: <comp.lang.ada>


On Sun, 14 Sep 1997, Robert A Duff wrote:
> In article <mheaney-ya023680001309970036280001@news.ni.net>,
> Matthew Heaney <mheaney@ni.net> wrote:
> Me too.
> 
> >...Why do so many language designers think less of
> >function return types?
> 
> Perhaps because it's harder to implement.  In C++, you can do overload
> resolution in a single bottom up pass.  Start at the leaves of the
> expression, and propagate the type of each expression up.  In Ada, you
> need to propagate *sets* of types (or sets of interpretations, or some
> such) up the tree, and then you have to do a second (top down) pass to
> propagate the information back to the leaves.

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