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.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!gandalf.srv.welterde.de!news.jacob-sparre.dk!loke.jacob-sparre.dk!pnx.dk!.POSTED!not-for-mail
From: Jacob Sparre Andersen <sparre@nbi.dk>
Newsgroups: comp.lang.ada
Subject: Re: Haskell, anyone?
Date: Tue, 24 Nov 2015 13:03:03 +0100
Organization: JSA Research & Innovation
Message-ID: <87y4dn1u6g.fsf@adaheads.sparre-andersen.dk>
References: <c6ac0d2f-52af-4aa6-ba6f-34f61e3c93e8@googlegroups.com>
	<14533506-4289-4148-b8c4-e970f5778b26@googlegroups.com>
	<87si45msuz.fsf@nightsong.com>
	<35d6dc4f-4f2e-4e75-925c-e4acc7c8f112@googlegroups.com>
	<n2f4q7$eiq$1@dont-email.me>
	<76ea0bc9-537b-4c68-a728-4f634cf6de52@googlegroups.com>
	<87a8qccxj4.fsf@nightsong.com>
	<0ff849e9-11d7-438d-abf9-853f79348640@googlegroups.com>
	<874mgjnctv.fsf@nightsong.com>
	<b6f252a0-1dbe-4b65-b1f3-df591df27567@googlegroups.com>
	<87ziyblkzn.fsf@nightsong.com>
	<937b88b1-66aa-4205-a412-9588d83a3f26@googlegroups.com>
	<n2j09a$pg2$1@loke.gir.dk>
	<36a48f94-41ee-491a-8312-d6e7732bf482@googlegroups.com>
NNTP-Posting-Host: 109.56.180.83.mobile.3.dk
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: loke.gir.dk 1448366583 3419 109.56.180.83 (24 Nov 2015 12:03:03 GMT)
X-Complaints-To: news@jacob-sparre.dk
NNTP-Posting-Date: Tue, 24 Nov 2015 12:03:03 +0000 (UTC)
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.4 (gnu/linux)
Cancel-Lock: sha1:3wXRPp+OxH3F6+T9+1V1/mw6VAc=
Xref: news.eternal-september.org comp.lang.ada:28520
Date: 2015-11-24T13:03:03+01:00
List-Id: <comp.lang.ada>

Hadrien Grasland <hadrien.grasland@gmail.com> wrote:

> Actually, speaking of functional programming Ada, I'm curious: would
> there be an elegant way to produce a higher-order function equivalent
> in Ada ?

One way to (sort of) do it:

   http://rosettacode.org/wiki/First-class_functions#Ada

You can, more or less, write something similar with tagged types.

Greetings,

Jacob
-- 
Statistics is like a bikini - what it shows is very suggestive,
but the most important stuff is still hidden.