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-Thread: 103376,fc52c633190162e0 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!news2.google.com!news.glorb.com!news.mv.net!nntp.TheWorld.com!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: why learn C? Date: Thu, 12 Apr 2007 14:27:01 -0400 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <1172144043.746296.44680@m58g2000cwm.googlegroups.com> <1172161751.573558.24140@h3g2000cwc.googlegroups.com> <546qkhF1tr7dtU1@mid.individual.net> <5ZULh.48$YL5.40@newssvr29.news.prodigy.net> <1175215906.645110.217810@e65g2000hsc.googlegroups.com> <1175230352.808212.15550@e65g2000hsc.googlegroups.com> <1175236212.771445.135460@y66g2000hsf.googlegroups.com> <1175308871.266257.77460@e65g2000hsc.googlegroups.com> <1175499821.557815.303270@y80g2000hsf.googlegroups.com> <1175511246.9702.24.camel@localhost> NNTP-Posting-Host: shell01.theworld.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: pcls6.std.com 1176402421 14072 192.74.137.71 (12 Apr 2007 18:27:01 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Thu, 12 Apr 2007 18:27:01 +0000 (UTC) User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (irix) Cancel-Lock: sha1:5TpDP7EXUR0wzm2M65ZwLNyv38k= Xref: g2news1.google.com comp.lang.ada:14953 Date: 2007-04-12T14:27:01-04:00 List-Id: Hyman Rosen writes: >...Having dynamic types is what leads to Ada's > requirement of explicit instantiation. I don't understand that. Ada's types are entirely compile time, and generic instantiation happens at compile time. It is true that Ada's subtypes can have dynamic constraints, and when you pass one to a generic, there is some data stored at run time (array bounds or whatever). But I don't see any way in which that would prevent me from designing an Ada-like language with implicit instantiation. I think implicit instantiation is probably a good idea. As you said in another post, it's something like overloading of subprograms, and I think it can be designed so that it's not too error prone. If I remember, the C++ rules include preference rules, though. Is that correct? Preference rules can cause Beaujolais effects, which in my opinion are very bad. - Bob