The Art of the Meta Stream Protocol: Torrents of Streams
Mon 11 Apr 2022 07:30 - 07:55 at Virtual Space - ‹Programming› Online Monday Chair(s): Jonathan Edwards
The rise of streaming libraries such as Akka Stream, Reactive Extensions, and LINQ popularized the declarative functional style of data processing. The stream paradigm offers concise syntax to write down processing pipelines to consume the vast amounts of real-time data available today.
These libraries offer the programmer a domain specific language (DSL) embedded in the host language to describe data streams. These libraries however, all suffer from extensibility issues. The semantics of a stream is hard-coded into the DSL language and cannot be changed by the user of the library.
We introduce an approach to modify the semantics of a streaming library by means of meta-programming at both run-time and compile-time, and showcase its generality.
We show that the expressiveness of the meta-facilities is strong enough to enable push and pull semantics, error handling, parallelism, and operator fusion.
We evaluate our work by implementing the identified shortcomings in terms of a novel stream meta-architecture and show that its design and architecture adhere to the design principles of a meta-level architecture.
The state of the art offers plenty of choice to programmers regarding reactive stream processing libraries. Expressing reactive systems is otherwise difficult to do in general purpose languages. Extensibility and fine-tuning should be possible in these libraries to ensure a broad variety of applications can be expressed within this single DSL.
Thu 24 MarDisplayed time zone: Lisbon change
10:30 - 12:00
Functional ProgrammingResearch Papers at Auditorium Nobre
Chair(s): Stefan Marr University of Kent
|The Art of the Meta Stream Protocol: Torrents of StreamsVol. 6|
Christophe De Troyer Vrije Universiteit Brussel, Jens Nicolay Vrije Universiteit Brussel, Wolfgang De Meuter Vrije Universiteit BrusselLink to publication
|Topology-level Reactivity in Distributed Reactive Programs: Reactive Acquaintance Management using Proximity SetsVol. 6|
Sam Van den Vonder Vrije Universiteit Brussel, Thierry Renaux Vrije Universiteit Brussel, Wolfgang De Meuter Vrije Universiteit BrusselLink to publication DOI
|United Monoids: Finding Simplicial Sets and Labelled Algebraic Graphs in TreesVol. 6|
Andrey Mokhov Jane StreetLink to publication