lattices

Fine-grained library for constructing and manipulating lattices

http://github.com/phadej/lattices/

Version on this page:1.7
LTS Haskell 22.13:2.2@rev:1
Stackage Nightly 2024-03-14:2.2@rev:1
Latest on Hackage:2.2@rev:1

See all snapshots lattices appears in

BSD-3-Clause licensed by Maximilian Bolingbroke
Maintained by Oleg Grenrus
This version can be pinned in stack with:lattices-1.7@sha256:4a60396fed0770a1d425dff099a199f9722c51666ad29111a3eedb4fe0f49557,3491

lattices

Build Status Hackage Stackage LTS 2 Stackage LTS 3 Stackage Nightly

Fine-grained library for constructing and manipulating lattices

Changes

1.7 (2017-10-01)

  • HashMap instances changed
  • PartialOrd Meet and Join
  • PartialOrd () and Void
  • BoundedLattice (HashSet a)
  • PartialOrd [a] (leq = isInfixOf)

1.6.0 (2017-06-26)

  • Correct PartialOrd Map and IntMap instances
  • Add Lattice instance for containers types.
  • Change meets1 and joins1 to use Foldable1
  • Add comparable to PartialOrd
  • Add Algebra.Lattice.Free module
  • Add Divisibility lattice.
  • Fix Lexicographic.

1.5.0 (2015-12-18)

  • Move PartialOrd (k -> v) instance into own module
  • Const and Identity instances
  • added fromBool
  • Add Lexicographic, Ordered and Op newtypes

1.4.1 (2015-10-26)

  • MINIMAL pragma in with GHC 7.8
  • Add DEPREACTED pragma for meet and join, use infix version \/ and /\

1.4 (2015-09-19)

  • Infix operators
  • meets and joins generalised to work on any Foldable
  • Deprecate Algebra.Enumerable, use universe package
  • Add Applicative and Monad typeclasses to Dropped, Lifted and Levitated
  • Add Semigroup instance to Join and Meet
  • Add instances for (), Proxy, Tagged and Void

1.3 (2015-05-18)

  • relaxed constraint for BoundedLattice (Levitated a)
  • added instances to Dropped, Levitated and Lifted:
    • from base
    • NFData
    • Hashable
  • added HashSet and HashMap lattice instances