YoVDO

Propagators Part 1

Offered By: GOTO Conferences via YouTube

Tags

GOTO Conferences Courses Algorithms Courses Constraint Programming Courses Algorithm Optimization Courses

Course Description

Overview

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

Syllabus

Propagators Part 1 • 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