semilattices: Semilattices

[ algebra, bsd3, data, data-structures, library, math ] [ Propose Tags ]

Join- and meet-semilattices, with optional upper and lower bounds, and a variety of instances for each.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,,,,
Change log
Dependencies base (>=4.9 && <5), containers (>=0.5 && <0.7), unordered-containers (>=0.2.20 && <0.3) [details]
License BSD-3-Clause
Copyright 2017-2024 Rob Rix
Author Rob Rix
Category Algebra, Data, Data Structures, Math
Home page
Source repo head: git clone
Uploaded by robrix at 2024-03-07T17:02:07Z
Reverse Dependencies 2 direct, 15 indirect [details]
Downloads 4157 total (19 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for semilattices-

[back to package description]

Build Status


This Haskell package defines typeclasses for join- and meet-semilattices, and for upper and lower bounds, and a variety of instances for each.


Semilattices are idempotent commutative semigroups, and come in two flavours: Join and Meet. This presentation of them doesn’t inherit from Semigroup however, since Semigroups already exist and the relationships between the various classes here warrant their own operators.

Join semilattices can be combined using the \/ operator (pronounced “lub,” for “least upper bound”). Meet semilattices can be combined with the /\ operator (pronounced “glb,” for “greatest lower bound”). They have opposite relationships to Lower and Upper bounds (which are optional; in general, there are more lower bounds than upper ones).

  • lattices also offers join & meet semilattices, & their respective bounds. Relative to lattices, semilattices primarily offers a different class hierarchy, e.g. Lower & Upper do not have Join & Meet as superclasses. Relative to semilattices, lattices offers classes for lattices (both bounded and un-), partial orderings, a variety of operations for instances.