283
edits
Pipe-calculus: Difference between revisions
→The pipe combinator
KalmanKeri (talk | contribs) (→Choice) |
KalmanKeri (talk | contribs) |
||
| Line 123: | Line 123: | ||
One can make choices mutually exclusive by limiting themeselves to trees of choices where each leaf of the tree is one of the forms <math>a^+ . s</math> and <math>a^- . s</math> [and all atoms are different]. This is an example of guarded choice[]. It allows for the encoding of sum types and the corresponding <math>case</math> expressions in strongly typed functional languages. | One can make choices mutually exclusive by limiting themeselves to trees of choices where each leaf of the tree is one of the forms <math>a^+ . s</math> and <math>a^- . s</math> [and all atoms are different]. This is an example of guarded choice[]. It allows for the encoding of sum types and the corresponding <math>case</math> expressions in strongly typed functional languages. | ||
=== | === Pipeline === | ||
After discussing sequence and choice, the pipe combinator is the first where interaction occurs between processes. | After discussing sequence and choice, the pipe combinator is the first where interaction occurs between processes. | ||