A functional extension of Lustre

Lustre is a data-ow programming language for reactive purposes, which has been given a synchronous operational semantic. Static checks called "clock calculus" restrict Lustre programs to those data-ow networks which can be executed synchronously. As a by-product of this restriction, Lustre programs enjoy eecient compiling techniques. Yet, due to its reactive origin, Lustre applies only to static networks. We show here, that both this operational semantic , and clock calculus can be extended toward accounting for general functional features: abstraction, application and recursion. This allows us to give sense to both higher order, and dynamical synchronous data-ow networks, which can thus be expected to share the same eecient compiling techniques.