|A variant of fold that allows the specification of the algebra in a
convenient way, and that fixes the result type to a constant.
|The type family of convenient algebras.
|type family Alg f r :: *||Source|
|The type family we use to describe the convenient algebras.
|type Algebra phi r = forall ix. phi ix -> Alg (PF phi) r||Source|
|The algebras passed to the fold have to work for all index types
in the family. The additional witness argument is required only
to make GHC's typechecker happy.
|The class to turn convenient algebras into standard algebras.
|The class fold explains how to convert a convenient algebra
Alg back into a function from functor to result, as required
by the standard fold function.
|Fold with convenient algebras.
|Construction of algebras
|For constructing algebras that are made of nested pairs rather
than n-ary tuples, it is helpful to use this pairing combinator.
|Produced by Haddock version 2.4.2|