Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- preverse :: PIsListLike l a => Term s (l a :--> l a)
- pcheckSorted :: (PIsListLike l a, POrd a) => Term s (l a :--> PBool)
Documentation
pcheckSorted :: (PIsListLike l a, POrd a) => Term s (l a :--> PBool) Source #
O(n) .checks whether a list is sorted