Remove unnecessary Functor constraints

Author: garyb

README.md

@@ -41,7 +41,7 @@
 
     foldrArray :: forall a b. (a -> b -> b) -> b -> [a] -> b
 
-    for_ :: forall a b f m. (Functor m, Applicative m, Foldable f) => f a -> (a -> m b) -> m {  }
+    for_ :: forall a b f m. (Applicative m, Foldable f) => f a -> (a -> m b) -> m {  }
 
     mconcat :: forall f m. (Foldable f, Monoid m) => f m -> m
 
@@ -51,20 +51,20 @@
 
     product :: forall f. (Foldable f) => f Prim.Number -> Prim.Number
 
-    sequence_ :: forall a f m. (Functor m, Applicative m, Foldable f) => f (m a) -> m {  }
+    sequence_ :: forall a f m. (Applicative m, Foldable f) => f (m a) -> m {  }
 
     sum :: forall f. (Foldable f) => f Prim.Number -> Prim.Number
 
-    traverse_ :: forall a b f m. (Functor m, Applicative m, Foldable f) => (a -> m b) -> f a -> m {  }
+    traverse_ :: forall a b f m. (Applicative m, Foldable f) => (a -> m b) -> f a -> m {  }
 
 
 ## Module Data.Traversable
 
 ### Type Classes
 
     class Traversable t where
-      traverse :: forall a b m. (Functor m, Applicative m) => (a -> m b) -> t a -> m (t b)
-      sequence :: forall a m. (Functor m, Applicative m) => t (m a) -> m (t a)
+      traverse :: forall a b m. (Applicative m) => (a -> m b) -> t a -> m (t b)
+      sequence :: forall a m. (Applicative m) => t (m a) -> m (t a)
 
 
 ### Type Class Instances
@@ -82,6 +82,6 @@
 
 ### Values
 
-    for :: forall a b m t. (Functor m, Applicative m, Traversable t) => t a -> (a -> m b) -> m (t b)
+    for :: forall a b m t. (Applicative m, Traversable t) => t a -> (a -> m b) -> m (t b)
 
-    zipWithA :: forall m a b c. (Functor m, Applicative m) => (a -> b -> m c) -> [a] -> [b] -> m [c]
+    zipWithA :: forall m a b c. (Applicative m) => (a -> b -> m c) -> [a] -> [b] -> m [c]

src/Data/Foldable.purs

@@ -57,13 +57,13 @@ instance foldableTuple :: Foldable (Tuple a) where
 fold :: forall f m. (Foldable f, Monoid m) => f m -> m
 fold = foldMap id
 
-traverse_ :: forall a b f m. (Functor m, Applicative m, Foldable f) => (a -> m b) -> f a -> m {}
+traverse_ :: forall a b f m. (Applicative m, Foldable f) => (a -> m b) -> f a -> m {}
 traverse_ f = foldr ((*>) <<< f) (pure {})
 
-for_ :: forall a b f m. (Functor m, Applicative m, Foldable f) => f a -> (a -> m b) -> m {}
+for_ :: forall a b f m. (Applicative m, Foldable f) => f a -> (a -> m b) -> m {}
 for_ = flip traverse_
 
-sequence_ :: forall a f m. (Functor m, Applicative m, Foldable f) => f (m a) -> m {}
+sequence_ :: forall a f m. (Applicative m, Foldable f) => f (m a) -> m {}
 sequence_ = traverse_ id
 
 mconcat :: forall f m. (Foldable f, Monoid m) => f m -> m

src/Data/Traversable.purs

@@ -9,8 +9,8 @@ import Data.Maybe
 import Data.Tuple
 
 class Traversable t where
-  traverse :: forall a b m. (Functor m, Applicative m) => (a -> m b) -> t a -> m (t b)
-  sequence :: forall a m. (Functor m, Applicative m) => t (m a) -> m (t a)
+  traverse :: forall a b m. (Applicative m) => (a -> m b) -> t a -> m (t b)
+  sequence :: forall a m. (Applicative m) => t (m a) -> m (t a)
 
 instance traversableArray :: Traversable [] where
   traverse _ []     = pure []
@@ -43,9 +43,9 @@ instance traversableTuple :: Traversable (Tuple a) where
 
   sequence (Tuple x y) = Tuple x <$> y
 
-for :: forall a b m t. (Functor m, Applicative m, Traversable t) => t a -> (a -> m b) -> m (t b)
+for :: forall a b m t. (Applicative m, Traversable t) => t a -> (a -> m b) -> m (t b)
 for x f = traverse f x
 
-zipWithA :: forall m a b c. (Functor m, Applicative m) => (a -> b -> m c) -> [a] -> [b] -> m [c]
+zipWithA :: forall m a b c. (Applicative m) => (a -> b -> m c) -> [a] -> [b] -> m [c]
 zipWithA f xs ys = sequence (zipWith f xs ys)