EVM.Traversals

Documentation

foldProp :: forall b. Monoid b => (forall a. Expr a -> b) -> b -> Prop -> b

foldExpr :: forall b c. Monoid b => (forall a. Expr a -> b) -> b -> Expr c -> b

Recursively folds a given function over a given expression Recursion schemes do this & a lot more, but defining them over GADT's isn't worth the hassle

mapProp :: (forall a. Expr a -> Expr a) -> Prop -> Prop

mapExpr :: (forall a. Expr a -> Expr a) -> Expr b -> Expr b

Recursively applies a given function to every node in a given expr instance Recursion schemes do this & a lot more, but defining them over GADT's isn't worth the hassle

mapExprM :: Monad m => (forall a. Expr a -> m (Expr a)) -> Expr b -> m (Expr b)

mapPropM :: Monad m => (forall a. Expr a -> m (Expr a)) -> Prop -> m Prop

class TraversableTerm a where

Generic operations over AST terms

Methods

mapTerm :: (forall b. Expr b -> Expr b) -> a -> a

foldTerm :: forall c. Monoid c => (forall b. Expr b -> c) -> c -> a -> c

Instances

TraversableTerm Prop

Defined in EVM.Traversals

Methods

mapTerm :: (forall (b :: EType). Expr b -> Expr b) -> Prop -> Prop

foldTerm :: Monoid c => (forall (b :: EType). Expr b -> c) -> c -> Prop -> c

TraversableTerm (Expr a)

Defined in EVM.Traversals

Methods

mapTerm :: (forall (b :: EType). Expr b -> Expr b) -> Expr a -> Expr a

foldTerm :: Monoid c => (forall (b :: EType). Expr b -> c) -> c -> Expr a -> c