These are chat archives for jdubray/sam
usually it's pretty straightforward to sort out!
well state alignment in distributed systems is not... Guido coauthors papers with Barbara Liskov, so he's not your average computer scientist. No offense, but I'd like to see what he has to say.
Topological sorting of the dependency graph could still be used inside the update transaction to prevent multiple recalculations of the same functional parts. Doing so would, however, imply forcing all hosts’ local update threads that are involved in the transaction to emulate a single-threaded execution
An ideal solution would be designing a new algorithm, which incorporates both
concurrent updates of independent reactives (those that are incomparable in the topological
order) and prevention of multiple recalculations of affected reactives. It is our
goal to provide this hybrid solution
Several languages implement concepts from reactive programming in various flavors. The interested reader can refer to  for an overview. None of them provides glitch-freedom in
the distributed setting.