On 2007-11-16, Yang <[EMAIL PROTECTED]> wrote (quoting a paper): > "This style of concurrency is, of course, not new. Component > architectures where data flows through components (rather than > control) have been called 'actor-oriented' [35]. These can take many > forms. Unix pipes resemble PN, although they are more limited in that > they do not support cyclic graphs.
This isn't quite true. Unix pipes support cyclic graphs just fine. Many programs can't handle this due to buffering (on both input and output). Further, most Unix shells can't set them up. C programs, or anything else that exposes the underlying calls, can set them up easily enough. -- Aaron Denney -><- _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
