KC Sivaramakrishnan

@marklrh Would be great if you could help! Let's take the discussion off-thread.

> Another consideration is how to inspect (efficiency aside) the delimited continuations. For example, a garbage-collecting lightweight-thread manager needs to collect (and later update) the roots across all the lightweight...

I should say that multi-shot continuations make programming with resources quite difficult. When a programmer writes a function, there is an implicit assumption that the function will return exactly once...

IIUC `stack.switch` is symmetric in the sense that it allows the transfer of control from one stack to another. In particular, `switch` has to name the stack to which the...

Thanks for the response @RossTate. > If you want to understand this in more detail, I recommend reading the write up on how to implement composable stacks in this proposal...

Hi @RossTate, thanks for the presentation today. I liked the fact that the proposal is no longer tied to stack inspection. I had the following observations regarding the two kinds...

As Ross mentioned in the call, using up the continuation is cheap compared to the cost of stack switching. A continuation is just a ref that points to the stack,...

> (The application could choose whether to perform that particular stack inspection using big hops or frame by frame.) Ok. I thought you were not using stack inspection, but turns...

Done. See [kcas library](https://github.com/kayceesrk/kcas) and [lock-free library](https://github.com/kayceesrk/lockfree).

I think part of the motivation is in the original comment. Reagents is functorized over a scheduler which typically depends on lock-free library. So I'd like to pry the dependencies...