Generics.Regular.Rewriting.Machinery

Summary: Core machinery for rewriting terms.

Type class synonym summarizing generic functions.

class (Regular a, Crush (PF a), GMap (PF a), Show (PF a), Zip (PF a), LR (PF a), Functor (PF a)) => Rewrite a

The Rewrite is a type class synonym, hiding some of the implementation details.

To be able to use the rewriting functions, the user is required to provide an instance of this type class.

Applying a rule specification to a term.

applyRuleM :: (Builder r, Rewrite (Target r), Monad m) => r -> Target r -> m (Target r)

Applies a rule specification to a term, obtaining a monadic value.

applyRule :: (Builder r, Rewrite (Target r)) => r -> Target r -> Target r

Applies a rule specification to a term, obtaining the original term when rewriting fails.

Rewriting a term.

rewriteM :: (Rewrite a, Monad m) => Rule a -> a -> m a

Rewrites a term, obtaining a monadic value.

rewrite :: Rewrite a => Rule a -> a -> a

Rewrites a term, obtaining the original term when rewriting fails.