Update for changes in prelude

Author: garyb

.travis.yml

@@ -1,7 +1,7 @@
 language: node_js
-sudo: required
 dist: trusty
-node_js: 5
+sudo: required
+node_js: 6
 env:
   - PATH=$HOME/purescript:$PATH
 install:
@@ -13,12 +13,9 @@ install:
   - npm install
   - bower install
 script:
-  - npm run build
+  - npm run -s build
 after_success:
 - >-
   test $TRAVIS_TAG &&
-  psc-publish > .pursuit.json &&
-  curl -X POST http://pursuit.purescript.org/packages \
-    -d @.pursuit.json \
-    -H 'Accept: application/json' \
-    -H "Authorization: token ${GITHUB_TOKEN}"
+  echo $GITHUB_TOKEN | pulp login &&
+  echo y | pulp publish --no-push

bower.json

@@ -22,7 +22,7 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-contravariant": "^1.0.0-rc.1",
-    "purescript-foldable-traversable": "^1.0.0-rc.1"
+    "purescript-contravariant": "^1.0.0-rc.2",
+    "purescript-foldable-traversable": "^1.0.0-rc.2"
   }
 }

package.json

@@ -2,10 +2,11 @@
   "private": true,
   "scripts": {
     "clean": "rimraf output && rimraf .pulp-cache",
-    "build": "pulp build"
+    "build": "pulp build --censor-lib --strict"
   },
   "devDependencies": {
-    "pulp": "^8.1.0",
+    "pulp": "^8.2.0",
+    "purescript-psa": "^0.3.8",
     "rimraf": "^2.5.0"
   }
 }

src/Data/Const.purs

@@ -5,18 +5,18 @@ import Control.Apply (class Apply)
 import Control.Bind (class Bind)
 import Control.Semigroupoid (class Semigroupoid)
 
-import Data.BooleanAlgebra (class BooleanAlgebra, not, (||), (&&))
+import Data.BooleanAlgebra (class BooleanAlgebra)
 import Data.Bounded (class Bounded, bottom, top)
-import Data.BoundedOrd (class BoundedOrd)
-import Data.DivisionRing (class DivisionRing)
+import Data.CommutativeRing (class CommutativeRing)
 import Data.Eq (class Eq, (==))
+import Data.EuclideanRing (class EuclideanRing, mod, degree, (/))
+import Data.Field (class Field)
 import Data.Foldable (class Foldable)
 import Data.Functor (class Functor)
 import Data.Functor.Contravariant (class Contravariant)
 import Data.Functor.Invariant (class Invariant, imapF)
-import Data.ModuloSemiring (class ModuloSemiring, mod, (/))
+import Data.HeytingAlgebra (class HeytingAlgebra, not, implies, tt, ff, (&&), (||))
 import Data.Monoid (class Monoid, mempty)
-import Data.Num (class Num)
 import Data.Ord (class Ord, compare)
 import Data.Ring (class Ring, (-))
 import Data.Semigroup (class Semigroup, (<>))
@@ -47,8 +47,6 @@ instance boundedConst :: Bounded a => Bounded (Const a b) where
   top = Const top
   bottom = Const bottom
 
-instance boundedOrdConst :: BoundedOrd a => BoundedOrd (Const a b)
-
 instance showConst :: Show a => Show (Const a b) where
   show (Const x) = "(Const " <> show x <> ")"
 
@@ -70,19 +68,25 @@ instance semiringConst :: Semiring a => Semiring (Const a b) where
 instance ringConst :: Ring a => Ring (Const a b) where
   sub (Const x) (Const y) = Const (x - y)
 
-instance moduloSemiringConst :: ModuloSemiring a => ModuloSemiring (Const a b) where
+instance euclideanRingConst :: EuclideanRing a => EuclideanRing (Const a b) where
+  degree (Const x) = degree x
   div (Const x) (Const y) = Const (x / y)
   mod (Const x) (Const y) = Const (x `mod` y)
 
-instance divisionRingConst :: DivisionRing a => DivisionRing (Const a b)
+instance commutativeRingConst :: CommutativeRing a => CommutativeRing (Const a b)
 
-instance numConst :: Num a => Num (Const a b)
+instance fieldConst :: Field a => Field (Const a b)
 
-instance booleanAlgebraConst :: BooleanAlgebra a => BooleanAlgebra (Const a b) where
+instance heytingAlgebraConst :: HeytingAlgebra a => HeytingAlgebra (Const a b) where
+  ff = Const ff
+  tt = Const tt
+  implies (Const x) (Const y) = Const (x `implies` y)
   conj (Const x) (Const y) = Const (x && y)
   disj (Const x) (Const y) = Const (x || y)
   not (Const x) = Const (not x)
 
+instance booleanAlgebraConst :: BooleanAlgebra a => BooleanAlgebra (Const a b)
+
 instance functorConst :: Functor (Const a) where
   map _ (Const x) = Const x