Documentation

Lean.Util.Recognizers

@[inline]

def Lean.Expr.const? (e : Expr) :

Option (Name × List Level)

Equations

(Lean.Expr.const n us).const? = some (n, us)
e.const? = none

Instances For

@[inline]

def Lean.Expr.app1? (e : Expr) (fName : Name) :

Equations

e.app1? fName = if e.isAppOfArity fName 1 = true then some e.appArg! else none

Instances For

@[inline]

def Lean.Expr.app2? (e : Expr) (fName : Name) :

Option (Expr × Expr)

Equations

e.app2? fName = if e.isAppOfArity fName 2 = true then some (e.appFn!.appArg!, e.appArg!) else none

Instances For

@[inline]

def Lean.Expr.app3? (e : Expr) (fName : Name) :

Option (Expr × Expr × Expr)

Equations

e.app3? fName = if e.isAppOfArity fName 3 = true then some (e.appFn!.appFn!.appArg!, e.appFn!.appArg!, e.appArg!) else none

Instances For

@[inline]

def Lean.Expr.app4? (e : Expr) (fName : Name) :

Option (Expr × Expr × Expr × Expr)

Equations

e.app4? fName = if e.isAppOfArity fName 4 = true then some (e.appFn!.appFn!.appFn!.appArg!, e.appFn!.appFn!.appArg!, e.appFn!.appArg!, e.appArg!) else none

Instances For

@[inline]

def Lean.Expr.eq? (p : Expr) :

Option (Expr × Expr × Expr)

Equations

p.eq? = p.app3? `Eq

Instances For

@[inline]

def Lean.Expr.ne? (p : Expr) :

Option (Expr × Expr × Expr)

Equations

p.ne? = p.app3? `Ne

Instances For

@[inline]

def Lean.Expr.iff? (p : Expr) :

Option (Expr × Expr)

Equations

p.iff? = p.app2? `Iff

Instances For

@[inline]

def Lean.Expr.eqOrIff? (p : Expr) :

Option (Expr × Expr)

Equations

p.eqOrIff? = match p.app3? `Eq with | some (fst, lhs, rhs) => some (lhs, rhs) | x => p.iff?

Instances For

@[inline]

def Lean.Expr.not? (p : Expr) :

Equations

p.not? = p.app1? `Not

Instances For

@[inline]

def Lean.Expr.notNot? (p : Expr) :

Equations

p.notNot? = match p.not? with | some p => p.not? | none => none

Instances For

@[inline]

def Lean.Expr.and? (p : Expr) :

Option (Expr × Expr)

Equations

p.and? = p.app2? `And

Instances For

@[inline]

def Lean.Expr.heq? (p : Expr) :

Option (Expr × Expr × Expr × Expr)

Equations

p.heq? = p.app4? `HEq

Instances For

def Lean.Expr.natAdd? (e : Expr) :

Option (Expr × Expr)

Equations

e.natAdd? = e.app2? `Nat.add

Instances For

@[inline]

def Lean.Expr.arrow? :

Expr → Option (Expr × Expr)

Equations

(Lean.Expr.forallE binderName α β binderInfo).arrow? = if β.hasLooseBVars = true then none else some (α, β)
x✝.arrow? = none

Instances For

def Lean.Expr.isEq (e : Expr) :

Equations

e.isEq = e.isAppOfArity `Eq 3

Instances For

def Lean.Expr.isHEq (e : Expr) :

Equations

e.isHEq = e.isAppOfArity `HEq 4

Instances For

def Lean.Expr.isIte (e : Expr) :

Equations

e.isIte = e.isAppOfArity `ite 5

Instances For

def Lean.Expr.isDIte (e : Expr) :

Equations

e.isDIte = e.isAppOfArity `dite 5

Instances For

def Lean.Expr.listLit? (e : Expr) :

Option (Expr × List Expr)

Equations

e.listLit? = Lean.Expr.listLit?.loop e []

Instances For

partial def Lean.Expr.listLit?.loop (e : Expr) (acc : List Expr) :

Option (Expr × List Expr)

def Lean.Expr.arrayLit? (e : Expr) :

Option (Expr × List Expr)

Equations

e.arrayLit? = if e.isAppOfArity' `List.toArray 2 = true then e.appArg!'.listLit? else none

Instances For

def Lean.Expr.prod? (e : Expr) :

Option (Expr × Expr)

Recognize α × β

Equations

e.prod? = e.app2? `Prod

Instances For

def Lean.Expr.name? :

Expr → Option Name

Checks if an expression is a Name literal, and if so returns the name.

Instances For