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

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.

[Skip to Readme]

Versions | 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 |
---|---|

Change log | CHANGELOG.md |

Dependencies | base (>=4.5 && <4.12), base-compat (>=0.9.3 && <0.11), containers (>=0.4.2.1 && <0.6), deepseq (>=1.3.0.0 && <1.5), ghc-prim, hashable (>=1.2.6.1 && <1.3), semigroupoids (>=5.2.2 && <5.4), semigroups (>=0.18.3 && <0.19), tagged (>=0.8.5 && <0.9), transformers (>=0.3 && <0.6), universe-base (==1.0.*), universe-reverse-instances (==1.0.*), unordered-containers (>=0.2.6.0 && <0.3), void (==0.7.*) [details] |

License | BSD-3-Clause |

Copyright | (C) 2010-2015 Maximilian Bolingbroke |

Author | Maximilian Bolingbroke <batterseapower@hotmail.com> |

Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |

Category | Math |

Home page | http://github.com/phadej/lattices/ |

Bug tracker | http://github.com/phadej/lattices/issues |

Source repo | head: git clone git://github.com/phadej/lattices.git |

Uploaded | by phadej at Thu Jul 5 14:04:18 UTC 2018 |

Distributions | LTSHaskell:1.7.1.1, NixOS:1.7.1.1, Stackage:1.7.1.1 |

Downloads | 7488 total (196 in the last 30 days) |

Rating | 2.25 (votes: 2) [estimated by rule of succession] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2018-07-05 [all 1 reports] Hackage Matrix CI |

## Modules

[Index]

## Downloads

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