Merge pull request #27 from garyb/ps-0.11

Update for PureScript 0.11

Author: garyb

.travis.yml

@@ -1,7 +1,7 @@
 language: node_js
 dist: trusty
 sudo: required
-node_js: 6
+node_js: stable
 install:
   - npm install -g bower
   - npm install

bower.json

@@ -20,8 +20,8 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-proxy": "^1.0.0",
-    "purescript-enums": "^2.0.1", 
-    "purescript-quickcheck": "^3.0.0"
+    "purescript-proxy": "^2.0.0",
+    "purescript-enums": "^3.0.0", 
+    "purescript-quickcheck": "^4.0.0"
   }
 }

package.json

@@ -2,13 +2,13 @@
   "private": true,
   "scripts": {
     "clean": "rimraf output && rimraf .pulp-cache",
-    "build": "pulp build --censor-lib --strict",
+    "build": "pulp build -- --censor-lib --strict",
     "test": "pulp test"
   },
   "devDependencies": {
-    "pulp": "^9.0.1",
-    "purescript-psa": "^0.3.9",
-    "purescript": "^0.10.1",
-    "rimraf": "^2.5.4"
+    "pulp": "^11.0.0",
+    "purescript-psa": "^0.5.0",
+    "purescript": "^0.11.1",
+    "rimraf": "^2.6.1"
   }
 }

src/Test/QuickCheck/Laws/Control/Alt.purs

@@ -15,7 +15,10 @@ import Test.QuickCheck.Laws (A, B)
 -- | - Distributivity: `f <$> (x <|> y) == (f <$> x) <|> (f <$> y)`
 checkAlt
   ∷ ∀ eff f
-  . (Alt f, Arbitrary (f A), Eq (f A), Eq (f B))
+  . Alt f
+  ⇒ Arbitrary (f A)
+  ⇒ Eq (f A)
+  ⇒ Eq (f B)
   ⇒ Proxy2 f
   → QC eff Unit
 checkAlt _ = do

src/Test/QuickCheck/Laws/Control/Alternative.purs

@@ -17,7 +17,11 @@ import Test.QuickCheck.Laws (A, B)
 -- | - Annihilation: `empty <*> x = empty`
 checkAlternative
   ∷ ∀ eff f
-  . (Alternative f, Arbitrary (f (A → B)), Arbitrary (f A), Eq (f A), Eq (f B))
+  . Alternative f
+  ⇒ Arbitrary (f (A → B))
+  ⇒ Arbitrary (f A)
+  ⇒ Eq (f A)
+  ⇒ Eq (f B)
   ⇒ Proxy2 f
   → QC eff Unit
 checkAlternative _ = do

src/Test/QuickCheck/Laws/Control/Applicative.purs

@@ -16,7 +16,13 @@ import Test.QuickCheck.Laws (A, B, C)
 -- | - Interchange: `u <*> (pure y) = (pure ($ y)) <*> u`
 checkApplicative
   ∷ ∀ eff f
-  . (Applicative f, Arbitrary (f A), Arbitrary (f (A → B)), Arbitrary (f (B → C)), Eq (f A), Eq (f B), Eq (f C))
+  . Applicative f
+  ⇒ Arbitrary (f A)
+  ⇒ Arbitrary (f (A → B))
+  ⇒ Arbitrary (f (B → C))
+  ⇒ Eq (f A)
+  ⇒ Eq (f B)
+  ⇒ Eq (f C)
   ⇒ Proxy2 f
   → QC eff Unit
 checkApplicative _ = do

src/Test/QuickCheck/Laws/Control/Apply.purs

@@ -13,7 +13,11 @@ import Test.QuickCheck.Laws (A, B, C)
 -- | - Associative composition: `(<<<) <$> f <*> g <*> h = f <*> (g <*> h)`
 checkApply
   ∷ ∀ eff f
-  . (Apply f, Arbitrary (f A), Arbitrary (f (A → B)), Arbitrary (f (B → C)), Eq (f C))
+  . Apply f
+  ⇒ Arbitrary (f A)
+  ⇒ Arbitrary (f (A → B))
+  ⇒ Arbitrary (f (B → C))
+  ⇒ Eq (f C)
   ⇒ Proxy2 f
   → QC eff Unit
 checkApply _ = do

src/Test/QuickCheck/Laws/Control/Bind.purs

@@ -13,7 +13,9 @@ import Test.QuickCheck.Laws (A)
 -- | - Associativity: `(x >>= f) >>= g = x >>= (\k → f k >>= g)`
 checkBind
   ∷ ∀ eff m
-  . (Bind m, Arbitrary (m A), Eq (m A))
+  . Bind m
+  ⇒ Arbitrary (m A)
+  ⇒ Eq (m A)
   ⇒ Proxy2 m
   → QC eff Unit
 checkBind _ = do

src/Test/QuickCheck/Laws/Control/Category.purs

@@ -13,7 +13,9 @@ import Test.QuickCheck.Laws (B, C)
 -- | - Identity: `id <<< p = p <<< id = p`
 checkCategory
   ∷ ∀ eff a
-  . (Category a, Arbitrary (a B C), Eq (a B C))
+  . Category a
+  ⇒ Arbitrary (a B C)
+  ⇒ Eq (a B C)
   ⇒ Proxy3 a
   → QC eff Unit
 checkCategory _ = do

src/Test/QuickCheck/Laws/Control/Comonad.purs

@@ -16,7 +16,10 @@ import Test.QuickCheck.Laws (A, B)
 -- | - Right Identity: `extract (f <<= x) = f x`
 checkComonad
   ∷ ∀ eff w
-  . (Comonad w, Arbitrary (w A), Coarbitrary (w A), Eq (w A))
+  . Comonad w
+  ⇒ Arbitrary (w A)
+  ⇒ Coarbitrary (w A)
+  ⇒ Eq (w A)
   ⇒ Proxy2 w
   → QC eff Unit
 checkComonad _ = do