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: a07f3367d7,f135b0b2991e6686 X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news1.google.com!volia.net!news2.volia.net!feed-A.news.volia.net!border1.nntp.ams.giganews.com!nntp.giganews.com!feeder.news-service.com!feeder1.cambriumusenet.nl!feed.tweaknews.nl!193.141.40.65.MISMATCH!npeer.de.kpn-eurorings.net!npeer-ng0.de.kpn-eurorings.net!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Wed, 09 Sep 2009 16:47:34 +0200 From: Georg Bauhaus User-Agent: Thunderbird 2.0.0.23 (Macintosh/20090812) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: C++0x : no 'concepts' References: <0157a9fd-a1b2-473d-bc85-f84911720520@o41g2000yqb.googlegroups.com> <4aa79ba6$0$32663$9b4e6d93@newsspool2.arcor-online.net> <1myjt3v3dwqj3.1t8nncvu2ty3l$.dlg@40tude.net> In-Reply-To: <1myjt3v3dwqj3.1t8nncvu2ty3l$.dlg@40tude.net> Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Message-ID: <4aa7c007$0$30230$9b4e6d93@newsspool1.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 09 Sep 2009 16:47:35 CEST NNTP-Posting-Host: 1f774c33.newsspool1.arcor-online.net X-Trace: DXC=>A[IF_;5[Qg_0Po7BmQ3]lic==]BZ:afn4Fo<]lROoRa^YC2XCjHcbiTBNimU?D:dc;9OJDO8_SKfNSZ1n^B98ijV7O;26ONXOb X-Complaints-To: usenet-abuse@arcor.de Xref: g2news2.google.com comp.lang.ada:8251 Date: 2009-09-09T16:47:35+02:00 List-Id: Dmitry A. Kazakov schrieb: >> Fantasizing, could we have, in Ada, >> >> - recursive instantiations of pure generics? > > Huh, the second edition of interfaces, now for the "Ada preprocessor"? I > read you that all instances of the same body when instantiated > automatically will be considered "same". Right? No, I was thinking of this: generic N : Natural := (if N = 0 then 1 else new Factorial'(N * Factorial(N - 1))); function Factorial return Positive; pragma Pure(Factorial); (Very much ad hoc.)