opaque Lean.Meta.backward.eqns.nonrecursive : Lean.Option Bool

opaque Lean.Meta.backward.eqns.deepRecursiveSplit : Lean.Option Bool

def Lean.Meta.eqnAffectingOptions : Array (Lean.Option Bool)

These options affect the generation of equational theorems in a significant way. For these, their value at definition time, not realization time, should matter.

This is implemented by

• eagerly realizing the equations when they are set to a non-default value
• when realizing them lazily, reset the options to their default

opaque Lean.Meta.recExt : TagDeclarationExtension

Environment extension for storing which declarations are recursive. This information is populated by the PreDefinition module, but the simplifier uses when unfolding declarations.

def Lean.Meta.markAsRecursive (declName : Name) : CoreM Unit

Marks the given declaration as recursive.

def Lean.Meta.isRecursiveDefinition (declName : Name) : CoreM Bool

Returns true if declName was defined using well-founded recursion, or structural recursion.

def Lean.Meta.eqnThmSuffixBase : String

def Lean.Meta.eqnThmSuffixBasePrefix : String

def Lean.Meta.eqn1ThmSuffix : String

def Lean.Meta.isEqnReservedNameSuffix (s : String) : Bool

Returns true if s is of the form eq_<idx>

def Lean.Meta.unfoldThmSuffix : String

def Lean.Meta.eqUnfoldThmSuffix : String

def Lean.Meta.ensureEqnReservedNamesAvailable (declName : Name) : CoreM Unit

Throw an error if names for equation theorems for declName are not available.

def Lean.Meta.GetEqnsFn : Type

def Lean.Meta.registerGetEqnsFn (f : GetEqnsFn) : IO Unit

Registers a new function for retrieving equation theorems. We generate equations theorems on demand, and they are generated by more than one module. For example, the structural and well-founded recursion modules generate them. Most recent getters are tried first.

A getter returns an Option (Array Name). The result is none if the getter failed. Otherwise, it is a sequence of theorem names where each one of them corresponds to an alternative. Example: the definition

def f (xs : List Nat) : List Nat :=
  match xs with
  | [] => []
  | x::xs => (x+1)::f xs

should have two equational theorems associated with it

f [] = []

and

(x : Nat) → (xs : List Nat) → f (x :: xs) = (x+1) :: f xs

structure Lean.Meta.EqnsExtState : Type

• map : PHashMap Name (Array Name)
• mapInv : PHashMap Name Name

instance Lean.Meta.instInhabitedEqnsExtState : Inhabited EqnsExtState

opaque Lean.Meta.eqnsExt : EnvExtension EqnsExtState

def Lean.Meta.isEqnThm? (thmName : Name) : CoreM (Option Name)

Returns some declName if thmName is an equational theorem for declName.

def Lean.Meta.isEqnThm (thmName : Name) : CoreM Bool

Returns true if thmName is an equational theorem.

def Lean.Meta.getEqnsFor? (declName : Name) : MetaM (Option (Array Name))

Returns equation theorems for the given declaration.

def Lean.Meta.generateEagerEqns (declName : Name) : MetaM Unit

If any equation theorem affecting option is not the default value, create the equations now.

def Lean.Meta.GetUnfoldEqnFn : Type

def Lean.Meta.registerGetUnfoldEqnFn (f : GetUnfoldEqnFn) : IO Unit

Registers a new function for retrieving a "unfold" equation theorem.

We generate this kind of equation theorem on demand, and it is generated by more than one module. For example, the structural and well-founded recursion modules generate it. Most recent getters are tried first.

A getter returns an Option Name. The result is none if the getter failed. Otherwise, it is a theorem name. Example: the definition

def f (xs : List Nat) : List Nat :=
  match xs with
  | [] => []
  | x::xs => (x+1)::f xs

should have the theorem

(xs : Nat) →
  f xs =
    match xs with
    | [] => []
    | x::xs => (x+1)::f xs

def Lean.Meta.getUnfoldEqnFor? (declName : Name) (nonRec : Bool := false) : MetaM (Option Name)

Returns an "unfold" theorem (f.eq_def) for the given declaration. By default, we do not create unfold theorems for nonrecursive definitions. You can use nonRec := true to override this behavior.