Copyright | (c) 2008 University of Minho |
---|---|
License | BSD3 |
Maintainer | hpacheco@di.uminho.pt |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell98 |
Pointless Haskell: point-free programming with recursion patterns as hylomorphisms
This module provides the same examples, but with support for GHood observations.
- lengthHyloO :: Observable a => [a] -> Int
- lengthAnaO :: Observable a => [a] -> Int
- lengthCataO :: (Typeable a, Observable a) => [a] -> Int
- factHyloO :: Int -> Int
- factParaO :: Int -> Int
- factZygoO :: Int -> Int
- fibHyloO :: Int -> Int
- fibHistoO :: Int -> Int
- fibDynaO :: Int -> Int
- qsortHyloO :: (Typeable a, Observable a, Ord a) => [a] -> [a]
- tailParaO :: (Typeable a, Observable a) => [a] -> [a]
- addAccumO :: (Int, Int) -> Int
Documentation
lengthHyloO :: Observable a => [a] -> Int Source
Definition of the observable length function as an hylomorphism.
lengthAnaO :: Observable a => [a] -> Int Source
Definition of the observable length function as an anamorphism.
lengthCataO :: (Typeable a, Observable a) => [a] -> Int Source
Definition of the observable length function as a catamorphism.
qsortHyloO :: (Typeable a, Observable a, Ord a) => [a] -> [a] Source
Definition of the observable quicksort function as an hylomorphism.
tailParaO :: (Typeable a, Observable a) => [a] -> [a] Source
Definition of the observable tail function as a paramorphism.