Propagators Part 2

Explore the second part of Edward Kmett's presentation on propagators, delivered at YOW! 2016. Dive into algorithms centered around information propagation to reach deterministic fixed points, including CRDTs, Datalog, SAT solving, functional reactive programming, and constraint programming. Examine the "propagator" framework by Sussman and Radul, and Lindsey Kuper's work on "lattice variables" (LVars). Discover how blending these frameworks leads to sufficient conditions for propagators to terminate consistently. Learn how insights from various domains can be applied to optimize propagator algorithms. Gain valuable knowledge in Haskell, functional programming, and advanced algorithmic concepts from the Chair of the Haskell Core Libraries Committee.