Simply efficient functional reactivity. Conal Elliott.

Functional reactive programming (FRP) has simple and powerful semantics, but has resisted efficient implementation. In particular, most past implementations have used demand-driven sampling, which accommodates FRP's continuous time semantics and fits well with the nature of functional programming. Consequently, values are wastefully recomputed even when inputs don't change, and reaction latency can be as high as the sampling period.

This paper presents a way to implement FRP that combines data- and demand-driven evaluation, in which values are recomputed only when necessary, and reactions are nearly instantaneous. The implementation is rooted in a new simple formulation of FRP and its semantics and so is easy to understand and reason about.

On the road to efficiency and simplicity, we'll meet some old friends (monoids, functors, applicative functors, monads, morphisms, and improving values) and make some new friends (functional future values, reactive normal form, and concurrent â€œunambiguous choiceâ€).

I'm not sure exactly where to classify this submission to ICFP 2008, but I think many here will be interested in it.

## Recent comments

7 hours 17 min ago

8 hours 40 min ago

9 hours 20 min ago

9 hours 44 min ago

10 hours 41 min ago

11 hours 30 min ago

17 hours 39 min ago

18 hours 12 min ago

18 hours 24 min ago

1 day 10 hours ago