packages feed

lattices 2.2.1 → 2.2.1.1

raw patch · 1 files changed

+17/−15 lines, 1 filesdep ~QuickCheckdep ~basedep ~containersPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: QuickCheck, base, containers, quickcheck-instances, transformers

API changes (from Hackage documentation)

- Algebra.Heyting: instance Algebra.Heyting.Heyting a => Algebra.Heyting.Heyting (Solo a)
- Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice a => Algebra.Lattice.BoundedJoinSemiLattice (Solo a)
- Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice a => Algebra.Lattice.BoundedMeetSemiLattice (Solo a)
- Algebra.Lattice: instance Algebra.Lattice.Lattice a => Algebra.Lattice.Lattice (Solo a)
+ Algebra.Heyting: instance Algebra.Heyting.Heyting a => Algebra.Heyting.Heyting (GHC.Tuple.Prim.Solo a)
+ Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice a => Algebra.Lattice.BoundedJoinSemiLattice (GHC.Tuple.Prim.Solo a)
+ Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice a => Algebra.Lattice.BoundedMeetSemiLattice (GHC.Tuple.Prim.Solo a)
+ Algebra.Lattice: instance Algebra.Lattice.Lattice a => Algebra.Lattice.Lattice (GHC.Tuple.Prim.Solo a)
- Algebra.Heyting.Free.Expr: proofSearch :: forall a. Ord a => Expr a -> Bool
+ Algebra.Heyting.Free.Expr: proofSearch :: Ord a => Expr a -> Bool

Files

lattices.cabal view
@@ -1,6 +1,6 @@ cabal-version:      1.18 name:               lattices-version:            2.2.1+version:            2.2.1.1 category:           Math license:            BSD3 license-file:       LICENSE@@ -27,24 +27,27 @@    || ==8.10.4    || ==9.0.2    || ==9.2.8-   || ==9.4.7-   || ==9.6.3-   || ==9.8.1+   || ==9.4.8+   || ==9.6.7+   || ==9.8.4+   || ==9.10.2+   || ==9.12.4+   || ==9.14.1  synopsis:   Fine-grained library for constructing and manipulating lattices  description:   In mathematics, a lattice is a partially ordered set in which every two-  elements @x@ and @y@ have a unique supremum (also called a least upper bound, join, or @x /\\ y@)-  and a unique infimum (also called a greatest lower bound, meet, or @x \\/ y@).+  elements @x@ and @y@ have a unique supremum (also called a least upper bound, join, or @x \\/ y@)+  and a unique infimum (also called a greatest lower bound, meet, or @x /\\ y@).   .   This package provide type-classes for different lattice types, as well   as a class for the partial order.  source-repository head   type:     git-  location: git://github.com/phadej/lattices.git+  location: https://github.com/phadej/lattices.git  library   default-language: Haskell2010@@ -78,12 +81,12 @@     Algebra.PartialOrd.Instances    build-depends:-      base                        >=4.12     && <4.21-    , containers                  >=0.5.0.0  && <0.8+      base                        >=4.12     && <4.23+    , containers                  >=0.5.0.0  && <0.9     , deepseq                     >=1.3.0.0  && <1.6-    , hashable                    >=1.2.7.0  && <1.5+    , hashable                    >=1.2.7.0  && <1.6     , integer-logarithms          >=1.0.3    && <1.1-    , QuickCheck                  >=2.12.6.1 && <2.16+    , QuickCheck                  >=2.12.6.1 && <2.19     , tagged                      >=0.8.6    && <0.9     , transformers                >=0.3.0.0  && <0.7     , universe-base               >=1.1      && <1.2@@ -99,7 +102,7 @@     else       build-depends: OneTuple >=0.4 && <0.5 -test-suite test+test-suite test-lattices   type:             exitcode-stdio-1.0   main-is:          Tests.hs   hs-source-dirs:   test@@ -110,10 +113,9 @@     , containers     , lattices     , QuickCheck-    , quickcheck-instances        >=0.3.19 && <0.4+    , quickcheck-instances        >=0.3.19 && <0.5     , tasty                       >=1.2.1  && <1.6-    , tasty-quickcheck            >=0.10   && <0.11-    , transformers+    , tasty-quickcheck            >=0.10   && <0.12     , universe-base     , universe-reverse-instances     , unordered-containers