An ML-like module system for the synchronous language SIGNAL

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Synchronous languages, such as SIGNAL, are best suited for the design of dependable real-time systems. Synchronous languages enable a very high-level specification and an extremely modular implementation of complex systems by structurally decomposing them into elementary synchronous processes. Separate compilation in reactive languages is however made a difficult issue by global safety requirements. To enable separate compilation of the functional components of reactive systems while preserving their global integrity, we introduce a module system for SIGNAL. Just as data-types describe the invariants of program modules in functional languages, temporal and data-flow invariants interface SIGNAL processes to their environment. In conventional languages, typing is the medium allowing the separate compilation of functions in a program. In SIGNAL, the notion of conditional data-flow graph can similarly be used for separately compiling reactive processes and for assembling them in complex systems. Following this principle, we present the first design and implementation of a polymorphic type system and of a module system for the synchronous language SIGNAL.

Cite

CITATION STYLE

APA

Nowak, D., Talpin, J. P., Gautier, T., & Le Guernic, P. (1997). An ML-like module system for the synchronous language SIGNAL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 1244–1253). Springer Verlag. https://doi.org/10.1007/bfb0002880

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free