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.5 && <4.11), base-compat (>=0.9.3 && <0.10), containers (>=0.3 && <0.6), deepseq (>=1.1 && <1.5), ghc-prim, hashable (==1.2.*), semigroupoids (>=5.2 && <5.2.2), semigroups (>=0.16 && <0.19), tagged (>=0.7 && <0.9), transformers (>=0.3 && <0.6), universe-base (==1.0.*), universe-reverse-instances (==1.0.*), unordered-containers (==0.2.*), void (==0.7.*) [details] BSD-3-Clause (C) 2010-2015 Maximilian Bolingbroke Maximilian Bolingbroke Oleg Grenrus Revision 1 made by phadej at Mon Jan 29 16:08:07 UTC 2018 Math http://github.com/phadej/lattices/ http://github.com/phadej/lattices/issues head: git clone git://github.com/phadej/lattices.git by phadej at Sun Oct 1 16:53:06 UTC 2017 LTSHaskell:1.7.1.1, NixOS:2.0.2, Stackage:2 13248 total (862 in the last 30 days) 2.25 (votes: 2) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2017-10-01

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees