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.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ae33d52681d12ef3
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-06-25 19:07:39 PST
Path: 
 archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.mesh.ad.jp!sjc1.nntp.concentric.net!newsfeed.concentric.net!newsfeed1.thebiz.net!not-for-mail
Message-ID: <3B37EEC2.6E0C@global2000.net>
From: "Arthur G. Duncan" <aduncan@global2000.net>
Reply-To: aduncan@global2000.net
X-Mailer: Mozilla 3.0 (Win95; I)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Returning a function
References: <9gn68f$6j6@news.or.intel.com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
NNTP-Posting-Host: 
 8dp0sKqbZOcZWbPZVOrqmcLGtfltApPu4Mi6mZXF5FHqFFOdXEuTHjjIDUA36Ok=
X-Trace: 
 WXXRrHUJn6ofxGynYVhZAJoofkwDrKawhdaPCaJz/1ZDArhSrl6+cSYAvCqo/XDS7RQv0iTHQhip!qoS/mp5Bv6KSmtKW/MEzMk+WyE7FvLuSPT6VvnmlKveEP1A8IIUnBxTD3UIIpKDjWRrGfj3x+zL1!XO4GMVXdJhrvTz87
X-Complaints-To: news-abuse@thebiz.net
X-Abuse-Info: Please be sure to forward a copy of ALL headers to
X-Abuse-Info: news-abuse@thebiz.net, otherwise we will be unable
X-Abuse-Info: to process your complaint properly.
NNTP-Posting-Date: Mon, 25 Jun 2001 22:07:24 EDT
Organization: BiznessOnline.com, Inc.
Date: Tue, 26 Jun 2001 02:07:34 GMT
Xref: archiver1.google.com comp.lang.ada:9105
Date: 2001-06-26T02:07:34+00:00
List-Id: <comp.lang.ada>

Please excuse the shameless plug, but you might have a look
at my home page:

	www.cs.rpi.edu/~duncan

Follow the links in the "tutorials" section, starting with
"Non-Standard Ada Techniques".

Section VI of the tutorial deals with functional programming
in Ada.  There is a section on higher-order functions, which
describes a number of functions, such as Map, Reduce, Pointwise,
Pairwise, etc.  I also have the Ada source code on line.

Since Ada does not have a "lambda" special form, it is not quite
as easy as in Scheme or in ML.

Hope this helps.

Regards,

- Art Duncan
  duncan@cs.rpi.edu