Earlier quoted context omitted.
You might want to go over the original Elliot/Hudak work? It’s a bit obtuse since it’s all in Haskell, but signals were never meant to be historical accumulators unless you set them up that way. Signals are continuous values, they don’t reveal discrete events like streams do, that’s the main distinction between them, your signal computations then can be viewed as a continuous value derived from other continuous value…
I assume you mean "Functional Reactive Animation" (1997) by Conal Elliott and Paul Hudak? While searching for this, I found a great collection of papers on this topic of Functional Reactive Programming in the Haskell language wiki. Most are by Elliot and/or Hudak. Good stuff! https://wiki.haskell.org/Research_papers/Functional_reactive... This feels related to many other topics and various strategies, like incrementa…
Re: Incremental – A library for incremental computations
#81Yes definitely for compilation. Memoizing the tree and then repairing parsing and type information on each edit is how you get super fast responsiveness with code completion. It was relevant a couple of decades ago, things are different now with AI.