def Lean.Expr.instantiateBetaRevRange (e : Lean.Expr) (start stop : Nat) (args : Array Lean.Expr) : Lean.Expr

Auxiliary function for instantiating the loose bound variables in e with args[start:stop]. This function is similar to instantiateRevRange, but it applies beta-reduction when we instantiate a bound variable with a lambda expression. Example: Given the term #0 a, and start := 0, stop := 1, args := #[fun x => x] the result is a instead of (fun x => x) a. This reduction is useful when we are inferring the type of eliminator-like applications. For example, given (n m : Nat) (f : Nat → Nat) (h : m = n), the type of Eq.subst (motive := fun x => f m = f x) h rfl is motive n which is (fun (x : Nat) => f m = f x) n This function reduces the new application to f m = f n

We use it to implement inferAppType

Equations

• One or more equations did not get rendered due to their size.

partial def Lean.Expr.instantiateBetaRevRange.visit (start stop : Nat) (args : Array Lean.Expr) (e : Lean.Expr) (offset : Nat) : Lean.MonadStateCacheT (Lean.ExprStructEq × Nat) Lean.Expr Id Lean.Expr

def Lean.Meta.throwFunctionExpected {α : Type} (f : Lean.Expr) : Lean.MetaM α

def Lean.Meta.throwIncorrectNumberOfLevels {α : Type} (constName : Lean.Name) (us : List Lean.Level) : Lean.MetaM α

def Lean.Meta.throwTypeExcepted {α : Type} (type : Lean.Expr) : Lean.MetaM α

def Lean.Meta.getLevel (type : Lean.Expr) : Lean.MetaM Lean.Level

def Lean.Meta.throwUnknownMVar {α : Type} (mvarId : Lean.MVarId) : Lean.MetaM α

@[inline]

def Lean.Meta.withInferTypeConfig {α : Type} (x : Lean.MetaM α) : Lean.MetaM α

@[export lean_infer_type]

def Lean.Meta.inferTypeImp (e : Lean.Expr) : Lean.MetaM Lean.Expr

def Lean.Meta.inferTypeImp.infer (e : Lean.Expr) : Lean.MetaM Lean.Expr

partial def Lean.Meta.isPropQuick : Lean.Expr → Lean.MetaM Lean.LBool

isPropQuick e is an "approximate" predicate which returns LBool.true if e is a proposition.

def Lean.Meta.isProp (e : Lean.Expr) : Lean.MetaM Bool

isProp e returns true if e is a proposition.

If e contains metavariables, it may not be possible to decide whether is a proposition or not. We return false in this case. We considered using LBool and retuning LBool.undef, but we have no applications for it.

Equations

• One or more equations did not get rendered due to their size.

partial def Lean.Meta.isProofQuick : Lean.Expr → Lean.MetaM Lean.LBool

isProofQuick e is an "approximate" predicate which returns LBool.true if e is a proof.

def Lean.Meta.isProof (e : Lean.Expr) : Lean.MetaM Bool

Equations

• One or more equations did not get rendered due to their size.

partial def Lean.Meta.isTypeQuick : Lean.Expr → Lean.MetaM Lean.LBool

isTypeQuick e is an "approximate" predicate which returns LBool.true if e is a type.

def Lean.Meta.isType (e : Lean.Expr) : Lean.MetaM Bool

Return true iff the type of e is a Sort _.

def Lean.Meta.typeFormerTypeLevelQuick : Lean.Expr → Option Lean.Level

Equations

• Lean.Meta.typeFormerTypeLevelQuick (Lean.Expr.forallE binderName binderType b binderInfo) = Lean.Meta.typeFormerTypeLevelQuick b
• Lean.Meta.typeFormerTypeLevelQuick (Lean.Expr.sort l) = some l
• Lean.Meta.typeFormerTypeLevelQuick x = none

def Lean.Meta.typeFormerTypeLevel (type : Lean.Expr) : Lean.MetaM (Option Lean.Level)

Return u iff type is Sort u or As → Sort u.

Equations

• Lean.Meta.typeFormerTypeLevel type = match Lean.Meta.typeFormerTypeLevelQuick type with | some l => pure (some l) | none => Lean.Meta.savingCache (Lean.Meta.typeFormerTypeLevel.go type #[])

partial def Lean.Meta.typeFormerTypeLevel.go (type : Lean.Expr) (xs : Array Lean.Expr) : Lean.MetaM (Option Lean.Level)

def Lean.Meta.isTypeFormerType (type : Lean.Expr) : Lean.MetaM Bool

Return true iff type is Sort _ or As → Sort _.

def Lean.Meta.isPropFormerType (type : Lean.Expr) : Lean.MetaM Bool

Return true iff type is Prop or As → Prop.

Equations

• Lean.Meta.isPropFormerType type = do let __do_lift ← Lean.Meta.typeFormerTypeLevel type pure (__do_lift == some Lean.Level.zero)

def Lean.Meta.isTypeFormer (e : Lean.Expr) : Lean.MetaM Bool

Return true iff e : Sort _ or e : (forall As, Sort _). Remark: it subsumes isType

def Lean.Meta.arrowDomainsN (n : Nat) (type : Lean.Expr) : Lean.MetaM (Array Lean.Expr)

Given n and a non-dependent function type α₁ → α₂ → ... → αₙ → Sort u, returns the types α₁, α₂, ..., αₙ. Throws an error if there are not at least n argument types or if a later argument type depends on a prior one (i.e., it's a dependent function type).

This can be used to infer the expected type of the alternatives when constructing a MatcherApp.

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.inferArgumentTypesN (n : Nat) (e : Lean.Expr) : Lean.MetaM (Array Lean.Expr)

Infers the types of the next n parameters that e expects. See arrowDomainsN.

Equations

• Lean.Meta.inferArgumentTypesN n e = do let __do_lift ← Lean.Meta.inferType e Lean.Meta.arrowDomainsN n __do_lift