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,799e6e37c90ca633 X-Google-Attributes: gid103376,public From: Brian Rogoff Subject: Re: Future Ada language revisions? Date: 1998/10/30 Message-ID: #1/1 X-Deja-AN: 406791166 References: <70lquh$mrp@netline.jpl.nasa.gov> Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: nntp1.ba.best.com 909780577 29749 bpr@206.184.139.136 MIME-Version: 1.0 Newsgroups: comp.lang.ada Date: 1998-10-30T00:00:00+00:00 List-Id: On Thu, 29 Oct 1998, Robert A Duff wrote: > ... snip ... > > I suppose I won't be truly satisfied until I can pass an unnamed block > (written in line) as a parameter, like I can in Smalltalk. Sigh. Well, I have similar tastes, if we substitute ML for Smalltalk above. However, since Ada syntax is a bit heavy, in that you'd need to type arguments to your anonymous subprogram, use "begin...end;", etc., I don't think there would be that much advantage to unnamed blocks in Ada; you might as well just declare local named functions. I think there would be a real win in having some restricted type-inference or automatic instantiation of generic subprograms, as in C++, but I doubt *that* will ever happen either. So, now I'm wondering, as I did in my original post, if there are mechanisms in place to get some of the smaller changes (downward closures, access constant parameters, and such) into Ada. -- Brian