Copyright | (c) 2011 Patrick Bahr |
---|---|

License | BSD3 |

Maintainer | Patrick Bahr <paba@diku.dk> |

Stability | experimental |

Portability | non-portable (GHC Extensions) |

Safe Haskell | None |

Language | Haskell98 |

This module defines type generic functions and recursive schemes along the lines of the Uniplate library.

## Synopsis

- getSubterm :: (Functor g, Foldable g) => [Int] -> Term g -> Maybe (Term g)
- subterms :: forall f. Foldable f => Term f -> [Term f]
- subterms' :: forall f g. (Foldable f, g :<: f) => Term f -> [g (Term f)]
- transform :: Functor f => (Term f -> Term f) -> Term f -> Term f
- transform' :: Functor f => (Term f -> Maybe (Term f)) -> Term f -> Term f
- transformM :: (Traversable f, Monad m) => (Term f -> m (Term f)) -> Term f -> m (Term f)
- query :: Foldable f => (Term f -> r) -> (r -> r -> r) -> Term f -> r
- gsize :: Foldable f => Term f -> Int
- size :: Foldable f => Cxt h f a -> Int
- height :: Foldable f => Cxt h f a -> Int

# Documentation

getSubterm :: (Functor g, Foldable g) => [Int] -> Term g -> Maybe (Term g) Source #

This function returns the subterm of a given term at the position
specified by the given path or `Nothing`

if the input term has no
such subterm

subterms :: forall f. Foldable f => Term f -> [Term f] Source #

This function returns a list of all subterms of the given
term. This function is similar to Uniplate's `universe`

function.

subterms' :: forall f g. (Foldable f, g :<: f) => Term f -> [g (Term f)] Source #

This function returns a list of all subterms of the given term that are constructed from a particular functor.

transform :: Functor f => (Term f -> Term f) -> Term f -> Term f Source #

This function transforms every subterm according to the given
function in a bottom-up manner. This function is similar to
Uniplate's `transform`

function.

transformM :: (Traversable f, Monad m) => (Term f -> m (Term f)) -> Term f -> m (Term f) Source #

Monadic version of `transform`

.