LUCID, the dataflow programming language
LUCID, the dataflow programming language
Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
A report on the Sisal language project
Journal of Parallel and Distributed Computing - Special issue: data-flow processing
Synchronous programming with events and relations: the SIGNAL language and its semantics
Science of Computer Programming
Theoretical Computer Science
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Lucid, a nonprocedural language with iteration
Communications of the ACM
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic Type Schemes and Recursive Definitions
Proceedings of the 6th Colloquium on International Symposium on Programming
Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Compiling real time functional reactive programming
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Multi-periodic Process Networks: Prototyping and Verifying Stream-Processing Systems
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Towards a higher-order synchronous data-flow language
Proceedings of the 4th ACM international conference on Embedded software
ReactiveML: a reactive extension to ML
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Flush: a system development tool based on scade/lustre
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Translating discrete-time simulink to lustre
ACM Transactions on Embedded Computing Systems (TECS)
Resource control for synchronous cooperative threads
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Automatic rate desynchronization of embedded reactive programs
ACM Transactions on Embedded Computing Systems (TECS)
Mixing signals and modes in synchronous data-flow systems
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Modular Distribution and Application to Discrete Controller Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
Safe functional reactive programming through dependent types
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
An Overview of the Signal Clock Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronous Dataflow Pattern Matching
Electronic Notes in Theoretical Computer Science (ENTCS)
A higher-order extension for imperative synchronous languages
Proceedings of the 13th International Workshop on Software & Compilers for Embedded Systems
CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
Lucy-n: a n-synchronous extension of Lustre
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Proceedings of the sixth workshop on Declarative aspects of multicore programming
Keeping calm in the face of change
Higher-Order and Symbolic Computation
The essence of dataflow programming
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Sessional dataflow: short paper
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Modelling of complex software systems: a reasoned overview
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Higher-order functional reactive programming without spacetime leaks
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Data flow fusion with series expressions in Haskell
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Synchronous programming in audio processing: A lookup table oscillator case study
ACM Computing Surveys (CSUR)
Optimizing the implementation of real-time Simulink models onto distributed automotive architectures
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Synchronous data-flow is a programming paradigm which has been successfully applied in reactive systems. In this context, it can be characterized as some class of static bounded memory data-flow networks. In particular, these networks are not recursively defined, and obey some kind of "synchronous" constraints (clock calculus). Based on Kahn's relationship between data-flow and stream functions, the synchronous constraints can be related to Wadler's listlessness, and can be seen as sufficient conditions ensuring listless evaluation. As a by-product, those networks enjoy efficient compiling techniques. In this paper, we show that it is possible to extend the class of static synchronous data-flow to higher order and dynamical networks, thus giving sense to a larger class of synchronous data-flow networks.This is done by extending both the synchronous operational semantics, the clock calculus and the compiling technique of static data-flow networks, to these more general networks.