They seem to describe a virtual machine that runs code, as described in the language design, bytecode-by-bytecode without compilation or optimization. In this case, it is true. Think about the code doing something like this, for example:
x = first(a,b,c) y = second(a,b,c) third(y,x)
In a case-based system, you can simply put arguments in whatever position they expect (if registers can be used to pass arguments). If all the registers are "global," and not for each function (or at least restored when the call stack is loaded), you may not need to do anything between the first and second calls.
If you have a stack-based virtual machine, you get something like (I hope you have swap ):
push a push b push c call first push a
Also, if you are calculating a mathematical expression that uses the same variables, you might need to do something like this:
push a push b add push a push c add add
instead (if there are registers a, b, c, and you can destroy the contents of b and c):
add b, a add c, a add b, c # result in b
this avoids the restoration of a , which had to be performed by a separate click in the first case.
Again, Iβm just guessing about the examples, maybe they meant another case ...