Towards a higher-order synchronous data-flow language

10 years 1 months ago
Towards a higher-order synchronous data-flow language
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfigure data-flow processes. The language comes as a natural and strict extension of both Lustre and Lucid Synchrone. This extension is conservative, in the sense that a first-order restriction of the language can receive the same semantics. We illustrate the expressivity of the language with some examples, before giving the formal semantics of the underlying calculus. The language is equipped with a polymorphic type system allowing types to be automatically inferred and a clock calculus rejecting programs for which synchronous execution cannot be statically guaranteed. To our knowledge, this is the first higher-order synchronous data-flow language where stream functions are first class citizens. Categories and Subject Descriptors C.3 [Special-purpose and application-based systems]: Real-time and embedded s...
Jean-Louis Colaço, Alain Girault, Gré
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Authors Jean-Louis Colaço, Alain Girault, Grégoire Hamon, Marc Pouzet
Comments (0)