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,897417b380f5731e X-Google-Attributes: gid103376,public From: Hyman Rosen Subject: Re: STL, Ada, C++ (Was Re: The Next Microsoft?) Date: 2000/05/09 Message-ID: #1/1 X-Deja-AN: 621256552 Sender: hymie@calumny.jyacc.com References: <8eu0ob$7qv$1@nnrp1.deja.com> <391328F0.1221@synquiry.com> <39133213.64A@Ganymede.com> <8f50hc$hpo$1@nnrp1.deja.com> <8f83i2$osk$1@slb1.atl.mindspring.net> X-Complaints-To: abuse@panix.com X-Trace: news.panix.com 957902690 25927 209.49.126.226 (9 May 2000 20:04:50 GMT) Organization: PANIX Public Access Internet and UNIX, NYC NNTP-Posting-Date: 9 May 2000 20:04:50 GMT Newsgroups: comp.lang.ada Date: 2000-05-09T20:04:50+00:00 List-Id: Brian Rogoff writes: > Overloading, runtime dispatching, and "use clauses" don't seem quite > as focused on safety either. The only way that automatic instantiation > is troubling is that in the case of a language like C++ it is undecidable, > I think in standard C++ they limit the depth of template expansion > (Hyman?) and I imagine a similar solution would be needed for Ada. The C++ Standard requires support for a minimum of 17 levels of templates. The GNU compiler has a command-line argument to specify what depth you want if you need more. Undecidability isn't really a problem, since failure to terminate simply means that you don't get a compiled program, as opposed to getting an incorrect one.