An Abstract Description Method of Map-Reduce-Merge Using Haskell

Algorithm 1

 map :: (a → b)→[a]→[b ]       –type of map

 map f [] = []           –the empty list case

 map f (x: xs) = f x : map f xs      –the non-empty list case