[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: The fundamental concept of continuations
From: |
gnuist006 |
Subject: |
Re: The fundamental concept of continuations |
Date: |
Tue, 09 Oct 2007 06:24:05 -0000 |
User-agent: |
G2/1.0 |
On Oct 8, 10:59 pm, Barb Knox <s...@sig.below> wrote:
>
> Lambda calculus. Instead of function A returning to its caller, the
> caller provides an additional argument (the "continuation") which is a
> function B to be called by A with A's result(s). In pure "continuation
> style" coding, nothing ever "returns" a result.
>
> It is easy to mechanically transform normal function-style lambda
> calculus into continuation-style, but the reverse is not so.
>
Explanation and reference please
>
> You can have a "spaghetti stack", or keep continuation data-structures
> in the heap.
A picture, diagram? a picture is worth a thousand words