283
edits
Pipe-calculus: Difference between revisions
→Zero-order calculus
KalmanKeri (talk | contribs) |
KalmanKeri (talk | contribs) |
||
| Line 94: | Line 94: | ||
* <math>\mathsf{fail}</math> is a process that failed. | * <math>\mathsf{fail}</math> is a process that failed. | ||
* <math>\mathsf{pass}</math> is a passive process that endlessly copies its input to its output. | * <math>\mathsf{pass}</math> is a passive process that endlessly copies its input to its output. | ||
=== Alternatives === | |||
One can make choices exclusive by limiting themeselves to trees of alternatives where each leaf of the tree is one of the forms <math>a^+ . s</math> and <math>a^- . s</math>. This is an example of guarded choice[]. | |||
=== The pipe combinator === | |||
Computation is not possible without it. | |||
Plays a similar role as application in lambda calculus. | |||
Unidirectional parallel composition | |||
Synchronisation and communication | |||
== Formal Definition == | == Formal Definition == | ||