semilattices: Semilattices

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

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

[Skip to Readme]

Modules

[Index]

Data
- Semilattice

Downloads

semilattices-0.0.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

robrix

For package maintainers and hackage trustees

edit package information

Candidates

0.0.0.0, 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.0.0.5, 0.0.0.6, 0.0.0.7, 0.0.0.8, 0.0.0.9

Versions [RSS]	0.0.0.0, 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.0.0.5, 0.0.0.6, 0.0.0.7, 0.0.0.8, 0.0.0.9
Change log	ChangeLog.md
Dependencies	base (>=4.9 && <4.12), containers (>=0.5 && <0.6), hashable (>=1.2 && <1.3), unordered-containers (>=0.2 && <0.3) [details]
License	BSD-3-Clause
Copyright	2017 Rob Rix
Author	Rob Rix
Maintainer	rob.rix@me.com
Uploaded	by robrix at 2018-06-15T15:17:18Z
Category	Algebra, Data, Data Structures, Math
Home page	https://github.com/robrix/semilattices
Source repo	head: git clone https://github.com/robrix/semilattices
Distributions	NixOS:0.0.0.9
Reverse Dependencies	2 direct, 15 indirect [details]
Downloads	4741 total (43 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2018-06-15 [all 1 reports]

Readme for semilattices-0.0.0.0

[back to package description]

`semilattices`

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

Usage

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).