Propagators Part 1

Explore the concept of propagators in this conference talk from YOW! 2016. Dive into algorithms that involve iterating information propagation to reach deterministic fixed points, including CRDTs, Datalog, SAT solving, functional reactive programming, and constraint programming. Learn about Sussman and Radul's propagator framework and Lindsey Kuper's lattice variables (LVars) approach. Discover how blending these frameworks can lead to sufficient conditions for propagators to terminate with consistent results. Gain insights into optimizing various domains by leveraging this common framework. Presented by Edward Kmett, Chair of the Haskell Core Libraries Committee, this talk offers a deep dive into advanced concepts in functional programming and algorithm design.