Maintained by

**Oleg Grenrus**This version can be pinned in stack with:`lattices-1.7.1.1@sha256:b925f4e21eb449b34fd4d60f26afadf84d445b956102292cfbb37cf5e91628a0,3636`

#### Module documentation for 1.7.1.1

# 1.7.1.1 (2019-07-05)

- Allow newer dependencies, update cabal file

# 1.7.1 (2018-01-29)

# 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