Merge pull request #29 from purescript/compiler/0.12

Updates for 0.12

Author: garyb

.gitignore

@@ -4,3 +4,4 @@
 /bower_components/
 /node_modules/
 /output/
+package-lock.json

LICENSE

@@ -1,20 +1,26 @@
-The MIT License (MIT)
+Copyright 2018 PureScript
 
-Copyright (c) 2014 PureScript
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
 
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software is furnished to do so,
-subject to the following conditions:
+1. Redistributions of source code must retain the above copyright notice, this
+list of conditions and the following disclaimer.
 
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
+2. Redistributions in binary form must reproduce the above copyright notice,
+this list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
-COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
-IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+3. Neither the name of the copyright holder nor the names of its contributors
+may be used to endorse or promote products derived from this software without
+specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

bower.json

@@ -1,8 +1,7 @@
 {
   "name": "purescript-tuples",
   "homepage": "https://github.com/purescript/purescript-tuples",
-  "description": "Tuple data type and utility functions",
-  "license": "MIT",
+  "license": "BSD-3-Clause",
   "repository": {
     "type": "git",
     "url": "git://github.com/purescript/purescript-tuples.git"
@@ -17,9 +16,14 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-foldable-traversable": "^3.0.0",
-    "purescript-prelude": "^3.0.0",
-    "purescript-distributive": "^3.0.0",
-    "purescript-type-equality": "^2.1.0"
+    "purescript-bifunctors": "^4.0.0",
+    "purescript-control": "^4.0.0",
+    "purescript-distributive": "^4.0.0",
+    "purescript-foldable-traversable": "^4.0.0",
+    "purescript-invariant": "^4.0.0",
+    "purescript-maybe": "^4.0.0",
+    "purescript-newtype": "^3.0.0",
+    "purescript-prelude": "^4.0.0",
+    "purescript-type-equality": "^3.0.0"
   }
 }

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.2.0",
+    "purescript-psa": "^0.6.0",
+    "rimraf": "^2.6.2"
   }
 }

src/Data/Tuple.purs

@@ -8,7 +8,6 @@ import Control.Biapply (class Biapply)
 import Control.Comonad (class Comonad)
 import Control.Extend (class Extend)
 import Control.Lazy (class Lazy, defer)
-
 import Data.Bifoldable (class Bifoldable)
 import Data.Bifunctor (class Bifunctor)
 import Data.Bitraversable (class Bitraversable)
@@ -19,11 +18,9 @@ import Data.Functor.Invariant (class Invariant, imapF)
 import Data.HeytingAlgebra (implies, ff, tt)
 import Data.Maybe (Maybe(..))
 import Data.Maybe.First (First(..))
-import Data.Monoid (class Monoid, mempty)
 import Data.Newtype (unwrap)
 import Data.Ord (class Ord1)
 import Data.Traversable (class Traversable)
-
 import Type.Equality (class TypeEquals, from)
 
 -- | A simple product type for wrapping a pair of component values.
@@ -38,15 +35,15 @@ instance showTuple :: (Show a, Show b) => Show (Tuple a b) where
 -- | there are `Eq` instances for both component types.
 derive instance eqTuple :: (Eq a, Eq b) => Eq (Tuple a b)
 
-instance eq1Tuple :: Eq a => Eq1 (Tuple a) where eq1 = eq
+derive instance eq1Tuple :: Eq a => Eq1 (Tuple a)
 
 -- | Allows `Tuple`s to be compared with `compare`, `>`, `>=`, `<` and `<=`
 -- | whenever there are `Ord` instances for both component types. To obtain
 -- | the result, the `fst`s are `compare`d, and if they are `EQ`ual, the
 -- | `snd`s are `compare`d.
 derive instance ordTuple :: (Ord a, Ord b) => Ord (Tuple a b)
 
-instance ord1Tuple :: Ord a => Ord1 (Tuple a) where compare1 = compare
+derive instance ord1Tuple :: Ord a => Ord1 (Tuple a)
 
 instance boundedTuple :: (Bounded a, Bounded b) => Bounded (Tuple a b) where
   top = Tuple top top
@@ -94,8 +91,7 @@ instance booleanAlgebraTuple :: (BooleanAlgebra a, BooleanAlgebra b) => BooleanA
 -- | ```purescript
 -- | f <$> (Tuple x y) = Tuple x (f y)
 -- | ````
-instance functorTuple :: Functor (Tuple a) where
-  map f (Tuple x y) = Tuple x (f y)
+derive instance functorTuple :: Functor (Tuple a)
 
 instance invariantTuple :: Invariant (Tuple a) where
   imap = imapF