Distributed functional programming
summary
Recasts functional programming concepts for distributed systems by mapping purity, composition and immutable data into distributed-friendly analogues. Covers monotonic functions as a substitute for pure functions, techniques for expressing dependencies and causality across machines, and performant distributed representations of functional data structures using general pseudocode rather than language-specific examples.
AI-written summary · about
chapters (16)
- 0:00Start
- 13:59THE BREAKDOWN
- 15:32MONOTONICITY
- 17:13EXAMPLE: WEB PAGE HIT COUNTER
- 18:48EXAMPLE: USER HIGH SCORES
- 19:56EXAMPLE: TOP K LIST - IMPLICIT PARAM
- 21:02TOP K LIST-REINTERPRETED
- 23:26SUCCESS STORIES
- 30:21IDEMPOTENCY
- 32:07EXAMPLE: EXACTLY ONCE PROCESSING
- 34:20EXAMPLE: CAUSALITY TRACKING
- 49:58EXERCISE: COMBINING IDEAS
- 56:18PURITY RECAP
- 57:55OVERALL ROADMAP
- 58:10IMMUTABILITY ON A SINGLE MACHINE
- 59:12WHY DO WE LIKE IMMUTABILITY?
related talks
42mFunctional Programming in 40 Minutes
31mA Primer on Functional Programming
01h 06mThe Joy of Functional Programming
49m“Applying functional programming in code design"
44mFunctional Programming You Already Know
32mFunctional Programming for (Dev)Operations and Infrastructure
45mFrom Imperative to Functional
34mPrinciples of functional programming with examples in Java and Haskell
