CLaSH.Rewrite.Combinators

Rewriting combinators and traversals

Documentation

allR

Arguments

:: (Functor m, Monad m, Fresh m)

=> Bool

Freshen variable references in abstracted terms

-> Transform m

The transformation to apply to the subtrees

-> Transform m

Apply a transformation on the subtrees of an term

(>->) :: Monad m => Transform m -> Transform m -> Transform m infixr 6

Apply two transformations in succession

(>-!->) :: Monad m => Transform m -> Transform m -> Transform m infixr 6

Apply two transformations in succession, and perform a deepseq in between.

topdownR :: (Fresh m, Functor m, Monad m) => Transform m -> Transform m

Apply a transformation in a topdown traversal

unsafeTopdownR :: (Fresh m, Functor m, Monad m) => Transform m -> Transform m

Apply a transformation in a topdown traversal. Doesn't freshen bound variables

bottomupR :: (Fresh m, Functor m, Monad m) => Transform m -> Transform m

Apply a transformation in a bottomup traversal

unsafeBottomupR :: (Fresh m, Functor m, Monad m) => Transform m -> Transform m

Apply a transformation in a bottomup traversal. Doesn't freshen bound variables

(!->) :: Rewrite m -> Rewrite m -> Rewrite m infixr 5

Only apply the second transformation if the first one succeeds.

(>-!) :: Rewrite m -> Rewrite m -> Rewrite m infixr 5

Only apply the second transformation if the first one fails.

repeatR :: Rewrite m -> Rewrite m

Keep applying a transformation until it fails.

whenR :: Monad m => ([CoreContext] -> Term -> m Bool) -> Transform m -> Transform m

bottomupWhenR :: (Monad m, Fresh m, Functor m) => ([CoreContext] -> Term -> m Bool) -> Transform m -> Transform m

Only traverse downwards when the assertion evaluates to true