A tutorial on coinductive stream calculus and signal flow graphs

This paper presents an application of coinductive stream calculus to signal flow graphs. In comparison to existing approaches, which are usually based on Z-transforms (a discrete version of Laplace transforms) and transfer functions, the model presented in these notes is very elementary. The formal treatment of flow graphs is interesting because it deals with two fundamental phenomena in the theory of computation: memory (in the form of register or delay elements) and infinite behaviour (in the form of feedback).