I've always meant to hack up a Rete implement but never found the time. Your example here makes it look like a reactive program though, which I have done. In fu

I've always meant to hack up a Rete implement but never found the time. Your example here makes it look like a reactive program though, which I have done. In functional reactive programming, you topologically sort the update graph to ensure that nodes are updated in a correct order so no glitches occur, and the reactive graph only updates subgraphs that are affected by any change. Is that basically what Rete is doing?