Simply efficient functional reactivity Export

@article{citeulike:3917776, 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 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").}, author = {Elliott, Conal}, chapter = {2008-1}, citeulike-article-id = {3917776}, citeulike-linkout-0 = {http://conal.net/papers/simply-reactive/}, institution = {LambdaPix}, keywords = {2008, frp, haskell}, month = {April}, posted-at = {2009-06-23 14:45:45}, priority = {2}, title = {Simply efficient functional reactivity}, url = {http://conal.net/papers/simply-reactive/}, year = {2008} }

TY - JOUR ID - citeulike:3917776 L3 - citeulike-article-id:3917776 N2 - 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"). TI - Simply efficient functional reactivity KW - 2008 KW - frp KW - haskell AU - Elliott, Conal PY - 2008/04// UR - http://conal.net/papers/simply-reactive/ ER -