Propagators Part 2
Offered By: GOTO Conferences via YouTube
Course Description
Overview
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.
Syllabus
Propagators Part 2 • Edward Kmett • YOW! 2016
Taught by
GOTO Conferences
Related Courses
Discrete OptimizationUniversity of Melbourne via Coursera Modeling Discrete Optimization
University of Melbourne via Coursera 离散优化算法篇 Solving Algorithms for Discrete Optimization
The Chinese University of Hong Kong via Coursera Solving Algorithms for Discrete Optimization
University of Melbourne via Coursera Reverse Engineering 3201: Symbolic Analysis
OpenSecurityTraining2 via Independent