On Sat, Jul 30, 2011 at 3:40 AM, BGB <[email protected]> wrote:

> one could have a stack machine, implemented in terms of lists of
> cons-cells, and this still works.
> the stack can in-fact be mapped purely to machine registers, and this also
> works.
>

Neither would help with concurrency.


>
> the "stack" the compiler sees, in effect, doesn't actually exist at
> runtime.
>

I'll grant that by 'stack machine' I am referring to a typical
implementation technique - not 'abstract' stack machine. Nonetheless, many
abstractions - such as pipelines, streams, and dataflow concepts, for
example - are not well modeled using a stack, whether intermediate or final.
The control-flow stack is too far from the target abstraction.
_______________________________________________
fonc mailing list
[email protected]
http://vpri.org/mailman/listinfo/fonc

Reply via email to