[plt-scheme] Serializable continuations?

From: Jay McCarthy (jay.mccarthy at gmail.com)
Date: Thu Feb 9 23:12:23 EST 2006

I'd recommend that anyone interested in this issue read the ICFP05
paper, Continuations from Generalized Stack Inspection [1], that
discusses serializable continuations and talks about some of the
issues below.

I'm currently working on ways of getting many of the perceived
benefits of persistent continuations by a few avenues:
 - coarse grained continuation reconstruction
 - more intelligent continuation GC
 - more server support for binding instances to different servers

As this work matures, you will all come to know about it.


1. http://cs.brown.edu/~sk/Publications/Papers/Published/pcmkf-cont-from-gen-stack-insp/

On 2/9/06, pedro pinto <pedro.e.pinto at gmail.com> wrote:
> I was wondering if there is any work being done on making continuations
> serializable? Is it conceivable that continuations could be embedded  in
> URLs or hidden fields?
> Seems like small, serializable continuations would pretty much eliminate
> some of the standard objections to continuation based web programming
> (timeout based GC, no load balancing).
> -pp
> _________________________________________________
>   For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme

Jay McCarthy <jay at cs.brown.edu>

Posted on the users mailing list.