@hackage lattices2.2.1
Fine-grained library for constructing and manipulating lattices
Categories
License
BSD-3-Clause
Maintainer
Oleg Grenrus <oleg.grenrus@iki.fi>
Links
Versions
Installation
Tested Compilers
Dependencies (14)
- base >=4.12 && <4.22
- containers >=0.5.0.0 && <0.8
- deepseq >=1.3.0.0 && <1.6
- ghc-prim
- transformers >=0.3.0.0 && <0.7
- OneTuple >=0.4 && <0.5 Show all…
Dependents (33)
@hackage/heyting-algebras, @hackage/sign, @hackage/edit-lenses, @hackage/data-interval, @hackage/interval-patterns, @hackage/ghc-tags-core, Show all…
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.