 in computer programming, dataflow programming is a programming paradigm that models a program as a directed graph of the data flowing between operations, thus implementing dataflow principles and architecture. dataflow programming languages share some features of functional languages, and were generally developed in order to bring some functional concepts to a language more suitable for numeric processing. some authors use the term datastream instead of dataflow to avoid confusion with dataflow computing or dataflow architecture, based on an indeterministic machine paradigm. ==properties of dataflow programming languages== traditionally, a program is modeled as a series of operations happening in a specific order; this may be referred to as sequential, procedural, control flow (indicating that the program chooses a specific path), or imperative programming. the program focuses on commands, in line with the von neumann vision of sequential programming, where data is normally "at rest" in contrast, dataflow programming emphasizes the movement of data and models programs as a series of connections. explicitly defined inputs and outputs connect operations, which function like black boxes. an operation runs as soon as all of its inputs become valid. thus, dataflow languages are inherently parallel and can work well in large, decentralized systems.  ===state=== one of the key concepts in computer programming is the idea of state, essentially a sna
Concurrent_programming_languages Programming_paradigms