Reactive programming is a programming paradigm for interactive programs. Reactive programming programs define a dataflow graph and propagate data through it, as an alternative to manual management of callbacks. Dynamic reactive programming allows run time changes to the edges of the dataflow graph, but as the graph can change dynamically, graph nodes can be subject to memory leaks.

We present drx – dynamic reactive programming – a DSL for interactive programs, that is programs that interact with other programs or users. drx combines ideas from dataflow, synchronous and reactive programming. The focus of this in-progress paper is the interplay of dynamic dataflow and garbage collection, and our contribution the automatic memory management of the dataflow graph.