Rename id to identity

Author: garyb

src/Control/Applicative.purs

@@ -25,7 +25,7 @@ import Data.Unit (Unit, unit)
 -- | Instances must satisfy the following laws in addition to the `Apply`
 -- | laws:
 -- |
--- | - Identity: `(pure id) <*> v = v`
+-- | - Identity: `(pure identity) <*> v = v`
 -- | - Composition: `pure (<<<) <*> f <*> g <*> h = f <*> (g <*> h)`
 -- | - Homomorphism: `(pure f) <*> (pure x) = pure (f x)`
 -- | - Interchange: `u <*> (pure y) = (pure (_ $ y)) <*> u`

src/Control/Apply.purs

@@ -8,7 +8,7 @@ module Control.Apply
 
 import Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))
 import Data.Function (const)
-import Control.Category (id)
+import Control.Category (identity)
 
 -- | The `Apply` class provides the `(<*>)` which is used to apply a function
 -- | to an argument under a type constructor.
@@ -53,7 +53,7 @@ infixl 4 applyFirst as <*
 
 -- | Combine two effectful actions, keeping only the result of the second.
 applySecond :: forall a b f. Apply f => f a -> f b -> f b
-applySecond a b = const id <$> a <*> b
+applySecond a b = const identity <$> a <*> b
 
 infixl 4 applySecond as *>
 

src/Control/Bind.purs

@@ -13,7 +13,7 @@ module Control.Bind
 
 import Control.Applicative (class Applicative, liftA1, pure, unless, when)
 import Control.Apply (class Apply, apply, (*>), (<*), (<*>))
-import Control.Category (id)
+import Control.Category (identity)
 
 import Data.Function (flip)
 import Data.Functor (class Functor, map, void, ($>), (<#>), (<$), (<$>))
@@ -81,7 +81,7 @@ instance discardUnit :: Discard Unit where
 
 -- | Collapse two applications of a monadic type constructor into one.
 join :: forall a m. Bind m => m (m a) -> m a
-join m = m >>= id
+join m = m >>= identity
 
 -- | Forwards Kleisli composition.
 -- |

src/Control/Category.purs

@@ -1,5 +1,5 @@
 module Control.Category
-  ( class Category, id
+  ( class Category, identity
   , module Control.Semigroupoid
   ) where
 
@@ -12,9 +12,9 @@ import Control.Semigroupoid (class Semigroupoid, compose, (<<<), (>>>))
 -- | Instances must satisfy the following law in addition to the
 -- | `Semigroupoid` law:
 -- |
--- | - Identity: `id <<< p = p <<< id = p`
+-- | - Identity: `identity <<< p = p <<< identity = p`
 class Semigroupoid a <= Category a where
-  id :: forall t. a t t
+  identity :: forall t. a t t
 
 instance categoryFn :: Category (->) where
-  id x = x
+  identity x = x

src/Control/Semigroupoid.purs

@@ -1,7 +1,7 @@
 module Control.Semigroupoid where
 
 -- | A `Semigroupoid` is similar to a [`Category`](#category) but does not
--- | require an identity element `id`, just composable morphisms.
+-- | require an identity element `identity`, just composable morphisms.
 -- |
 -- | `Semigroupoid`s must satisfy the following law:
 -- |

src/Data/Function.purs

@@ -8,7 +8,7 @@ module Data.Function
   , module Control.Category
   ) where
 
-import Control.Category (id, compose, (<<<), (>>>))
+import Control.Category (identity, compose, (<<<), (>>>))
 import Data.Boolean (otherwise)
 import Data.Ord ((<=))
 import Data.Ring ((-))

src/Data/Functor.purs

@@ -19,7 +19,7 @@ import Data.Unit (Unit, unit)
 -- |
 -- | Instances must satisfy the following laws:
 -- |
--- | - Identity: `map id = id`
+-- | - Identity: `map identity = identity`
 -- | - Composition: `map (f <<< g) = map f <<< map g`
 class Functor f where
   map :: forall a b. (a -> b) -> f a -> f b

src/Data/Monoid/Endo.purs

@@ -9,7 +9,7 @@ import Prelude
 -- |
 -- | ``` purescript
 -- | Endo f <> Endo g == Endo (f <<< g)
--- | mempty :: Endo _ == Endo id
+-- | mempty :: Endo _ == Endo identity
 -- | ```
 newtype Endo c a = Endo (c a a)
 
@@ -26,4 +26,4 @@ instance semigroupEndo :: Semigroupoid c => Semigroup (Endo c a) where
   append (Endo a) (Endo b) = Endo (a <<< b)
 
 instance monoidEndo :: Category c => Monoid (Endo c a) where
-  mempty = Endo id
+  mempty = Endo identity

src/Prelude.purs

@@ -31,7 +31,7 @@ module Prelude
 import Control.Applicative (class Applicative, pure, liftA1, unless, when)
 import Control.Apply (class Apply, apply, (*>), (<*), (<*>))
 import Control.Bind (class Bind, bind, class Discard, discard, ifM, join, (<=<), (=<<), (>=>), (>>=))
-import Control.Category (class Category, id)
+import Control.Category (class Category, identity)
 import Control.Monad (class Monad, ap, liftM1, unlessM, whenM)
 import Control.Semigroupoid (class Semigroupoid, compose, (<<<), (>>>))