Higher-order reactive programming with incremental lists

29Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reactive programming with first class time-varying values as in Functional Reactive Programming (FRP) is a powerful paradigm for designing and implementing event-based applications. Existing implementations deal with simple values. Time-varying collections can only propagate whether they have changed or not but not what has changed. This is inefficient compared to fine-grained callback driven logic that propagates incremental changes. In this work, we present a framework, Scala.React, with reactive abstractions for event streams, time-varying values as well as an incremental reactive list. Our reactive lists support both first-order reactivity by means of composition similar to functional collections via |map|, |filter|, |fold| and alike, as well as higher-order reactivity with support for time-varying collection elements. The framework automatically propagates incremental changes and guarantees strong data consistency. We show in examples that our system is convenient to use and performs well. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Maier, I., & Odersky, M. (2013). Higher-order reactive programming with incremental lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7920 LNCS, pp. 707–731). Springer Verlag. https://doi.org/10.1007/978-3-642-39038-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free