Name
Abstract | ||
|---|---|---|
Many programs have an inherently reactive nature imposed by the functional dependencies between their data and external events. Classically, these dependencies are dealt with using callbacks. Reactive programming with first-class reactive values is a paradigm that aims to encode callback logic in declarative statements. Reactive values concisely define dependencies between singular data elements, but cannot efficiently express dependencies in larger datasets. Orthogonally, embedding reactive values in a shared-memory concurrency model convolutes their semantics and requires synchronization. This paper presents a generic framework for reactive programming that extends first-class reactive values with the concept of lazy reactive containers, backed by several concrete implementations. Our framework addresses concurrency by introducing reactive isolates. We show examples that our programming model is efficient and convenient to use. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2637647.2637656 | SCALA@ECOOP |
Keywords | Field | DocType |
algorithms,reactive collections,languages,reactive mutations,data-flow languages,reactive signals,reactive programming,isolates,reduction tree | Synchronization,Programming paradigm,Concurrency,Computer science,Functional dependency,Implementation,Theoretical computer science,Callback,Reactive programming,Semantics | Conference |
Citations | PageRank | References |
7 | 0.51 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandar Prokopec | 1 | 163 | 13.56 |
| Philipp Haller | 2 | 441 | 27.11 |
| Martin Odersky | 3 | 2261 | 170.39 |