| Safe Haskell | None |
|---|
Agda.Syntax.Concrete.Generic
Contents
Description
Generic traversal and reduce for concrete syntax,
in the style of Generic.
However, here we use the terminology of Traversable.
Documentation
Generic traversals for concrete expressions.
Note: does not go into patterns!
Methods
mapExpr :: (Expr -> Expr) -> a -> aSource
This corresponds to map.
traverseExpr :: (Monad m, Applicative m) => (Expr -> m Expr) -> a -> m aSource
This corresponds to mapM.
foldExpr :: Monoid m => (Expr -> m) -> a -> mSource
This is a reduce.
Instances
| ExprLike QName | |
| ExprLike Name | |
| ExprLike ModuleApplication | |
| ExprLike Declaration | |
| ExprLike LHS | |
| ExprLike TypedBindings | |
| ExprLike LamBinding | |
| ExprLike Expr | |
| ExprLike a => ExprLike [a] | |
| ExprLike a => ExprLike (Maybe a) | |
| ExprLike a => ExprLike (WhereClause' a) | |
| ExprLike a => ExprLike (RHS' a) | |
| ExprLike a => ExprLike (TypedBinding' a) | |
| ExprLike a => ExprLike (OpApp a) | |
| ExprLike a => ExprLike (Arg a) | |
| (ExprLike a, ExprLike b) => ExprLike (a, b) | |
| ExprLike a => ExprLike (Named name a) | |
| (ExprLike a, ExprLike b, ExprLike c) => ExprLike (a, b, c) |