Haskell function composition operator of type (c→d) → (a→b→c) → (a→b→d)

by

My preferred implementation for this is

fmap . fmap :: (Functor f, Functor f1) => (a -> b) -> f (f1 a) -> f (f1 b)

If only because it is fairly easy to remember.

When instantiating f and f1 to (->) c and (->) d respectively you get the type

(a -> b) -> (c -> d -> a) -> c -> d -> b

which is the type of 

(.) . (.) ::  (b -> c) -> (a -> a1 -> b) -> a -> a1 -> c

but it is a bit easier to rattle off the fmap . fmap version and it generalizes to other functors.

Sometimes this is written fmap fmap fmap, but written as fmap . fmap it can be more readily expanded to allow more arguments.

fmap . fmap . fmap 
:: (Functor f, Functor g, Functor h) => (a -> b) -> f (g (h a)) -> f (g (h b))

fmap . fmap . fmap . fmap 
:: (Functor f, Functor g, Functor h, Functor i) => (a -> b) -> f (g (h (i a))) -> f (g (h (i b))

etc.

In general fmap composed with itself n times can be used to fmap n levels deep!

And since functions form a Functor, this provides plumbing for n arguments.

For more information, see Conal Elliott’s Semantic Editor Combinators.

More Related Contents:

  1. What does (f .) . g mean in Haskell?
  2. What is the difference between . (dot) and $ (dollar sign)?
  3. How is this fibonacci-function memoized?
  4. runST and function composition
  5. Haskell function composition (.) and function application ($) idioms: correct use
  6. Currying 3 Arguments in Haskell
  7. How to use (->) instances of Monad and confusion about (->)
  8. Composing function composition: How does (.).(.) work?
  9. Dot Operator in Haskell: need more explanation
  10. Haskell: Given a list of numbers and a number k, return whether any two numbers from the list add up to k
  11. What is the monomorphism restriction?
  12. When is memoization automatic in GHC Haskell?
  13. How to get normal value from IO action in Haskell
  14. How do you represent a graph in Haskell?
  15. What’s the “|” for in a Haskell class definition?
  16. Haskell: Lists, Arrays, Vectors, Sequences
  17. What are “n+k patterns” and why are they banned from Haskell 2010?
  18. How do I write, “if typeclass a, then a is also an instance of b by this definition.”
  19. Applicative functor evaluation is not clear to me
  20. Expressing do block using only monadic bind syntax
  21. Why do we need monads?
  22. What constitutes a fold for types other than list?
  23. How to make a CAF not a CAF in Haskell?
  24. Integral operators quot vs. div
  25. How to interpret bind/>>= of the function instance?
  26. Comparing Haskell’s Snap and Yesod web frameworks
  27. how to implement doubly linked lists
  28. How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)?
  29. ‘some’ and ‘many’ functions from the ‘Alternative’ type class [duplicate]
  30. Sampling sequences of random numbers in Haskell

Leave a Comment