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,f51e93dacd9c7fca
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-06-19 11:07:21 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!iad-peer.news.verio.net!news.verio.net!iad-read.news.verio.net.POSTED!bpr.best.vwh.net!bpr
Newsgroups: comp.lang.ada
From: Brian Rogoff <bpr@bpr.best.vwh.net>
Subject: Re: status of Ada STL?
In-Reply-To: <3D10B40F.2060201@mail.com>
Message-ID: <Pine.BSF.4.40.0206191802480.7629-100000@bpr.best.vwh.net>
References: <bebbba07.0206132321.23d72ac8@posting.google.com>
 <aedgoc$to7$1@news.iucc.ac.il>
 <bebbba07.0206151051.1c25cf1e@posting.google.com>
 <uu1o31wbb.fsf@wanadoo.fr> <bebbba07.0206161023.6073fd3a@posting.google.com>
 <3d0ce154_5@news.bluewin.ch>
 <bebbba07.0206162120.3acf4278@posting.google.com>
 <d%gP8.23130$gm5.4370500@news11-gui.server.ntli.net>
 <bebbba07.0206172212.4bc5cc3a@posting.google.com>
 <z%BP8.1523$AZ6.154892@news6-win.server.ntlworld.com>
 <bebbba07.0206181904.77b82c98@posting.google.com> <3D10B40F.2060201@mail.com>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Date: Wed, 19 Jun 2002 18:07:16 +0000
NNTP-Posting-Host: 192.220.65.223
X-Complaints-To: abuse@verio.net
X-Trace: iad-read.news.verio.net 1024509802 192.220.65.223 (Wed,
 19 Jun 2002 18:03:22 GMT)
NNTP-Posting-Date: Wed, 19 Jun 2002 18:03:22 GMT
Organization: Verio
Xref: archiver1.google.com comp.lang.ada:26412
Date: 2002-06-19T18:07:16+00:00
List-Id: <comp.lang.ada>

On Wed, 19 Jun 2002, Hyman Rosen wrote:
> Not only has it gone somewhere, it went there on steroids.
> And it's all doable using existing C++ (albeit to its full
> extent), so it doesn't require language changes. See
> <http://www.oonumerics.org/blitz/whatis.html>.
>
> Check out <http://www.boost.org/libs/lambda/doc/index.html>
> while you're at it.
>
> Automatic template instanciation and partial specialization of
> templates form an incredibly useful and powerful tool. (It's
> actually Turing-complete!) It's my favorite aspect of C++.

I believe you are mistaken, though I haven't looked at C++ in a long time.
I was told that template instantiation is now limited by some arbitrary
constant (17?) so as to avoid the problem with non-halting compilation.
Is that true?

For those of you who care about such stuff, a similar approach is used
in type inference approaches that support polymorphic recursion (a la
Mycroft and O'Keefe) to prevent nonterminating compilation.

-- Brian