lattice -package:lattices
The combination of two semi lattices makes a lattice if the absorption
law holds: see
Absorption Law and
Lattice
Absorption: a \/ (a /\ b) == a /\ (a \/ b) == a
Not on Stackage, so not searched.
A library for lattices
Lattice symbol e.g. P -P I -I R A B C F
not suport T and S
A join-semilattice with an identity element
bottom for
\/.
x \/ bottom == bottom
A meet-semilattice with an identity element
top for
/\.
x /\ top == top
A algebraic structure with element joins: See
Semilattice
Associativity: x \/ (y \/ z) == (x \/ y) \/ z
Commutativity: x \/ y == y \/ x
Idempotency: x \/ x == x
A algebraic structure with element meets: See
Semilattice
Associativity: x /\ (y /\ z) == (x /\ y) /\ z
Commutativity: x /\ y == y /\ x
Idempotency: x /\ x == x
Lattices with both bounds
x /\ bottom == x
x \/ top = x
A transfer function might want to use the logging flag to control
debugging, as in for example, it updates just one element in a big
finite map. We don't want Hoopl to show the whole fact, and only the
transfer function knows exactly what changed.
Not on Stackage, so not searched.
A Haskell implementation of semibounded lattices