Reactive types

0Citations
Citations of this article
1Readers
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. We give a simple and effective account to the separate compilation of reactive systems by introducing a specification as type paradigm for reactive languages: reactive types. Just as data-types describe the structure of data in conventional languages, reactive types describe the structure of interaction in synchronous languages. We define an inference system for determining reactive types in the SIGNAL language and show how to reconstruct adequate compile-time information on reactive programs by means of such specifications.

Cite

CITATION STYLE

APA

Talpin, J. P. (1997). Reactive types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1214, pp. 595–606). Springer Verlag. https://doi.org/10.1007/bfb0030628

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