Path: utzoo!attcan!uunet!lll-winken!ames!mailrus!tut.cis.ohio-state.edu!bloom-beacon!oberon!skat.usc.edu!blarson
From: blarson@skat.usc.edu (Bob Larson)
Newsgroups: comp.lang.misc
Subject: Re: Bondage and Discipline Languages
Message-ID: <14738@oberon.USC.EDU>
Date: 17 Jan 89 19:04:27 GMT
References: <4246@enea.se>
Sender: news@oberon.USC.EDU
Reply-To: blarson@skat.usc.edu (Bob Larson)
Organization: USC AIS, Los Angeles
Lines: 20

In article <4246@enea.se> sommar@enea.se (Erland Sommarskog) writes:
>But to throw some new wood on the fire, consider the following: Assume
>you have routine you want to call but whose name you don't know until
>run-time, thus you have the name in a string. Now in which langauges
>can you easily do this? Interpreting langauges like Lisp and Basic,
>support this I guess. But compiled langauges?

Info/Basic  (Assuming you consider p-code languages compiled.)

Most any language under Primos: Pl/I, C, FORTRAN, PMA, etc.  The
language does need to support procedure pointers and some way to do
type punning, (or this part can be done in another language) and the
routine called must be in one of the libraries in the entry$ search
rules.

-- 
Bob Larson	Arpa: Blarson@Ecla.Usc.Edu	blarson@skat.usc.edu
Uucp: {sdcrdcf,cit-vax}!oberon!skat!blarson
Prime mailing list:	info-prime-request%ais1@ecla.usc.edu
			oberon!ais1!info-prime-request