multirec-0.2: Generic programming with systems of recursive datatypesSource codeContentsIndex
Generics.MultiRec.Compos
Portabilitynon-portable
Stabilityexperimental
Maintainergenerics@haskell.org
Contents
Compos
Description

The compos operator, inspired by

B. Bringert and A. Ranta A pattern for almost compositional functions ICFP 2006

Synopsis
compos :: (Ix s ix, HFunctor (PF s)) => (forall ix. Ix s ix => s ix -> ix -> ix) -> ix -> ix
composM :: (Ix s ix, HFunctor (PF s), Monad m) => (forall ix. Ix s ix => s ix -> ix -> m ix) -> ix -> m ix
composA :: (Ix s ix, HFunctor (PF s), Applicative a) => (forall ix. Ix s ix => s ix -> ix -> a ix) -> ix -> a ix
Compos
compos :: (Ix s ix, HFunctor (PF s)) => (forall ix. Ix s ix => s ix -> ix -> ix) -> ix -> ixSource
Normal version.
composM :: (Ix s ix, HFunctor (PF s), Monad m) => (forall ix. Ix s ix => s ix -> ix -> m ix) -> ix -> m ixSource
Monadic version of compos.
composA :: (Ix s ix, HFunctor (PF s), Applicative a) => (forall ix. Ix s ix => s ix -> ix -> a ix) -> ix -> a ixSource
Applicative version of compos.
Produced by Haddock version 2.4.2