[Stackless] Paper question

[Krishnaswami, Neel]

Hello all,

On the C-- (http://www.cminusminus.org) mailing list, I saw
a reference to a paper that may be of interest to the members
of this list: "Featherweight concurenncy in a portable assembly
language."

The core neat idea in this paper is the design of a limited version
of call/cc that allows the efficient implementation of coroutines,
microthreads, backtracking, and exceptions with restarts while stil
permitting activation records to be stack-allocated. 

The basic idea is that activation records are stack allocated, and 
a captured continuation is just a pointer into the control stack. 
You can resume a continuation as many times as you like, but if
the continuation's calling function f returns or if you resume a
continuation captured by any of f's callers. (These two restrictions
preserve the stack discipline of the call stack.)

Since these applications are AFAICT a pretty close to complete set 
of uses for Stackless, and it still permits great speed, I'm passing
along a pointer to the paper:

http://research.microsoft.com/~simonpj/papers/c--concurrency.ps.gz

--
Neel Krishnaswami
neelk at cswcasa.com
_______________________________________________
Stackless mailing list
Stackless at starship.python.net
http://starship.python.net/mailman/listinfo/stackless