# lattices: Fine-grained library for constructing and manipulating lattices

[ bsd3, library, math ] [ Propose Tags ]

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.

Versions [faq] 1.0, 1.1, 1.2, 1.2.1, 1.2.1.1, 1.3, 1.4, 1.4.1, 1.5.0, 1.6.0, 1.7, 1.7.1, 1.7.1.1, 2, 2.0.1, 2.0.2 CHANGELOG.md base (>=4.6 && <4.15), base-compat (>=0.10.5 && <0.12), containers (>=0.5.0.0 && <0.7), deepseq (>=1.3.0.0 && <1.5), ghc-prim, hashable (>=1.2.7.0 && <1.4), integer-logarithms (>=1.0.3 && <1.1), QuickCheck (>=2.12.6.1 && <2.15), semigroupoids (>=5.3.2 && <5.4), semigroups (>=0.18.5 && <0.20), tagged (>=0.8.6 && <0.9), transformers (>=0.3.0.0 && <0.6), universe-base (==1.1.*), universe-reverse-instances (==1.1.*), unordered-containers (>=0.2.8.0 && <0.3), void (>=0.7.2 && <0.8) [details] BSD-3-Clause (C) 2010-2015 Maximilian Bolingbroke, 2016-2019 Oleg Grenrus Maximilian Bolingbroke , Oleg Grenrus Oleg Grenrus Revision 2 made by phadej at 2020-03-28T11:35:57Z Math http://github.com/phadej/lattices/ http://github.com/phadej/lattices/issues head: git clone git://github.com/phadej/lattices.git by phadej at 2020-02-18T10:38:18Z LTSHaskell:1.7.1.1, NixOS:2.0.2, Stackage:2 14382 total (412 in the last 30 days) 2.25 (votes: 2) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2020-02-18