[plt-scheme] serializable continuations

From: Matthias Felleisen (matthias at ccs.neu.edu)
Date: Fri Feb 9 15:37:23 EST 2007

On Feb 9, 2007, at 3:29 PM, Maarten Koopmans wrote:

>> Longer version: here's how to do it (link to the paper Matthias  
>> aluded to):
>> http://www.cs.brown.edu/~sk/Publications/Papers/Published/pcmkf- 
>> cont-from-gen-stack-insp/
> OK, I have been trying to wrap my mind around it. Trying... I am  
> missing theoretical background (once upon a time educated as a  
> physicist, different math).
> What I get from the paper is that you can install continuation  
> marks (marks on the stack) and that you can jump to them; the same  
> model works with exceptions. In both cases the marks provide  
> closures (either implemented as object or...)

Don't put closures there, or at least not lambdas-evaled-to-closures.  
Put representations of closures there (structs) that you can then  

-- Matthias

> What I don't "get" is how that gets me to continuations, or in the  
> case of MzScheme, serializable continuations. Do the continuation  
> marks in MzScheme give me acces to the stack or should I  
> reimplement a call/cc-like function myself. I suspect the latter,  
> but am afraid that I'm clueless wrt "how to".
> Anyway, it's fun learning so far :-)
> --Maarten
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme

Posted on the users mailing list.