Persistent data structures - good for UI

on YouTube ↗28m

" summary

Argues that using ClojureScript immutable data structures on the client gives cheap, shareable history so UIs can keep every state without full copies, demonstrated by replaying an 88‑move chess game and stepping to any move. Shows integration with React.js diffing where immutable nodes allow reference‑equality checks and claim ~6× speedups in some cases. Mentions core.async go channels for world events and a tiny state management API (reset/swap) that records and replays app state.

AI-written summary · about

" chapters (6)

1. 0:00Modeling state in UI
2. 4:42Immutable data benefits
3. 7:18React and virtual DOM
4. 11:23Value snapshots in time
5. 14:39ClojureScript in practice
6. 22:41Architectural takeaways

" related talks

• 33mThe Functional Final FrontierDavid Nolen · GOTO Chicago 2014
• 35mClojureScript & User Interfaces: Simplicity yields PossibilitiesJelle Akkerman · :clojureD 2015
• 27mThe Functional Final FrontierDavid Nolen · Clojure/West 2014
• 29mDesign decisions in React-based ClojureScript applicationsFalko Riemenschneider · :clojureD 2017
• 32mElectric Clojure Differential Dataflow for UI (KEYNOTE)Dustin Getz · LambdaConf 2025
• 34mFunctional UIs and Unidirectional DataflowMikael Brevik · JSConf Budapest 2015
• 34mImmutability: Putting The Dream Machine To WorkDavid Nolen · GOTO Copenhagen 2014
• 37mVisualizing Persistent Data StructuresDann Toliver · Strange Loop 2014