Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Documentation.SBV.Examples.KnuckleDragger.InsertionSort

   Proving insertion sort correct.

2. insertionSort :: SList Integer -> SList Integer

   sbv	Documentation.SBV.Examples.KnuckleDragger.InsertionSort

   Insertion sort, using insert above to successively insert the elements.

3. module Documentation.SBV.Examples.KnuckleDragger.MergeSort

   Proving merge sort correct.

4. mergeSort :: SList Integer -> SList Integer

   sbv	Documentation.SBV.Examples.KnuckleDragger.MergeSort

   Merge sort, using merge above to successively sort halved input

5. module Documentation.SBV.Examples.KnuckleDragger.QuickSort

   Proving quick sort correct. The proof here closely follows the development given by Tobias Nipkow, in his paper "Term Rewriting and Beyond -- Theorem Proving in Isabelle," published in Formal Aspects of Computing 1: 320-338 back in 1989.

6. quickSort :: SList Integer -> SList Integer

   sbv	Documentation.SBV.Examples.KnuckleDragger.QuickSort

   Quick-sort, using the first element as pivot.

7. module Documentation.SBV.Examples.Uninterpreted.UISortAllSat

   Demonstrates uninterpreted sorts and how all-sat behaves for them. Thanks to Eric Seidel for the idea.

8. intersectBySorted :: forall (m :: Type -> Type) a . Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a

   streamly-core	Streamly.Internal.Data.Stream

   No documentation available.

9. csort :: (CFreeMonoid f, Dom f a, Ord a) => f a -> f a

   subcategories	Control.Subcategory.Foldable

   No documentation available.

10. csortBy :: (CFreeMonoid f, Dom f a) => (a -> a -> Ordering) -> f a -> f a

    subcategories	Control.Subcategory.Foldable

    No documentation available.

Page 161 of many | Previous | Next