Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| sequential binary parallelization at run-time wangli.one@gmail.com (Lauren) (2007-10-25) |
| Re: sequential binary parallelization at run-time gneuner2@comcast.net (George Neuner) (2007-10-27) |
| Unpopular parameter passing mechanisms and parallelisation (was Re: se al407@cam.ac.uk (Anton Lokhmotov) (2007-10-28) |
| Re: Unpopular parameter passing mechanisms and parallelisation torbenm@tyr.diku.dk (2007-10-29) |
| Re: Unpopular parameter passing mechanisms and parallelisation haberg@math.su.se (2007-10-29) |
| Re: Unpopular parameter passing mechanisms and parallelisation al407@cam.ac.uk (Anton Lokhmotov) (2007-10-31) |
| Re: Unpopular parameter passing mechanisms and parallelisation wangli.one@gmail.com (Lauren) (2007-11-01) |
| Re: Unpopular parameter passing mechanisms and parallelisation gneuner2@comcast.net (George Neuner) (2007-11-01) |
| From: | haberg@math.su.se (Hans Aberg) |
| Newsgroups: | comp.compilers |
| Date: | Mon, 29 Oct 2007 20:00:14 GMT |
| Organization: | Virgo Supercluster |
| References: | 07-10-082 07-10-089 07-10-091 07-10-094 |
| Keywords: | design |
| Posted-Date: | 31 Oct 2007 00:16:36 EDT |
In article 07-10-094, torbenm@tyr.diku.dk (Torben
=?iso-8859-1?Q?=C6gidius?= Mogensen) wrote:
> > It's interesting you mention that call-by-need (CBN) parameter passing
> > semantics is not particularly popular today.
>
> It is relatively common in functional languages, such as Haskell.
Schmidt, "Denotational Semantics", p. 181, distinguishes between
"call-by-need", which requires that once the evaluation of an argument
does proceed the whole expression must be evaluated, and "lazy
evaluation", which only evaluates as much as is needed from the
argument (a suitable subpart). By this terminology, Haskell uses lazy
evaluation, not call-by-need.
Hans Aberg
Return to the
comp.compilers page.
Search the
comp.compilers archives again.