Cabal revisions of lattices-1.7.1
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
name: lattices version: 1.7.1+x-revision: 1 cabal-version: >= 1.10 category: Math license: BSD3 copyright: (C) 2010-2015 Maximilian Bolingbroke build-type: Simple extra-source-files: README.md CHANGELOG.md-tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.1+tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.2, GHC==8.4.1 synopsis: Fine-grained library for constructing and manipulating lattices description: In mathematics, a lattice is a partially ordered set in which every two Algebra.PartialOrd, Algebra.PartialOrd.Instances - build-depends: base >= 4.5 && < 4.11,+ build-depends: base >= 4.5 && < 4.12, base-compat >= 0.9.3 && < 0.10, containers >= 0.4.2.1 && < 0.6, deepseq >= 1.3.0.0 && < 1.5, default-language: Haskell2010 build-depends: base, base-compat >= 0.9.3 && <0.10,- tasty >= 0.10 && < 0.12,- tasty-quickcheck >= 0.8 && < 0.10,- QuickCheck >= 2.10 && <2.11,+ tasty >= 0.10 && < 1.1,+ tasty-quickcheck >= 0.8 && < 0.11,+ QuickCheck >= 2.10 && <2.12, quickcheck-instances >=0.3.16 && <0.4, universe-instances-base >= 1.0 && <1.1, lattices,
revision 2
name: lattices version: 1.7.1-x-revision: 1+x-revision: 2 cabal-version: >= 1.10 category: Math license: BSD3 Algebra.PartialOrd.Instances build-depends: base >= 4.5 && < 4.12,- base-compat >= 0.9.3 && < 0.10,+ base-compat >= 0.9.3 && < 0.11, containers >= 0.4.2.1 && < 0.6, deepseq >= 1.3.0.0 && < 1.5, hashable >= 1.2.6.1 && < 1.3, ghc-options: -Wall default-language: Haskell2010 build-depends: base,- base-compat >= 0.9.3 && <0.10,+ base-compat, tasty >= 0.10 && < 1.1, tasty-quickcheck >= 0.8 && < 0.11, QuickCheck >= 2.10 && <2.12,