Re: No Go To's Forever!

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

In article <sfke9p2pivv17@corp.supernews.com>,
  ka@exit109.com (Kenneth Almquist) wrote:
> Robert Dewar wrote:
> > But there really is a very fundamental point here. If you
> > want
> > to study it further, try generating the full denotational
> > semantics and in fact try generating the full proof
conditions.
> > That will make things clearer I think.

Interesting post, but I am afraid not quite I asked for,
the most important word in my above quote here is denotational.
You gave a proof in terms of operational semantics, and I
will repeat my claim that you will more easily see the
fundamental difference between the two algorithms if you
look at things at a higher level, which is where the
denotational semantics will lead you. Basically you want
to think in terms of what the parts of the program *mean*
instead of what they *do*, and that of course is the
fundamental distinction between denotational and operational
semantics.

True the distinction is not always clear. Indeed Ada/Ed was
in many respects an operational version of a denotational
semantic definition for Ada.

At an operational level, it is fairly easy to see that the
two forms are equivalent, as you show in your proof, but
it is much more difficult to see this equivalence at the
denotational semantic level.


Sent via Deja.com http://www.deja.com/
Before you buy.