BSD-3-Clause licensed by James Cranch
Maintained by [email protected]
This version can be pinned in stack with:partialord-0.0.2@sha256:fd4bf628c89204bb5b50a6c7551b6fdf49273f106181dbe92dff896dac13dcf1,1777

Module documentation for 0.0.2

Depends on 2 packages(full list with versions):
Used by 1 package in nightly-2024-06-22(full list with versions):


A data structure supporting partial orders, and some helpful associated routines.

Other packages

An alternative package is already available, namely partial-order. Differences include:

  • PartialOrd has a comparison valued in Maybe Ordering; we use a fresh type with four constructors.
  • Where types have several natural partial orderings, we provide newtypes rather than choosing one.
  • We pay slightly more attention to algorithmic complexity.


Changelog for partialord

All notable changes to this project will be documented in this file.

The format is based on Keep a Changelog, and this project adheres to the Haskell Package Versioning Policy.

Unreleased - YYYY-MM-DD