We end this tutorial introduction with some typical examples. The first one is the inverted pendulum which can be programmed in a purely data-flow style. The second one is a simple controller for a personal gas heater and illustrate the combination of data-flow equations and state machines. The next one is a simple version of the coffee machine as defined by Milner in [9] and adapted from Kevin Hammond description written in Hume [5]. We end with a recursive description of a N-buffer. These examples show the compilation and communication with the host language 1.
Other examples are available in the distribution of the language.