05:34Propagators Part 2 • Edward Kmett • YOW! 2016
From the creator
This presentation was recorded at YOW! 2016. #GOTOcon #YOW https://yowcon.com Edward Kmett - Chair of the Haskell Core Libraries Committee Part 1 is available here: https://youtu.be/tETbivwzXBM ABSTRACT There are a lot of algorithms that revolve around iterating a form of information propagation until it attains a deterministic fixed point. CRDTs, Datalog, SAT solving, functional reactive programming, and constraint programming all fit into this mold. One framework for these sorts of algorithms is the notion of a “propagator” due to Sussman and Radul, but until now little rigor has applied to know how such algorithms terminate with consistent results. Another framework is Lindsey Kuper’s work on the notion of “lattice variables” (LVars), which addresses termination, parallelism and eventual consistency well, but not iteration. By blending these frameworks, I’ll build up a series of sufficient conditions for propagators to terminate with consistent results and proceed to show how we can use this common framework to steal insights and quirks from each individual domain to try to optimize the rest. [...] RECOMMENDED BOOKS Vitaly Bragilevsky • Haskell in Depth • https://amzn.to/3EXpmbe Rebecca Skinner • Effective Haskell • https://amzn.to/3VgUKsh Graham Hutton • Programming in Haskell • https://amzn.to/3Fi8rBC John Whitington • Haskell from the Very Beginning • https://amzn.to/3VmX68R https://twitter.com/GOTOcon https://www.linkedin.com/company/goto- https://www.facebook.c
Published 2023-01-13 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.
Keep exploring Learn to Code
05:34
02:05
02:17
10:51Competitive Programming Tutorial #42 | Convex hull trick: turn the DP into lines
SyntaxPilot
08:20
04:59IIMT Collaborative Robot Palletizing Programming Tutorial | Easy Pick & Place Stacking
IIMTRobot
09:25