Functional - Re: shootout: implementing an interpreter for a simple procedural

You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

Author

Re: shootout: implementing an interpreter for a simple procedural

Markus

2007-07-30, 4:14 am

> Markus E.L. wrote:
>
> SML/NJ is another one to look at: it transforms into CPS before compilation
> so (AFAIK) there is no non-persistent stack. I believe all such languages
> are significantly slower than those with conventional stacks.

Chicken-Scheme AFAIK has a different approach: They use stack-frames
but also can compact the stack in some way. I'm not sure how it works
but remember that they claim they have all advantages of a linear
stack and can still support call/cc efficiently.

And, AFAIK, the transformation to CPS is not a requirement for
supporting continuations with non-linear stacks: A more direct
representation of stack frames as linked blocks in the heap should be
possible and perhaps faster than building closures (but I'm talking
about things I hardly know here).

Regards -- Markus

Sponsored Links