Discussion:
What is the execution model of a conventional imperative language?
(too old to reply)
helpful student
2012-10-29 21:53:56 UTC
Permalink
SPJ in his 1987 book on p5 says

Graph reduction gives an appealingly simple and elegant model for the
execution of a functional program, and one that is radically different
from the
execution model of a conventional imperative language.


What is the execution model of a conventional imperative language?

I thought they all had either stack or expression tree (graph).

helpful student
Barb Knox
2012-10-30 01:32:06 UTC
Permalink
In article
Post by helpful student
SPJ in his 1987 book on p5 says
Graph reduction gives an appealingly simple and elegant model for the
execution of a functional program, and one that is radically different
from the
execution model of a conventional imperative language.
What is the execution model of a conventional imperative language?
I thought they all had either stack or expression tree (graph).
Those will handle evaluating expressions that do not have side effects.

The complex part of an imperative model involves keeping track of the
changing state of the memory (linear, objects, cons-cells, or whatever).
--
---------------------------
| BBB b \ Barbara at LivingHistory stop co stop uk
| B B aa rrr b |
| BBB a a r bbb | Quidquid latine dictum sit,
| B B a a r b b | altum videtur.
| BBB aa a r bbb |
-----------------------------
helpful student
2012-10-30 06:03:57 UTC
Permalink
Post by Barb Knox
In article
Post by helpful student
SPJ in his 1987 book on p5 says
Graph reduction gives an appealingly simple and elegant model for the
execution of a functional program, and one that is radically different
from the
execution model of a conventional imperative language.
What is the execution model of a conventional imperative language?
I thought they all had either stack or expression tree (graph).
Those will handle evaluating expressions that do not have side effects.
The complex part of an imperative model involves keeping track of the
changing state of the memory (linear, objects, cons-cells, or whatever).
Certainly. Is there a name for the different technique or the concept
so I can read more on it?

Besides the side effect of echo or messaging statements in C etc.
after the
memory is freed, doesnt that bring both functional and imperative
execution to the same thing? The graph or parse tree technique is the
same in both cases or if it is stack based evaluation. Anymore
elaboration?

I am also ccing the post to you.

helpful student

Continue reading on narkive:
Loading...