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.4 required=5.0 tests=BAYES_00,FORGED_MUA_MOZILLA
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,81bb2ce65a3240c3
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.197.193 with SMTP id iw1mr2606325pbc.0.1335356002047;
        Wed, 25 Apr 2012 05:13:22 -0700 (PDT)
Path: 
 r9ni96780pbh.0!nntp.google.com!news2.google.com!news.glorb.com!feeder.erje.net!news.albasani.net!news.teledata-fn.de!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Wed, 25 Apr 2012 14:13:20 +0200
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7;
 rv:11.0) Gecko/20120327 Thunderbird/11.0.1
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: What would you like in Ada202X?
References: <3637793.35.1335340026327.JavaMail.geo-discussion-forums@ynfi5>
In-Reply-To: <3637793.35.1335340026327.JavaMail.geo-discussion-forums@ynfi5>
Message-ID: <4f97ea61$0$7613$9b4e6d93@newsspool1.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 25 Apr 2012 14:13:21 CEST
NNTP-Posting-Host: 65db27b5.newsspool1.arcor-online.net
X-Trace: 
 DXC=TSTJljJ`G<M0YVY]kmLTlDic==]BZ:afN4Fo<]lROoRA<`=YMgDjhgBVlijeZK>]HAnc\616M64>JLh>_cHTX3jMOjRK@9LWTlC
X-Complaints-To: usenet-abuse@arcor.de
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Date: 2012-04-25T14:13:21+02:00
List-Id: <comp.lang.ada>

On 25.04.12 09:47, Martin wrote:

> 2) parallel loops / functions

Array support in the direction of utilizing parallel
micro-micro-processing powers. Might require suitable

 (array types,
  array operators,
  restrictions)

Array operands will make multimedia programming, or scientific
computing, or ..., more robust, simple, and more efficient
at the same time. Likewise, anything to do with linear algebra
can get rid of nested for loops, clever indexing schemes, etc
once there are types that can express, without resorting to
loops, that

   Result := M * v;

Without resorting to loops, I'll mention that again. Computers
can work on a good mapping to hardware.