# The lattices package

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]

## Properties

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

Change log | CHANGELOG.md |

Dependencies | 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.*), 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] |

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

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

Uploaded | Sun Oct 1 16:53:06 UTC 2017 by phadej |

Distributions | LTSHaskell:1.5.0, NixOS:1.7, Stackage:1.7, Tumbleweed:1.5.0 |

Downloads | 5028 total (125 in the last 30 days) |

Rating | 2.0 (votes: 1) [estimated by rule of succession] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2017-10-01 [all 1 reports] Hackage Matrix CI |

## Downloads

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