home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!dtix!darwin.sura.net!mips!sdd.hp.com!usc!elroy.jpl.nasa.gov!decwrl!deccrl!news.crl.dec.com!nikhil
- From: nikhil@crl.dec.com (R.S. Nikhil)
- Newsgroups: comp.lang.functional
- Subject: Re: ** LAZY LANGUAGES FASTER?? **
- Message-ID: <1992Jul28.140801.21895@crl.dec.com>
- Date: 28 Jul 92 14:08:01 GMT
- References: <1992Jul24.134857.23289@gdstech.grumman.com> <3737@svin02.info.win.tue.nl> <farrell.712286497@coral.cs.jcu.edu.au>
- Sender: news@crl.dec.com (USENET News System)
- Organization: DEC Cambridge Research Lab
- Lines: 10
-
- In article <farrell.712286497@coral.cs.jcu.edu.au>, farrell@coral.cs.jcu.edu.au (John Farrell) writes:
- >
- > *Non-strict* evaluation saves time by not evaluating arguments which are not
- > needed.
-
- Pardon my nit-picking, but this is not true. I refer you to my earlier posting
- (last week?) in which I pointed out that evaluators CAN work on unnecessary
- arguments while preserving non-strictness.
-
- Rishiyur Nikhil (nikhil@crl.dec.com)
-