Functional reactive programming, continued

  • Authors:
  • Henrik Nilsson;Antony Courtney;John Peterson

  • Affiliations:
  • Yale University, New Haven, CT;Yale University, New Haven, CT;Yale University, New Haven, CT

  • Venue:
  • Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Functional Reactive Programming (FRP) extends a host programming language with a notion of time flow. Arrowized FRP (AFRP) is a version of FRP embedded in Haskell based on the arrow combinators. AFRP is a powerful synchronous dataflow programming language with hybrid modeling capabilities, combining advanced synchronous dataflow features with the higher-order lazy functional abstractions of Haskell. In this paper, we describe the AFRP programming style and our Haskell-based implementation. Of particular interest are the AFRP combinators that support dynamic collections and continuation-based switching. We show how these combinators can be used to express systems with an evolving structure that are difficult to model in more traditional dataflow languages.