44 lines
1.7 KiB
Text
44 lines
1.7 KiB
Text
/-
|
|
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Author: Leonardo de Moura
|
|
-/
|
|
import Lean.Data.Occurrences
|
|
import Lean.HeadIndex
|
|
import Lean.Meta.ExprDefEq
|
|
|
|
namespace Lean.Meta
|
|
|
|
def kabstract {m} [MonadLiftT MetaM m] (e : Expr) (p : Expr) (occs : Occurrences := Occurrences.all) : m Expr := liftMetaM do
|
|
let e ← instantiateMVars e
|
|
if p.isFVar && occs == Occurrences.all then
|
|
return e.abstract #[p] -- Easy case
|
|
else
|
|
let pHeadIdx := p.toHeadIndex
|
|
let pNumArgs := p.headNumArgs
|
|
let rec visit (e : Expr) (offset : Nat) : StateRefT Nat MetaM Expr := do
|
|
let visitChildren : Unit → StateRefT Nat MetaM Expr := fun _ => do
|
|
match e with
|
|
| Expr.app f a _ => return e.updateApp! (← visit f offset) (← visit a offset)
|
|
| Expr.mdata _ b _ => return e.updateMData! (← visit b offset)
|
|
| Expr.proj _ _ b _ => return e.updateProj! (← visit b offset)
|
|
| Expr.letE _ t v b _ => return e.updateLet! (← visit t offset) (← visit v offset) (← visit b (offset+1))
|
|
| Expr.lam _ d b _ => return e.updateLambdaE! (← visit d offset) (← visit b (offset+1))
|
|
| Expr.forallE _ d b _ => return e.updateForallE! (← visit d offset) (← visit b (offset+1))
|
|
| e => return e
|
|
if e.hasLooseBVars then
|
|
visitChildren ()
|
|
else if e.toHeadIndex != pHeadIdx || e.headNumArgs != pNumArgs then
|
|
visitChildren ()
|
|
else if (← isDefEq e p) then
|
|
let i ← get
|
|
set (i+1)
|
|
if occs.contains i then
|
|
pure (mkBVar offset)
|
|
else
|
|
visitChildren ()
|
|
else
|
|
visitChildren ()
|
|
(visit e 0).run' 1
|
|
|
|
end Lean.Meta
|