Merge pull request #227 from purescript/more-0.14-updates

Fix warnings and doc-comments for 0.14

Author: hdgarrood

src/Control/Category.purs

@@ -13,6 +13,7 @@ import Control.Semigroupoid (class Semigroupoid, compose, (<<<), (>>>))
 -- | `Semigroupoid` law:
 -- |
 -- | - Identity: `identity <<< p = p <<< identity = p`
+class Category :: forall k. (k -> k -> Type) -> Constraint
 class Semigroupoid a <= Category a where
   identity :: forall t. a t t
 

src/Control/Semigroupoid.purs

@@ -9,6 +9,7 @@ module Control.Semigroupoid where
 -- |
 -- | One example of a `Semigroupoid` is the function type constructor `(->)`,
 -- | with `(<<<)` defined as function composition.
+class Semigroupoid :: forall k. (k -> k -> Type) -> Constraint
 class Semigroupoid a where
   compose :: forall b c d. a c d -> a b c -> a b d
 

src/Data/Monoid/Endo.purs

@@ -11,6 +11,7 @@ import Prelude
 -- | Endo f <> Endo g == Endo (f <<< g)
 -- | (mempty :: Endo _) == Endo identity
 -- | ```
+newtype Endo :: forall k. (k -> k -> Type) -> k -> Type
 newtype Endo c a = Endo (c a a)
 
 derive newtype instance eqEndo :: Eq (c a a) => Eq (Endo c a)

src/Data/NaturalTransformation.purs

@@ -3,17 +3,18 @@ module Data.NaturalTransformation where
 -- | A type for natural transformations.
 -- |
 -- | A natural transformation is a mapping between type constructors of kind
--- | `Type -> Type` where the mapping operation has no ability to manipulate the
--- | inner values.
+-- | `k -> Type`, for any kind `k`, where the mapping operation has no ability
+-- | to manipulate the inner values.
 -- |
 -- | An example of this is the `fromFoldable` function provided in
 -- | `purescript-lists`, where some foldable structure containing values of
 -- | type `a` is converted into a `List a`.
 -- |
 -- | The definition of a natural transformation in category theory states that
 -- | `f` and `g` should be functors, but the `Functor` constraint is not
--- | enforced here; that the types are of kind `Type -> Type` is enough for our
+-- | enforced here; that the types are of kind `k -> Type` is enough for our
 -- | purposes.
+type NaturalTransformation :: forall k. (k -> Type) -> (k -> Type) -> Type
 type NaturalTransformation f g = forall a. f a -> g a
 
 infixr 4 type NaturalTransformation as ~>

src/Type/Data/Row.purs

@@ -1,6 +1,6 @@
 module Type.Data.Row where
 
--- | A proxy data type whose type parameter is a type of kind `# Type` (a row
+-- | A proxy data type whose type parameter is a type of kind `Row Type` (a row
 -- | of types).
 -- |
 -- | Commonly used for specialising a function with a quantified type.

src/Type/Data/RowList.purs

@@ -1,6 +1,6 @@
 module Type.Data.RowList where
 
-import Prim.RowList (kind RowList)
+import Prim.RowList (RowList)
 
 -- | A proxy to carry information about a rowlist.
 data RLProxy (rowlist :: RowList Type)