Compiler/0.12 (#17)

Updates for 0.12 (#15) and (#16)

bower.json

@@ -10,15 +10,14 @@
     "url": "git://github.com/ethul/purescript-freeap.git"
   },
   "dependencies": {
-    "purescript-exists": "^3.0.0",
-    "purescript-const": "^3.0.0"
+    "purescript-exists": "^4.0.0",
+    "purescript-const": "^4.0.0"
   },
   "devDependencies": {
-    "purescript-either": "^3.0.0",
-    "purescript-integers": "^3.0.0",
-    "purescript-generics": "^4.0.0",
-    "purescript-console": "^3.0.0",
-    "purescript-exceptions": "^3.0.0",
-    "purescript-quickcheck-laws": "^3.0.1"
+    "purescript-either": "^4.0.0",
+    "purescript-integers": "^4.0.0",
+    "purescript-console": "^4.1.0",
+    "purescript-exceptions": "^4.0.0",
+    "purescript-quickcheck-laws": "paulyoung/purescript-quickcheck-laws#compiler/0.12"
   }
 }

package.json

@@ -6,8 +6,8 @@
     "build": "pulp build -- --censor-lib --strict"
   },
   "devDependencies": {
-    "pulp": "^11.0.0",
-    "purescript-psa": "^0.5.1",
-    "rimraf": "^2.6.1"
+    "pulp": "^12.2.0",
+    "purescript-psa": "^0.6.0",
+    "rimraf": "^2.6.2"
   }
 }

src/Control/Applicative/Free.purs

@@ -8,11 +8,11 @@ module Control.Applicative.Free
   ) where
 
 import Prelude
+
 import Data.Const (Const(..))
 import Data.Either (Either(..))
 import Data.List (List(..))
 import Data.List.NonEmpty as NEL
-import Data.Monoid (class Monoid)
 import Data.Newtype (unwrap)
 import Data.NonEmpty ((:|))
 import Data.Tuple (Tuple(..))
@@ -110,7 +110,7 @@ goLeft fStack valStack nat func count = case func of
 -- | Run a free applicative functor using the applicative instance for
 -- | the type constructor `f`.
 retractFreeAp :: forall f a. Applicative f => FreeAp f a -> f a
-retractFreeAp = foldFreeAp id
+retractFreeAp = foldFreeAp identity
 
 -- | Natural transformation from `FreeAp f a` to `FreeAp g a` given a
 -- | natural transformation from `f` to `g`.

test/Test/Control/Applicative/Free.purs

@@ -10,9 +10,10 @@ import Control.Applicative.Free (FreeAp, liftFreeAp, analyzeFreeAp, retractFreeA
 import Control.Applicative.Free.Gen as GenF
 import Data.Either (Either(..))
 import Data.Tuple (Tuple)
+import Effect (Effect)
 import Test.QuickCheck (class Arbitrary, class Coarbitrary, arbitrary)
 import Test.QuickCheck.Gen (Gen)
-import Test.QuickCheck.Laws (QC, A, checkLaws)
+import Test.QuickCheck.Laws (A, checkLaws)
 import Test.QuickCheck.Laws.Control as Control
 import Test.QuickCheck.Laws.Data as Data
 import Type.Proxy (Proxy(..), Proxy2(..))
@@ -42,7 +43,7 @@ buildExpected 0 _ acc = acc
 buildExpected n x acc = buildExpected (n - 1) x (acc <> x)
 
 checkAnalyze :: Either String String
-checkAnalyze = 
+checkAnalyze =
   if result == expected
     then Right result
     else Left (result <> " is not " <> expected)
@@ -55,7 +56,7 @@ checkAnalyze =
 
 
 checkStack :: Either String String
-checkStack = 
+checkStack =
   if result == expected
     then Right "safe for 100000 node"
     else Left (result <> " is not " <> expected)
@@ -70,7 +71,7 @@ checkStack =
 newtype ArbFreeAp a = ArbFreeAp (FreeAp (Tuple (Array String)) a)
 
 instance arbitraryArbFreeAp :: (Coarbitrary a, Arbitrary a) => Arbitrary (ArbFreeAp a) where
-  arbitrary = ArbFreeAp <$> 
+  arbitrary = ArbFreeAp <$>
     GenF.genFree
       arbitrary
       (arbitrary :: Gen a)
@@ -83,7 +84,7 @@ derive newtype instance functorArbFreeAp :: Functor ArbFreeAp
 derive newtype instance applyArbFreeAp :: Apply ArbFreeAp
 derive newtype instance applicativeArbFreeAp :: Applicative ArbFreeAp
 
-check ∷ ∀ eff. QC eff Unit
+check ∷ Effect Unit
 check = checkLaws "FreeAp" do
   Data.checkEq prxFree
   Data.checkFunctor prx2Free

test/Test/Control/Applicative/Free/Validation.purs

@@ -6,7 +6,7 @@ module Test.Control.Applicative.Free.Validation
 import Prelude (class Show, show, (<<<), (==), (<$>), (<*>), (<>))
 
 import Control.Applicative.Free (FreeAp, foldFreeAp, liftFreeAp)
-import Control.Monad.Eff.Exception.Unsafe (unsafeThrow)
+import Effect.Exception.Unsafe (unsafeThrow)
 
 import Data.Either (Either(..))
 import Data.Int (fromString)

test/Test/Main.purs

@@ -1,14 +1,12 @@
 module Test.Main where
 
 import Prelude
-import Control.Monad.Eff (Eff)
-import Control.Monad.Eff.Console (CONSOLE, log, logShow)
-import Control.Monad.Eff.Exception (EXCEPTION)
-import Control.Monad.Eff.Random (RANDOM)
+import Effect (Effect)
+import Effect.Console (log, logShow)
 import Test.Control.Applicative.Free as FreeTest
 import Test.Control.Applicative.Free.Validation as Validation
 
-main :: Eff (console ∷ CONSOLE , random ∷ RANDOM , exception ∷ EXCEPTION) Unit
+main :: Effect Unit
 main = do
   log "\nvalid case:"
   logShow (Validation.runForm "Joe" "Smith" "28")