concept combinator in category system administration

This is an excerpt from Manning's book Functional and Reactive Domain Modeling.
The function map takes two parameters—a list of strings and another function, length: String -> Int. map iterates over the list, and applies the function length to every element of the list. The result it generates is another list, and each of those elements is the result of applying length, which is a list of integers. This is an excellent example of how to think functionally and points to some interesting characteristics of this paradigm, as table 1.2 shows. Higher-order functions such as map are also known as combinators.
One of the core strengths of functional programming is that it provides you the right tool to declare what you want to do instead of how to do it. The how part can be abstracted within functions that you can compose together with the what part of your implementation. Consider the following example from listing 4.10 in section 4.4.3. The implementation of tradeGeneration looks like a copy from the business specification document that mentions what steps you need to follow to generate trades. How the various steps combine together both in the happy path and in the exceptional path of execution is abstracted within the combinator andThen. If you followed the example in section 4.4.3, you must have noticed that andThen is a higher-order function defined in the Kleisli class and uses the algebra of a monad to provide the desired effect within your API. All this power comes from the ability to compose functions and reuse existing algebra and helps make your implementation succinct yet expressive.[2]