Merge pull request #9 from jonsterling/compiler-warnings

Remove spurious type quantifications (fix compiler warnings)

Author: paf31

src/Data/Lens/Fold.purs

@@ -144,15 +144,15 @@ filtered f = dimap (\x -> if f x then Right x else Left x) (either id id) <<< ri
 
 -- | Replicates the elements of a fold.
 replicated
-  :: forall r a b t f. (Applicative f, Contravariant f)
+  :: forall a b t f. (Applicative f, Contravariant f)
   => Int -> Optic (Star f) a b a t
 replicated n p = Star (flip go n <<< runStar p) where
   go x 0 = coerce (pure unit)
   go x n = x *> go x (n - 1)
 
 -- | Folds over a `Foldable` container.
 folded
-  :: forall f g a b t r. (Applicative f, Contravariant f, Foldable g)
+  :: forall f g a b t. (Applicative f, Contravariant f, Foldable g)
   => Optic (Star f) (g a) b a t
 folded p = Star $ foldr (\a r -> runStar p a *> r) (coerce $ pure unit)
 

src/Data/Lens/Internal/Wander.purs

@@ -12,7 +12,7 @@ import Data.Identity (Identity (..), runIdentity)
 -- | Class for profunctors that support polymorphic traversals.
 class (Strong p, Choice p) <= Wander p where
   wander
-    :: forall f s t a b. (forall f. (Applicative f) => (a -> f b) -> s -> f t)
+    :: forall s t a b. (forall f. (Applicative f) => (a -> f b) -> s -> f t)
     -> p a b -> p s t
 
 instance wanderFunction :: Wander Function where

src/Data/Lens/Setter.purs

@@ -39,28 +39,28 @@ set l b = over l (const b)
 (.~) :: forall s t a b. Setter s t a b -> b -> s -> t
 (.~) = set
 
-(+~) :: forall s t a a. (Semiring a) => Setter s t a a -> a -> s -> t
+(+~) :: forall s t a. (Semiring a) => Setter s t a a -> a -> s -> t
 (+~) p = over p <<< flip (+)
 
-(*~) :: forall s t a a. (Semiring a) => Setter s t a a -> a -> s -> t
+(*~) :: forall s t a. (Semiring a) => Setter s t a a -> a -> s -> t
 (*~) p = over p <<< flip (*)
 
-(-~) :: forall s t a a. (Ring a) => Setter s t a a -> a -> s -> t
+(-~) :: forall s t a. (Ring a) => Setter s t a a -> a -> s -> t
 (-~) p = over p <<< flip (-)
 
-(//~) :: forall s t a a. (DivisionRing a) => Setter s t a a -> a -> s -> t
+(//~) :: forall s t a. (DivisionRing a) => Setter s t a a -> a -> s -> t
 (//~) p = over p <<< flip (/)
 
-(||~) :: forall s t a a. (BooleanAlgebra a) => Setter s t a a -> a -> s -> t
+(||~) :: forall s t a. (BooleanAlgebra a) => Setter s t a a -> a -> s -> t
 (||~) p = over p <<< flip (||)
 
-(&&~) :: forall s t a a. (BooleanAlgebra a) => Setter s t a a -> a -> s -> t
+(&&~) :: forall s t a. (BooleanAlgebra a) => Setter s t a a -> a -> s -> t
 (&&~) p = over p <<< flip (&&)
 
-(<>~) :: forall s t a a. (Semigroup a) => Setter s t a a -> a -> s -> t
+(<>~) :: forall s t a. (Semigroup a) => Setter s t a a -> a -> s -> t
 (<>~) p = over p <<< flip (<>)
 
-(++~) :: forall s t a a. (Semigroup a) => Setter s t a a -> a -> s -> t
+(++~) :: forall s t a. (Semigroup a) => Setter s t a a -> a -> s -> t
 (++~) p = over p <<< flip (++)
 
 (?~) :: forall s t a b. Setter s t a (Maybe b) -> b -> s -> t