Cabal revisions of lattices-2.2.1
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
cabal-version: 1.18 name: lattices version: 2.2.1+x-revision: 1 category: Math license: BSD3 license-file: LICENSE || ==8.10.4 || ==9.0.2 || ==9.2.8- || ==9.4.7- || ==9.6.3- || ==9.8.1+ || ==9.4.8+ || ==9.6.5+ || ==9.8.2+ || ==9.10.1 synopsis: Fine-grained library for constructing and manipulating lattices base >=4.12 && <4.21 , containers >=0.5.0.0 && <0.8 , 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 , tagged >=0.8.6 && <0.9
revision 2
cabal-version: 1.18 name: lattices version: 2.2.1-x-revision: 1+x-revision: 2 category: Math license: BSD3 license-file: LICENSE || ==9.0.2 || ==9.2.8 || ==9.4.8- || ==9.6.5- || ==9.8.2+ || ==9.6.6+ || ==9.8.4 || ==9.10.1+ || ==9.12.1 synopsis: Fine-grained library for constructing and manipulating lattices source-repository head type: git- location: git://github.com/phadej/lattices.git+ location: https://github.com/phadej/lattices.git library default-language: Haskell2010 Algebra.PartialOrd.Instances build-depends:- base >=4.12 && <4.21+ base >=4.12 && <4.22 , containers >=0.5.0.0 && <0.8 , deepseq >=1.3.0.0 && <1.6 , hashable >=1.2.7.0 && <1.6
revision 3
cabal-version: 1.18 name: lattices version: 2.2.1-x-revision: 2+x-revision: 3 category: Math license: BSD3 license-file: LICENSE || ==9.0.2 || ==9.2.8 || ==9.4.8- || ==9.6.6+ || ==9.6.7 || ==9.8.4- || ==9.10.1- || ==9.12.1+ || ==9.10.2+ || ==9.12.2 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. , deepseq >=1.3.0.0 && <1.6 , 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.17 , tagged >=0.8.6 && <0.9 , transformers >=0.3.0.0 && <0.7 , universe-base >=1.1 && <1.2 , QuickCheck , quickcheck-instances >=0.3.19 && <0.4 , tasty >=1.2.1 && <1.6- , tasty-quickcheck >=0.10 && <0.11+ , tasty-quickcheck >=0.10 && <0.12 , transformers , universe-base , universe-reverse-instances