YoVDO

Propagators Part 2

Offered By: GOTO Conferences via YouTube

Tags

GOTO Conferences Courses Haskell Courses Algorithms Courses Constraint Programming Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera