POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reactive C: an extension of C to program reactive systems
Software—Practice & Experience
Type inference for polymorphic references
Information and Computation
The sugarCubes tool box: a reactive Java framework
Software—Practice & Experience
Types and programming languages
Types and programming languages
Syntactic type soundness results for the region calculus
Information and Computation
Functional reactive programming, continued
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
ReactiveML: a reactive extension to ML
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Simple, partial type-inference for System F based on type-containment
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
GLONEMO: global and accurate formal models for the analysis of ad-hoc sensor networks
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Practical type inference for arbitrary-rank types
Journal of Functional Programming
The Signal Synchronous Multiclock Approach to the Design of Distributed Embedded Systems
IEEE Transactions on Parallel and Distributed Systems
Time refinement in a functional synchronous language
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Time refinement in a functional synchronous language
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
Concurrent and reactive systems often exhibit multiple time scales. For instance, in a discrete simulation, the scale at which agents communicate might be very different from the scale used to model the internals of each agent. We propose an extension of the synchronous model of concurrency, called reactive domains, to simplify the programming of such systems. Reactive domains allow the creation of local time scales and enable refinement, that is, the replacement of an approximation of a system with a more detailed version without changing its behavior as observed by the rest of the program. Our work is applied to the ReactiveML language, which extends ML with synchronous language constructs. We present an operational semantics for the extended language and a type system that ensures the soundness of programs.