Pluggable Stackable API Implementations
summary
Builds a composable API that stacks a cache + bloom + base map behind the same Data.Map-like interface, shows concrete Haskell code using type families, Except for errors, and KnownNat/DataKinds to turn compile-time sizes (examples: LRU size 1024 or 20, bloom with 3 hashes and 4096 bits) into runtime constructors. Demonstrates higher-order instances that compose plugins, executable slides and tests that compile, and real use in blockchain sharding with measurable performance reported in the paper.
AI-written summary · about
chapters (6)
- 0:00Start
- 0:17Pluggable Stackable Api Implementations
- 12:40Map Definition
- 33:42Higher Order Instances
- 35:26Configuring the Bloom Filter at the Type Level
- 42:56Cache
related talks
31mThe Opposite of Spaghetti Code: Building for Understanding
39mSlicing and Dicing Through Complexity with Hanami
43mScaling Full-Stack Applications
13mThe Power of Optics
28mOh Composable World!
01h 01mThe Power of Composition
30mCompose All the Things
27mHarness the power of functions to build composable rack applications