Modular Reseting of Synchronous Data-flow Programs

Gregoire Hamon and Marc Pouzet

To appear at the 2nd International Conference on Principles and Practice of Declarative Programming (PPDP 2000), Montreal, Canada, September 20-22, 2000


In this paper, we present the addition of a reset operator to a higher-order synchronous data-flow language. Such an operator is the basic construction for the description of reconfigurable systems. This addition is made in such a way that all properties of the initial language, like reactivity and transparency, are kept: the reset is thus consistent with modularity or higher-order. This is obtained by extending the clock calculus of the language. As an example of use of this reset, we propose an expression of mode-automata in a synchronous data-flow language. The language discussed in this paper is Lucid-Synchrone, an ML extension to Lustre.