the.com/partial application
give a function some arguments now, the rest later — it waits, patiently, like a recipe half-measured.
means a technique where you fix a few arguments of a function, producing a new function that only needs the remaining ones.
from formalized in lambda calculus and functional programming theory, where every function technically takes one argument at a time — partial application just stops early and hands you the intermediate.
not curryingcurried functions enable it, but they are not the same
js examplebind() partially applies arguments to a function
predates codelambda calculus formalized this in the 1930s