diff --git a/partialord.cabal b/partialord.cabal
--- a/partialord.cabal
+++ b/partialord.cabal
@@ -5,7 +5,7 @@
 -- see: https://github.com/sol/hpack
 
 name:           partialord
-version:        0.1.0
+version:        0.1.1
 synopsis:       Data structure supporting partial orders
 description:    Please see README.md
 category:       Data structures
@@ -13,7 +13,7 @@
 bug-reports:    https://github.com/jcranch/partialord/issues
 author:         James Cranch
 maintainer:     j.d.cranch@sheffield.ac.uk
-copyright:      2023 James Cranch
+copyright:      2023-25 James Cranch
 license:        BSD-3-Clause
 license-file:   LICENSE
 build-type:     Simple
diff --git a/test/Data/PartialOrdSpec.hs b/test/Data/PartialOrdSpec.hs
--- a/test/Data/PartialOrdSpec.hs
+++ b/test/Data/PartialOrdSpec.hs
@@ -1,7 +1,8 @@
 module Data.PartialOrdSpec (spec) where
 
-import Test.Hspec
-import Data.PartialOrd
+import           Data.PartialOrd
+import qualified Data.Set as S
+import           Test.Hspec
 
 
 spec :: Spec
@@ -11,9 +12,9 @@
 
     it "should compute maxima" $ do
       maxima [(i,j) | i <- [1..10], j <- [1..10], i+j <= 10] `shouldBe`
-        [(i :: Int,10-i) | i <- [1..9]]
+        S.fromList [(i :: Int,10-i) | i <- [1..9]]
 
     it "should compute minima" $ do
       minima [(i,j) | i <- [1..10], j <- [1..10], i+j >= 10] `shouldBe`
-        [(i :: Int,10-i) | i <- [1..9]]
+        S.fromList [(i :: Int,10-i) | i <- [1..9]]