The circuit as a point-free general model of computation
summary
Argues that modeling programs as a circuit — a point-free graph of processes — cuts control-flow complexity by making the actual combinators explicit: lists/streams as monads, async callbacks as continuations, and arrows for dataflow. Shows concrete code: a working drag‑and‑drop implemented in vanilla callbacks, an async/module and a streamified version (stream requires tuple wrapping so move had to change), and a partial pong demo with JSFiddles. Claims callback hell is widespread (async is heavily depended upon) and promotes streams and arrows as practical tools.
AI-written summary · about
chapters (12)
- 0:00Intro
- 4:33Drag and Drop
- 6:20Async
- 8:13Drag Drop
- 10:35Streams
- 14:27Streams interface
- 18:38List and Unit
- 21:31Function Chaining
- 23:10Moving Functions
- 24:41ABC
- 26:54Functional reactive programming
- 27:56Broken game of pong
