Factor provides several convenient implementations of combinators, specifically for simpler cases with few stack arguments. This page will document combinators that are similar in application, but may be different in effect.

•	map generalizes call over sequences of objects.
•	napply generalizes bi@ and tri@ for a number of objects on the stack.
•	cleave generalizes bi and tri for equal numbers of quotations and objects on the stack.
•	spread generalizes bi* and tri* for performing a set of operations that ignore the top n values of the stack, keeping them as is.