Skip to content
Journal article

Push-pull functional reactive programming

Elliott C ...see all

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell - Haskell '09 (2009) p. 25

  • 163

    Readers

    Mendeley users who have this article in their library.
  • 29

    Citations

    Citations of this article.
  • N/A

    Views

    ScienceDirect users who have downloaded this article.
Sign in to save reference

Abstract

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 a new implementation, 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").

Author-supplied keywords

  • concurrency
  • data-driven
  • demand-driven
  • functional reactive programming
  • semantics

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Conal Elliott

Cite this document

Choose a citation style from the tabs below