Bump deps for compiler/0.12

Author: LiamGoodacre

bower.json

@@ -17,7 +17,7 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-control": "^3.0.0",
-    "purescript-newtype": "^2.0.0"
+    "purescript-control": "purescript/purescript-control#compiler/0.12",
+    "purescript-newtype": "purescript/purescript-newtype#compiler/0.12"
   }
 }

package.json

@@ -5,8 +5,8 @@
     "build": "pulp build -- --censor-lib --strict"
   },
   "devDependencies": {
-    "pulp": "^10.0.4",
-    "purescript-psa": "^0.5.0-rc.1",
-    "rimraf": "^2.6.1"
+    "pulp": "^12.0.1",
+    "purescript-psa": "^0.6.0",
+    "rimraf": "^2.6.2"
   }
 }

src/Control/Biapply.purs

@@ -1,6 +1,6 @@
 module Control.Biapply where
 
-import Data.Function (const, id)
+import Data.Function (const, identity)
 
 import Data.Bifunctor (class Bifunctor, bimap)
 
@@ -10,7 +10,7 @@ import Data.Bifunctor (class Bifunctor, bimap)
 -- | ```purescript
 -- | bipure f g <<$>> x <<*>> y
 -- | ```
-infixl 4 id as <<$>>
+infixl 4 identity as <<$>>
 
 -- | `Biapply` captures type constructors of two arguments which support lifting of
 -- | functions of one or more arguments, in the sense of `Apply`.
@@ -21,7 +21,7 @@ infixl 4 biapply as <<*>>
 
 -- | Keep the results of the second computation.
 biapplyFirst :: forall w a b c d. Biapply w => w a b -> w c d -> w c d
-biapplyFirst a b = bimap (const id) (const id) <<$>> a <<*>> b
+biapplyFirst a b = bimap (const identity) (const identity) <<$>> a <<*>> b
 
 infixl 4 biapplyFirst as *>>
 

src/Data/Bifunctor.purs

@@ -1,6 +1,6 @@
 module Data.Bifunctor where
 
-import Control.Category (id)
+import Control.Category (identity)
 
 -- | A `Bifunctor` is a `Functor` from the pair category `(Type, Type)` to `Type`.
 -- |
@@ -12,16 +12,16 @@ import Control.Category (id)
 -- |
 -- | Laws:
 -- |
--- | - Identity: `bimap id id == id`
+-- | - Identity: `bimap identity identity == identity`
 -- | - Composition: `bimap f1 g1 <<< bimap f2 g2 == bimap (f1 <<< f2) (g1 <<< g2)`
 -- |
 class Bifunctor f where
   bimap :: forall a b c d. (a -> b) -> (c -> d) -> f a c -> f b d
 
 -- | Map a function over the first type argument of a `Bifunctor`.
 lmap :: forall f a b c. Bifunctor f => (a -> b) -> f a c -> f b c
-lmap f = bimap f id
+lmap f = bimap f identity
 
 -- | Map a function over the second type arguments of a `Bifunctor`.
 rmap :: forall f a b c. Bifunctor f => (b -> c) -> f a b -> f a c
-rmap = bimap id
+rmap = bimap identity