Re: Parameter Modes, In In Out and Out

[Robert Dewar <robert_dewar@my-deja.com>]

In article
<Pine.BSF.4.21.0101091641170.3696-100000@shell5.ba.best.com>,
  Brian Rogoff <bpr@shell5.ba.best.com> wrote:

> Explain please. There are languages which are referentially
> transparent  which are also strict/eager. Mercury and Opal
> come to mind (see, I can play the obscure language game as
> well as anyone :).

I use the term RT in the sense that Miranda uses it (i.e. the
way Dave Turner would use it), and in that sense, it implies
laziness.

For example, if I have a projection function

  x (a,b) = b

then I must be able to replace x(b) with x(a,b) for any
possible a, and that includes computations which if done
eagerly would cause an infinite recursion.

It's just a matter of use of words, so just understand that
when I used RT as a term, I was using it in this sense. I can
guess at the way you use the term from your examples, and
that's just fine, but rather irrelevant to the discussion at
hand.


Sent via Deja.com
http://www.deja.com/