Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!spool2.mu.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!rpi!uupsi!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc
Subject: Re: On whether C has first-class composable functions
Message-ID: <9606:Jan2806:52:1991@kramden.acf.nyu.edu>
Date: 28 Jan 91 06:52:19 GMT
References: <3576:Jan2622:55:2991@kramden.acf.nyu.edu> <1991Jan27.035619.24981@spool.cs.wisc.edu> <21245@yunexus.YorkU.CA>
Organization: IR
Lines: 13

In article <21245@yunexus.YorkU.CA> oz@yunexus.yorku.ca (Ozan Yigit) writes:
> Yes, you were able to write an interpreter that contained said
> functionality, minus the scoping details.
> Amazing.

'Twas hardly amazing. What amazes me is that there are *still* people
posting to this newsgroup asking questions like ``Ya know, I haven't
seen any portable first-class composable function implementations that
don't have arbitrary limits. Is this because they are impossible, or is
there some sneaky way?'' Then again, I was also surprised that there are
people who don't know how to sort machine integers in linear time...

---Da