• done: Lean.ExprLean.TransformStep

    Return expression without visiting any subexpressions.

  • visit: Lean.ExprLean.TransformStep

    Visit expression (which should be different from current expression) instead. The new expression e is passed to pre again.

  • continue: optParam (Option Lean.Expr) noneLean.TransformStep

    Continue transformation with the given expression (defaults to current expression). For pre, this means visiting the children of the expression. For post, this is equivalent to returning done.

Instances For
    def Lean.Core.transform {m : TypeType} [Monad m] [MonadLiftT Lean.CoreM m] [MonadControlT Lean.CoreM m] (input : Lean.Expr) (pre : optParam (Lean.Exprm Lean.TransformStep) fun x => pure Lean.TransformStep.continue) (post : optParam (Lean.Exprm Lean.TransformStep) fun e => pure (Lean.TransformStep.done e)) :

    Transform the expression input using pre and post.

    • First pre is invoked with the current expression and recursion is continued according to the TransformStep result. In all cases, the expression contained in the result, if any, must be definitionally equal to the current expression.
    • After recursion, if any, post is invoked on the resulting expression.

    The term s in both pre s and post s may contain loose bound variables. So, this method is not appropriate for if one needs to apply operations (e.g., whnf, inferType) that do not handle loose bound variables. Consider using Meta.transform to avoid loose bound variables.

    This method is useful for applying transformations such as beta-reduction and delta-reduction.

    Instances For

      Similar to Core.transform, but terms provided to pre and post do not contain loose bound variables. So, it is safe to use any MetaM method at pre and post.

      Instances For

        Unfold definitions and theorems in e that are not in the current environment, but are in biggerEnv.

        Instances For