Data.Comp.Ordering

This module defines ordering of signatures, which lifts to ordering of terms and contexts.

Documentation

class EqF f => OrdF f where

Signature ordering. An instance OrdF f gives rise to an instance Ord (Term f).

Methods

compareF :: Ord a => f a -> f a -> Ordering

Instances

OrdF []

OrdF Maybe

Ord a0 => OrdF ((,) a)

(Ord a0, Ord b0) => OrdF ((,,) a b)

OrdF f => OrdF (Cxt h f)

(Ord a0, Ord b0, Ord c0) => OrdF ((,,,) a b c)

(OrdF f, OrdF g) => OrdF ((:+:) * f g)

OrdF is propagated through sums.

(Ord a0, Ord b0, Ord c0, Ord d0) => OrdF ((,,,,) a b c d)

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0) => OrdF ((,,,,,) a b c d e)

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0) => OrdF ((,,,,,,) a b c d e f)

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0) => OrdF ((,,,,,,,) a b c d e f g)

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0, Ord h0) => OrdF ((,,,,,,,,) a b c d e f g h)

(Ord a0, Ord b0, Ord c0, Ord d0, Ord e0, Ord f0, Ord g0, Ord h0, Ord i0) => OrdF ((,,,,,,,,,) a b c d e f g h i)