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).
This package provide type-classes for different lattice types, as well
as a class for the partial order.
Changes
2 (2019-04-17)
Reduce to three classes (from six): Lattice, BoundedMeetSemiLatticeBoundeJoinSemiLattice.
The latter two names are kept to help migration.
Remove Algebra.Enumerable module. Use universe package.
Drop GHC-7.4.3 support (broken ConstraintKinds)
Move Algebra.Lattice.Free to Algebra.Lattice.Free.Final
Add concrete syntax Algebra.Lattice.Free and Algebra.Heyting.Free using
LJT-proof search for Eq and PartialOrd