[theoh]

I remember this when it first came out. The sequencing combinators are a bit like Occam's SEQ and PAR, though with the difference that just one of their arguments will succeed.

A couple of years later I worked at a startup with a DSL which worked on similar lines (closer to Occam) but introduced the notion of a "race" (somewhat like the parallel combinator in Webl) so that a number of parallel tasks could be terminated by the one that finished first (possibly some kind of timeout). Occam doesn't have that notion at all. Nor does Esterel, or any other similar language that I know of...