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.1 required=5.0 tests=BAYES_20,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!nike!cad!ucbvax!SU-SIERRA.ARPA!Bryan
From: Bryan@SU-SIERRA.ARPA (Doug Bryan)
Newsgroups: net.lang.ada
Subject: procedures as parameters
Message-ID: <12212651166.12.BRYAN@SU-SIERRA.ARPA>
Date: Fri, 6-Jun-86 09:36:30 EDT
Article-I.D.: SU-SIERR.12212651166.12.BRYAN
Posted: Fri Jun  6 09:36:30 1986
Date-Received: Sat, 7-Jun-86 14:23:33 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
List-Id: <comp.lang.ada>


Could some of you C and/or Algol hackers out there give me an example of
an algorithm where subprograms as parameters are needed and generic
formal subprograms won't do the trick.  In other words, I'm looking for
an algorithm where the subprogram, or actual parameter, cannot be
determined until run-time.

doug
-------