A function taking another function as an argument or returning one as a result. Function composition, the map function and a list fold are standard examples.
Apply a function to each element of a collection while retaining its arrangement. On lists,
map f [] = [] and map f (x:xs) = f x : map f xs. Its principal type in Haskell is (a -> b) -> [a] -> [b]. The element types may change independently; no equality test or ordering of elements is required. Articles by others on the same topic
There are currently no matching articles.