# The lattices package

In mathematics, a lattice is a partially ordered set in which every two elements have a unique supremum (also called a least upper bound or `join`) and a unique infimum (also called a greatest lower bound or `meet`).

## Properties

Versions | 1.0, 1.1, 1.2, 1.2.1, 1.2.1.1, 1.3 |
---|---|

Change log | CHANGELOG.md |

Dependencies | base (>=3 && <5), containers (>=0.3 && <0.6), deepseq (>=1.1 && <1.5), ghc-prim, hashable (==1.2.*), unordered-containers (==0.2.*) |

License | BSD3 |

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.git/issues |

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

Uploaded | Mon May 18 13:41:53 UTC 2015 by phadej |

Distributions | LTSHaskell:1.2.1.1, NixOS:1.3, Stackage:1.3 |

Downloads | 3154 total (128 in last 30 days) |

Status | Docs available [build log] Last success reported on 2015-05-20 [all 1 reports] |

## Modules

[Index]

## Downloads

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

#### Maintainers' corner

For package maintainers and hackage trustees