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=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 Path: backlog4.nntp.dca3.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!peer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!post01.iad.highwinds-media.com!fx16.iad.POSTED!not-for-mail From: Shark8 User-Agent: Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:31.0) Gecko/20100101 Thunderbird/31.0a1 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Your wish list for Ada 202X References: <7f1c01c5-3563-4b94-9831-152dbbf2ecdc@googlegroups.com> In-Reply-To: <7f1c01c5-3563-4b94-9831-152dbbf2ecdc@googlegroups.com> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Message-ID: X-Complaints-To: abuse@teranews.com NNTP-Posting-Date: Mon, 14 Apr 2014 22:36:28 UTC Organization: TeraNews.com Date: Mon, 14 Apr 2014 16:36:26 -0600 X-Received-Bytes: 1801 X-Received-Body-CRC: 488342603 X-Original-Bytes: 1820 Xref: number.nntp.dca.giganews.com comp.lang.ada:185734 Date: 2014-04-14T16:36:26-06:00 List-Id: On 25-Mar-14 15:41, Stoik wrote: > I think that even a casual user of Ada should be able to influence > somehow the new version of Ada. I wonder what is high on your list > of wishes for Ada 202X? > > I suspect many of the proposals could be tested in GNAT before > being introduced (or rejected) in the new version. One could add a > switch to GNAT indicating that we want to use some of the > experimental features. Perhaps a way to use a procedure as a function, now that functions can have in/in-out parameter modes. Maybe with syntax like: Procedure Y( Input : in In_type; State : in out State_Type; Output : out Out_Type ); Function X renames Y with return Output; -- Function X being roughly equivalent to the following: Function X ( Input : in In_type; State : in out State_Type) return Out_Type is begin Return Result : Out_Type do Y( Input => Input, State => State, Output => Result ); end return; end X;