lattices-2.1: Fine-grained library for constructing and manipulating lattices
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.
-
Algebra
- Algebra.Heyting
-
Algebra.Lattice
- Algebra.Lattice.Divisibility
- Algebra.Lattice.Dropped
- Algebra.Lattice.Free
- Algebra.Lattice.Levitated
- Algebra.Lattice.Lexicographic
- Algebra.Lattice.Lifted
- Algebra.Lattice.M2
- Algebra.Lattice.M3
- Algebra.Lattice.N5
- Algebra.Lattice.Op
- Algebra.Lattice.Ordered
- Algebra.Lattice.Unicode
- Algebra.Lattice.Wide
- Algebra.Lattice.ZeroHalfOne
- Algebra.PartialOrd