maatary (10) [Avatar] Offline
#1
“The difference is that the former focuses on the functions and their composition while the latter concentrates on the movement of data through a network (more precisely a directed acyclic graph) of connected computations. Every node of this network is a single-assignment variable that is calculated once all inputs of its defining expressions have been determined. Therefore the result of injecting data into the processing network is always fully deterministic even though all computations within it conceptually run in parallel.”

What does it means ?
roland.kuhn (39) [Avatar] Offline
#2
maatary wrote:“The difference is that the former focuses on the functions and their composition while the latter concentrates on the movement of data through a network (more precisely a directed acyclic graph) of connected computations. Every node of this network is a single-assignment variable that is calculated once all inputs of its defining expressions have been determined. Therefore the result of injecting data into the processing network is always fully deterministic even though all computations within it conceptually run in parallel.”

What does it means ?


Can you give me more of a hint what exactly you find unclear? Is it what the difference between FP and dataflow is, or is it what dataflow is? I’ll take note to revise this section in any case, but more information about the current shortcomings will of course make it better in the end.