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,15bb83df7cabf157
X-Google-Attributes: gid103376,public
From: Johann Hibschman <johann@leporello.berkeley.edu>
Subject: Re: is there a FAQ?
Date: 1998/05/15
Message-ID: <mtn2cjl6h6.fsf@leporello.berkeley.edu>#1/1
X-Deja-AN: 353590358
References: <3559AF5F.B16CCDA7@student.liu.se>
 <3559C828.71BF48A4@cl.cam.ac.uk>
Organization: University of California, Berkeley
Newsgroups: comp.lang.ada
Date: 1998-05-15T00:00:00+00:00
List-Id: <comp.lang.ada>


Markus Kuhn <Markus.Kuhn@cl.cam.ac.uk> writes:

> To get started:

[links snipped]

I'm also just looking into Ada.  I tried reading the FAQ, but I
couldn't find a could very basic questions answered.  Does Ada support
functional programming and closures?  I'm a bit of a language
hobbyist, and I've become quite addicted to easy temporary function
creation for mapping/reduce/etc uses.

Is there a (convenient) way to write

(map-into out-vector
          #'(lambda (x y) (+ x (sqrt y)))
          vector1 vector2)

as I would in Common Lisp?  (Or, with slight syntax changes, in ML?)

Sather iterators do this fairly well, but they're still a little
inconvenient.

>From what I see, Ada has much better array syntax support, which means
I wouldn't have to write it myself, as I would have to in CL.  I'm
surprised that I'm having trouble finding an answer to this question;
it seems so basic.

- Johann