Generics.Pointless.Examples.Observe

Pointless Haskell: point-free programming with recursion patterns as hylomorphisms

This module provides the same examples, but with support for GHood observations.

Documentation

lengthHyloO :: Observable a => [a] -> Int

Definition of the observable length function as an hylomorphism.

lengthAnaO :: Observable a => [a] -> Int

Definition of the observable length function as an anamorphism.

lengthCataO :: (Typeable a, Observable a) => [a] -> Int

Definition of the observable length function as a catamorphism.

factHyloO :: Int -> Int

Definition of the observable factorial function as an hylomorphism.

factParaO :: Int -> Int

Definition of the observable factorial function as a paramorphism.

factZygoO :: Int -> Int

Definition of the observable factorial function as a zygomorphism.

fibHyloO :: Int -> Int

Definition of the observable fibonacci function as an hylomorphism.

fibHistoO :: Int -> Int

Definition of the observable fibonacci function as an histomorphism.

fibDynaO :: Int -> Int

Definition of the observable fibonacci function as a dynamorphism.

qsortHyloO :: (Typeable a, Observable a, Ord a) => [a] -> [a]

Definition of the observable quicksort function as an hylomorphism.

tailParaO :: (Typeable a, Observable a) => [a] -> [a]

Definition of the observable tail function as a paramorphism.

addAccumO :: (Int, Int) -> Int

Definition of the observable add function as an accumulation.