Use ~>

Author: mlang

src/Data/List.purs

@@ -110,13 +110,13 @@ import Data.Traversable (scanl, scanr) as Exports
 -- | Convert a list into any unfoldable structure.
 -- |
 -- | Running time: `O(n)`
-toUnfoldable :: forall f a. Unfoldable f => List a -> f a
+toUnfoldable :: forall f. Unfoldable f => List ~> f
 toUnfoldable = unfoldr (\xs -> (\rec -> Tuple rec.head rec.tail) <$> uncons xs)
 
 -- | Construct a list from a foldable structure.
 -- |
 -- | Running time: `O(n)`
-fromFoldable :: forall f a. Foldable f => f a -> List a
+fromFoldable :: forall f. Foldable f => f ~> List
 fromFoldable = foldr Cons Nil
 
 --------------------------------------------------------------------------------

src/Data/List/Lazy.purs

@@ -110,13 +110,13 @@ import Data.Traversable (scanl, scanr) as Exports
 -- | Convert a list into any unfoldable structure.
 -- |
 -- | Running time: `O(n)`
-toUnfoldable :: forall f a. Unfoldable f => List a -> f a
+toUnfoldable :: forall f. Unfoldable f => List ~> f
 toUnfoldable = unfoldr (\xs -> (\rec -> Tuple rec.head rec.tail) <$> uncons xs)
 
 -- | Construct a list from a foldable structure.
 -- |
 -- | Running time: `O(n)`
-fromFoldable :: forall f a. Foldable f => f a -> List a
+fromFoldable :: forall f. Foldable f => f ~> List
 fromFoldable = foldr cons nil
 
 fromStep :: forall a. Step a -> List a

src/Data/List/Lazy/NonEmpty.purs

@@ -25,7 +25,7 @@ import Data.NonEmpty ((:|))
 import Data.Tuple (Tuple(..))
 import Data.Unfoldable (class Unfoldable, unfoldr)
 
-toUnfoldable :: forall f a. Unfoldable f => NonEmptyList a -> f a
+toUnfoldable :: forall f. Unfoldable f => NonEmptyList ~> f
 toUnfoldable =
   unfoldr (\xs -> (\rec -> Tuple rec.head rec.tail) <$> L.uncons xs) <<< toList
 
@@ -38,7 +38,7 @@ fromList l =
     L.Nil -> Nothing
     L.Cons x xs -> Just (NonEmptyList (defer \_ -> x :| xs))
 
-toList :: forall a. NonEmptyList a -> L.List a
+toList :: NonEmptyList ~> L.List
 toList (NonEmptyList nel) = case force nel of x :| xs -> x : xs
 
 singleton :: forall a. a -> NonEmptyList a

src/Data/List/Lazy/Types.purs

@@ -161,7 +161,7 @@ instance extendList :: Extend List where
 
 newtype NonEmptyList a = NonEmptyList (Lazy (NonEmpty List a))
 
-toList :: forall a. NonEmptyList a -> List a
+toList :: NonEmptyList ~> List
 toList (NonEmptyList nel) = Z.defer \_ ->
   case force nel of x :| xs -> x : xs
 

src/Data/List/NonEmpty.purs

@@ -25,7 +25,7 @@ import Data.NonEmpty as NE
 import Data.Tuple (Tuple(..))
 import Data.Unfoldable (class Unfoldable, unfoldr)
 
-toUnfoldable :: forall f a. Unfoldable f => NonEmptyList a -> f a
+toUnfoldable :: forall f. Unfoldable f => NonEmptyList ~> f
 toUnfoldable =
   unfoldr (\xs -> (\rec -> Tuple rec.head rec.tail) <$> L.uncons xs) <<< toList
 
@@ -36,7 +36,7 @@ fromList :: forall a. L.List a -> Maybe (NonEmptyList a)
 fromList L.Nil = Nothing
 fromList (x : xs) = Just (NonEmptyList (x :| xs))
 
-toList :: forall a. NonEmptyList a -> L.List a
+toList :: NonEmptyList ~> L.List
 toList (NonEmptyList (x :| xs)) = x : xs
 
 singleton :: forall a. a -> NonEmptyList a

src/Data/List/Types.purs

@@ -116,7 +116,7 @@ instance extendList :: Extend List where
 
 newtype NonEmptyList a = NonEmptyList (NonEmpty List a)
 
-toList :: forall a. NonEmptyList a -> List a
+toList :: NonEmptyList ~> List
 toList (NonEmptyList (x :| xs)) = x : xs
 
 derive instance newtypeNonEmptyList :: Newtype (NonEmptyList a) _