🚀 go-pugleaf

budd@mist.CS.ORST.EDU (Tim Budd) wrote:

> I'm looking for examples (if any) of any compiled, possibly strongly typed,
> languages in which functions/procedures are first class values (i.e., can be 
> stored in variables, can be sent as arguments to other functions, can be 
> returned as the result of a function, and so on).

PS-algol does this.  I posted a list of tech reports about it to the
comp.doc.techreports newsgroup a few months ago.  The extra feature it has
beyond what you're asking for, and the critically important one, is the
ability to make functions persistent - thus a partial application of a
procedure can be constructed and later reinvoked at any time *with the
environment of its creation*.  This gives the full power of a typed module
facility, but without the restriction that module bindings have to happen at
"link time".  It compiles to an abstract machine code for an interpreter.
It's strongly typed, sort of (well, stronger than Scheme, anyway; some sort of
get-out is needed to handle long-term persistent data with reasonable
flexibility - PS-algol treats complex objects as all having the same compile-
time type but imposes run-time type checks on accesses to their insides).

The one thing you can't do is use procedure closures as keys for associative
data structures, though we've done some experiments towards this.

Of course ML and Miranda-like languages have "first class" procedures too, but
without persistent closures they are limited in what they can do with them.

[ I couldn't get this to comp.compilers by following up - does
  anyone know a good way to reach the moderator from the UK? ]

-- 
Jack Campin  *  Computing Science Department, Glasgow University, 17 Lilybank
Gardens, Glasgow G12 8QQ, SCOTLAND.    041 339 8855 x6045 wk  041 556 1878 ho
INTERNET: jack%cs.glasgow.ac.uk@nsfnet-relay.ac.uk  USENET: jack@glasgow.uucp
JANET: jack@uk.ac.glasgow.cs     PLINGnet: ...mcvax!ukc!cs.glasgow.ac.uk!jack