Safe Haskell	None
Language	Haskell2010

Data.Fix

Documentation

newtype Fix f Source #

Constructors

Fix
Fields unFix :: f (Fix f)

Instances

Eq1 f => Eq (Fix f) Source #
Instance details Defined in Data.Fix Methods (==) :: Fix f -> Fix f -> Bool # (/=) :: Fix f -> Fix f -> Bool #
Ord1 f => Ord (Fix f) Source #
Instance details Defined in Data.Fix Methods compare :: Fix f -> Fix f -> Ordering # (<) :: Fix f -> Fix f -> Bool # (<=) :: Fix f -> Fix f -> Bool # (>) :: Fix f -> Fix f -> Bool # (>=) :: Fix f -> Fix f -> Bool # max :: Fix f -> Fix f -> Fix f # min :: Fix f -> Fix f -> Fix f #
Read1 f => Read (Fix f) Source #
Instance details Defined in Data.Fix Methods readsPrec :: Int -> ReadS (Fix f) # readList :: ReadS [Fix f] # readPrec :: ReadPrec (Fix f) # readListPrec :: ReadPrec [Fix f] #
Show1 f => Show (Fix f) Source #
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Fix f -> ShowS # show :: Fix f -> String # showList :: [Fix f] -> ShowS #

mapFix :: Functor f => (forall a. f a -> g a) -> Fix f -> Fix g Source #

traverseFix :: (Traversable f, Monad m) => (forall a. f a -> m (g a)) -> Fix f -> m (Fix g) Source #

cotraverseFix :: (Cotraversable f, Comonad ɯ) => (forall a. ɯ (f a) -> g a) -> ɯ (Fix f) -> Fix g Source #

cata :: Functor f => (f a -> a) -> Fix f -> a Source #

cataM :: (Traversable f, Monad m) => (f a -> m a) -> Fix f -> m a Source #

cataW :: (Cotraversable f, Comonad ɯ) => (ɯ (f a) -> a) -> ɯ (Fix f) -> a Source #

ana :: Functor f => (a -> f a) -> a -> Fix f Source #

anaM :: (Traversable f, Monad m) => (a -> m (f a)) -> a -> m (Fix f) Source #

anaW :: (Cotraversable f, Comonad ɯ) => (ɯ a -> f a) -> ɯ a -> Fix f Source #