Safe Haskell | None |
---|
Implementation of ordering constructs
- data ORD a where
- LTH :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool))
- GTH :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool))
- LTE :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool))
- GTE :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool))
- Min :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full a))
- Max :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full a))
Documentation
Ordering constructs
LTH :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool)) | |
GTH :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool)) | |
LTE :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool)) | |
GTE :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full Bool)) | |
Min :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full a)) | |
Max :: (Type a, Ord a, Ord (Size a)) => ORD (a :-> (a :-> Full a)) |