Building Your Perfect World With Concurrent Combinators in F#!
summary
Concrete F# code wins: a library of reusable concurrent combinators is implemented (async and Task variants), including async/applicative combinators, an apply/traverse that turns a list of effects into Task<list>, a divide‑and‑conquer MapReduce, retry with backoff and orElse fallbacks, and an agent pipeline composer. A stock‑market demo races three services, cancels remaining tasks, and composes predicates with end/or operators to decide buys. Slides and source code are uploaded with runnable examples and simple benchmarks.
AI-written summary · about
chapters (26)
- 0:00Intro
- 1:28About me
- 2:07What is Combinator
- 3:00Abstraction Data
- 5:57Composition
- 7:36Challenges
- 8:19Function Combinator
- 11:13Functionality Programming
- 16:30ASIC Computation
- 17:04Fsharp
- 18:15Or else
- 21:12Functional Programming
- 21:37Functional Toolbox
- 23:47Monoids
- 25:49MapReduce
- 26:48Parallel MapReduce
- 29:16Benchmark
- 29:34Map
- 30:40Effect
- 32:06Nesting
- 33:32Applicative
- 38:47Traverse
- 39:50Bind
- 40:57Crazy Operator
- 42:12Agent
- 44:36Execution
related talks
35mEffect ful computations with Fibers
28mOh Composable World!
29mParallel computing in ReactJS: Provide a pleasant user experience
34mParallel computing in React
30mFunctional Programming Fundamentals
30mCracking the Concurrent Mode
28mHow to use Functional Programming in your React app
07mComonads on your everyday UI