Algorithms & Combinators
summary
Live demos show an AI-built toolkit (arraybox.dev, combinatory-logic pages and a vibecoded poll) that actually runs and maps algorithms across languages; examples include the three-arity flavor of replicate (repeat / compress / replicate), map variants and adjacent transform, and chunking functions that solve maximum consecutive ones by partition→length→max. Combinators used and implemented include flip/C, W, S/sigma and the powerful SI combinator (projections); C++ ranges (unique, chunk, adjacent_transform) and array languages interoperate as demonstrated.
AI-written summary · about
chapters (22)
- 0:00Welcome
- 1:17About the speaker
- 3:44Algorithms to combinators journey
- 9:38Copy algorithm family
- 13:28Algorithm flavors by argument
- 15:38Filtering with predicates & combinators
- 18:50C combinator explained
- 21:56W combinator & composition
- 24:25Cleaner filtering with combinators
- 27:13Binary predicates & adjacent filtering
- 29:04Map algorithm family
- 31:51Adjacent transform applications
- 36:10Copy & map families summary
- 37:13Chunk algorithm family
- 37:55Max consecutive ones problem
- 40:26Integer chunking with partition
- 44:02Binary chunking with chunk by
- 46:30Unary chunking with chunk by key
- 49:28SI combinator in C++
- 51:54Performance notes & applications
- 55:23All algorithm families summary
- 56:07Q&A
related talks
01h 01mFunction Composition in Programming Languages
42mThe Power of Function Composition
01h 33mComposition Intuition II
48mThe Power of Function Composition
57mBuilding an Intuition for Composition
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
54m"std::accumulate: Exploring an Algorithmic Empire"
01h 31m105 C++ Algorithms in 1 line* of Raku (*each)