This system brings together two uncommon programming paradigms at once in a live environment where program structure, visualisation, and editing align in interesting ways. It combines concatenative, rewriting, and live programming in an interactive programming environment, using each of them to compensate for weaknesses of the other, while exposing the system state for inspection and for modification through both direct manipulation and evaluation of ad hoc code. Concatenative or compositional programming languages (typically) use stacks to store data^, with arguments and return values passed implicitly, and can offer attractive ergonomics for some applications. Each function consumes some arguments from the stack, performs its operation, and leaves its results on the stack, so a pipeline of composed functions is very straightforward, and any subsequence of terms can be trivially factored out into its own named function without any impact on behaviour (that is, a sequence can be removed into the body of a new function and replaced with the name of that function), a structure encouraged by the paradigm^. However, they are also sometimes called "write-only languages" because programs can fall into convoluted stack-juggling, where the values in the stack need complex reordering to align them correctly for the functions that will be applied to them, sometimes interwoven with program logic. Well-known concatenative languages include Forth, Joy, and Factor (Pestov et al. 2010). One concatenative language of note for this work is Mirth, which allows the use of arbitrarily many named stacks. Rewriting programming languages operate by the repeated application of rewrite rules over some defined field of data (commonly an ordered sequence of values or a multiset). Each rule describes a pattern that can exist in that data, and then a replacement for the elements matched by the pattern. Many formal models operate like this, but are not typically regarded as programming languages in themselves, while many logic programming languages could also be analysed in this way, but explicit rewriting programming languages are relatively rare. One rewriting language of particular note for this work is Nova, which applies rewriting rules across multiple named stacks.