Article View: comp.lang.functional
Article #103Re: ** LAZY LANGUAGES FASTER?? **
From: Fergus James HENDERSON
Date: Wed, 29 Jul 1992 07:56
Date: Wed, 29 Jul 1992 07:56
15 lines
1169 bytes
1169 bytes
erik@wsinfo03.win.tue.nl (Erik Poll) writes: >In lazy languages, an argument is evaluated once for every time that it >is used. If the argument is used N times, it will be evaluated N times. As everyone has pointed out, lazy evaluation means evaluating each argument at most once. The correct term for the sort of evaluation strategy you were describing is "normal-order evaluation" (at least according to my programming languages textbook). -- Fergus Henderson fjh@munta.cs.mu.OZ.AU This .signature VIRUS is a self-referential statement that is true - but you will only be able to consistently believe it if you copy it to your own .signature file!
Technical Details
Message-ID:
<9221117.17986@mulga.cs.mu.OZ.AU>Path:
arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!cs.mu.OZ.AU!munta.cs.mu.OZ.AU!fjhReferences:
<1992Jul24.134857.23289@gdstech.grumman.com> <3737@svin02.info.win.tue.nl>Show Full Headers
Complete Article Headers
Newsgroups: comp.lang.functional Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!cs.mu.OZ.AU!munta.cs.mu.OZ.AU!fjh From: fjh@munta.cs.mu.OZ.AU (Fergus James HENDERSON) Subject: Re: ** LAZY LANGUAGES FASTER?? ** Message-ID: <9221117.17986@mulga.cs.mu.OZ.AU> Sender: news@cs.mu.OZ.AU Organization: Computer Science, University of Melbourne, Australia References: <1992Jul24.134857.23289@gdstech.grumman.com> <3737@svin02.info.win.tue.nl> Date: Wed, 29 Jul 1992 07:56:01 GMT Lines: 15