Common

Reactive programming

Programming paradigm based on asynchronous data streams

Reactive programming

Common card · No. 322673

In computing, reactive programming is a declarative programming paradigm concerned with data streams and the propagation of change. With this paradigm, it is possible to express static (e.g., arrays) or dynamic (e.g., event emitters) data streams with ease, and also communicate that an inferred dependency within the associated execution model exists, which facilitates the automatic propagation of the changed data flow. For example, in imperative programming, a := b + c would mean that a is being assigned the result of b + c at the time the expression is evaluated, and later, the values of b and c can be changed with no effect on the value of a. In contrast, in reactive programming, the value of a is automatically updated whenever the values of b or c change, without the program having to explicitly re-state the statement a := b + c to re-assign the value of a. Another example is a hardware description language such as Verilog, where reactive programming enables changes to be modeled as...

Read on Wikipedia

Open boosters, collect cards and trade them. Free to play.

Play for free
Reactive programming – Common Wikipedia card | Wikiverse TCG