Functional reactive programming (FRP) is a programming paradigm for reactive programming (asynchronous dataflow programming) using the building blocks of functional programming (e.g., map, reduce, filter). FRP has been used for programming graphical user interfaces (GUIs), robotics, games, and music, aiming to simplify these problems by explicitly modeling time.^{[citation needed]}

The original formulation of functional reactive programming can be found in the ICFP 97 paper Functional Reactive Animation by Conal Elliott and Paul Hudak.^[1]

FRP has taken many forms since its introduction in 1997. One axis of diversity is discrete vs. continuous semantics. Another axis is how FRP systems can be changed dynamically.^[2]

The earliest formulation of FRP used continuous semantics, aiming to abstract over many operational details that are not important to the meaning of a program.^[3] The key properties of this formulation are:

• Modeling values that vary over continuous time, called "behaviors" and later "signals".
• Modeling "events" which have occurrences at discrete points in time.
• The system can be changed in response to events, generally termed "switching."
• The separation of evaluation details such as sampling rate from the reactive model.

This semantic model of FRP in side-effect free languages is typically in terms of continuous functions, and typically over time.^[4] This formulation is also referred to as denotative continuous time programming (DCTP).^[5]

Formulations such as Event-Driven FRP and versions of Elm prior to 0.17 require that updates are discrete and event-driven.^[6] These formulations have pushed for practical FRP, focusing on semantics that have a simple API that can be implemented efficiently in a setting such as robotics or in a web-browser.^[7]

In these formulations, it is common that the ideas of behaviors and events are combined into signals that always have a current value, but change discretely.^[8]

It has been pointed out that the ordinary FRP model, from inputs to outputs, is poorly suited to interactive programs.^[9] Lacking the ability to "run" programs within a mapping from inputs to outputs may mean one of the following solutions must be used:

• Create a data structure of actions which appear as the outputs. The actions must be run by an external interpreter or environment. This inherits all of the difficulties of the original stream input/output (I/O) system of Haskell.^[10]
• Use Arrowized FRP and embed arrows which are capable of performing actions. The actions may also have identities, which allows them to maintain separate mutable stores for example. This is the approach taken by the Fudgets library^[11] and, more generally, Monadic Stream Functions.^[12]
• The novel approach is to allow actions to be run now (in the IO monad) but defer the receipt of their results until later.^[13] This makes use of an interaction between the Event and IO monads, and is compatible with a more expression-oriented FRP:

 planNow :: Event (IO a) -> IO (Event a)

There are two types of FRP systems, push-based and pull-based. Push-based systems take events and push them through a signal network to achieve a result. Pull-based systems wait until the result is demanded, and work backwards through the network to retrieve the value demanded.

Some FRP systems such as Yampa use sampling, where samples are pulled by the signal network. This approach has a drawback: the network must wait up to the duration of one computation step to learn of changes to the input. Sampling is an example of pull-based FRP.

The Reactive and Etage libraries on Hackage introduced an approach called push-pull FRP. In it, only when the next event on a purely defined stream (such as a list of fixed events with times) is demanded, that event is constructed. These purely defined streams act like lazy lists in Haskell. That is the pull-based half. The push-based half is used when events external to the system are brought in. The external events are pushed to consumers, so that they can find out about an event the instant it is issued.

Implementations exist for many programming languages, including:

• Yampa is an arrowized, efficient, pure Haskell implementation with SDL, SDL2, OpenGL and HTML DOM support.
• The language Elm used to support FRP^[14] but has since replaced it with a different pattern.^[15]
• reflex is an efficient push–pull FRP implementation in Haskell with hosts for web browser – Document Object Model (DOM), Simple DirectMedia Layer (SDL), and Gloss.
• reactive-banana is a target-agnostic push FRP implementation in Haskell.
• netwire and varying are arrowized, pull FRP implementations in Haskell.
• Flapjax is a behavior–event FRP implementation in JavaScript.
• React is an OCaml module for functional reactive programming.
• Sodium is a push FRP implementation independent of a specific user interface (UI) framework for several languages, such as Java, TypeScript, and C#.^[16]
• Dunai is a fast implementation in Haskell using Monadic Stream Functions that supports Classic and Arrowized FRP.
• ObservableComputations, a cross-platform .NET implementation.
• Stella is an actor model-based reactive language that demonstrates a model of "actors" and "reactors" which aims to avoid the issues of combining imperative code with reactive code (by separating them in actors and reactors).^[17] Actors are suitable for use in distributed reactive systems.^[18]
• TidalCycles is a pure FRP domain specific language for musical pattern, embedded in the Haskell language.

ReactiveX, popularized by its JavaScript implementation rxjs, is functional and reactive but differs from functional reactive programming.^[19]

• Incremental computing
• Stream processing