[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: mathematical models
- To: hbaker@netcom.com
- Subject: Re: mathematical models
- From: Jeffrey Mark Siskind <qobi@qobi.nj.nec.com>
- Date: Thu, 5 Jun 1997 12:35:27 -0400
- Cc: blume@cs.princeton.edu, wand@ccs.neu.edu, rrrs-authors@martigny.ai.mit.edu, hbaker@netcom.com, jgm@cs.cornell.edu, shriram@cs.rice.edu, ramsdell@linus.mitre.org, feeley@iro.umontreal.ca, kelsey@research.nj.nec.com, will@ccs.neu.edu
- In-Reply-To: <199706050030.RAA00144@netcom8.netcom.com> (hbaker@netcom.com)
- Reply-To: Qobi@research.nj.nec.com
I always understood the motivation for leaving argument evaluation order
unspecified to be the desire to allow parallel argument evaluation, not the
desire to allow optimizaion by reordering. But parallel argument evaluation is
even weaker than unspecified argument evaluation order. Under parallel
argument evaulation, the following expression
(let ((x 0))
(+ (begin (if (zero? x) (set! x 1)) x)
(begin (if (zero? x) (set! x 2)) x)))
could yield 3 which it could not do under any unspecified (applicative)
argument evaluation order, even one that allowed each call from a given call
site to have different argument evaluation order.
Mind you, I agree with Henry that it is better to specify argument evaluation
order and require the compiler to determine when it is safe to evaluation
arguments in parallel. I'm just pointing out one possible interpretation for
the motivation behind the current wording.
Jeff (http://www.neci.nj.nec.com/homepages/qobi.html)