The Power of Function Composition
summary
Five distinct function-composition strategies are demonstrated (operators, functions, trains, chains) and used to solve a LeetCode “special array” problem across eight languages: Python, Haskell, Clojure, APL/Cap, BQN, J, Jelly and Wewa. The talk shows concrete code: using Python’s itertools pairwise and operator.ne, the S and B combinators, APL’s n‑wise reductions, and a custom Jelly translator tool. It highlights that mapAdjacent plus a simple reduction matches combinatoric solutions and notes Wewa’s recent release (Wewa (Sep 2023)).
AI-written summary · about
chapters (21)
- 0:00Introduction
- 1:04Talk overview
- 3:11Function composition strategies
- 8:08Combinators explained
- 11:16Elementary combinators
- 16:38Problem: Special array
- 18:21Python iterative solution
- 20:47Python zip/generators
- 23:18Python S combinator
- 25:25Haskell combinators
- 27:54Haskell map adjacent
- 29:58Closure threading macros
- 31:45Array languages overview
- 33:31Live coding APL
- 36:16Live coding Cap
- 37:41Live coding BQN
- 39:49Live coding J
- 41:17Jelly chains
- 43:03Wewa stack/array
- 44:49Summary
- 46:12Resources
