Ann: Stackless Limbo Dancing Works Fine!

[Christian Tismer]

Fernando Pereira wrote:
> On 5/26/02 6:15 AM, "Christian Tismer" <tismer at tismer.com> wrote:
> 
> 
>>Discordance on these issues might make me want to leave them.
>>Please, all, your task is to make me do the right thing(TM),
>>which is a real challenge. Internals have for sure their own
>>auditory. Please continue with advice, which was great so far.
> 
> 
> Here are the design decisions that underlies the most recent hair-splitting:
> do channels have single readers and writers (1-to-1 channels), or not? If
> they are 1-to-1, how is that enforced? I think JCSP deals with this the
> right way. There are several classes of channel: 1-to-1, 1-to-many,
> many-to-1, many-to-many, but all of them share common interfaces for reading
> and writing. The most complicated case, many-to-many, would need some ariant
> of the full machinery described in that old Cardelli paper; the others would
> be easier sub-cases. I also like this design because you can start with
> 1-to-1, which is the easiest and most common case, and add the others if and
> when needed. 

Many many thanks!
Then I think I should get the JCSP source (btw. the PowerPoint
slides were a delight!) and study how they do it.
Something to lean on is better than re-inventing the wheel.

have a nice holiday - chris

-- 
Christian Tismer             :^)   <mailto:tismer at tismer.com>
Mission Impossible 5oftware  :     Have a break! Take a ride on Python's
Johannes-Niemeyer-Weg 9a     :    *Starship* http://starship.python.net/
14109 Berlin                 :     PGP key -> http://wwwkeys.pgp.net/
work +49 30 89 09 53 34  home +49 30 802 86 56  pager +49 173 24 18 776
PGP 0x57F3BF04       9064 F4E1 D754 C2FF 1619  305B C09C 5A3B 57F3 BF04
      whom do you want to sponsor today?   http://www.stackless.com/