structure Lean.Elab.Term.SavedContext : Type

Saved context for postponed terms and tactics to be executed.

• declName? : Option Lean.Name
• options : Lean.Options
• openDecls : List Lean.OpenDecl
• macroStack : Lean.Elab.MacroStack
• errToSorry : Bool
• levelNames : List Lean.Name

inductive Lean.Elab.Term.TacticMVarKind : Type

The kind of a tactic metavariable, used for additional error reporting.

• term: Lean.Elab.Term.TacticMVarKind

  Standard tactic metavariable, arising from by ... syntax.

• autoParam: Lean.Name → Lean.Elab.Term.TacticMVarKind

  Tactic metavariable arising from an autoparam for a function application.

• fieldAutoParam: Lean.Name → Lean.Name → Lean.Elab.Term.TacticMVarKind

  Tactic metavariable arising from an autoparam for a structure field.

inductive Lean.Elab.Term.SyntheticMVarKind : Type

We use synthetic metavariables as placeholders for pending elaboration steps.

• typeClass: Option Lean.MessageData → Lean.Elab.Term.SyntheticMVarKind

  Use typeclass resolution to synthesize value for metavariable. If extraErrorMsg? is some msg, msg contains additional information to include in error messages regarding type class synthesis failure.

• coe: Option String → Lean.Expr → Lean.Expr → Option Lean.Expr → Option (Lean.MVarId → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) → Lean.Elab.Term.SyntheticMVarKind

  Use coercion to synthesize value for the metavariable. If synthesis fails, then throws an error.

  • If mkErrorMsg? is provided, then the error mkErrorMsg expectedType e is thrown. The mkErrorMsg function is allowed to throw an error itself.
  • Otherwise, throws a default type mismatch error message. If header? is not provided, the default header is "type mismatch". If f? is provided, then throws an application type mismatch error.
• tactic: Lean.Syntax → Lean.Elab.Term.SavedContext → Lean.Elab.Term.TacticMVarKind → Lean.Elab.Term.SyntheticMVarKind

  Use tactic to synthesize value for metavariable.

• postponed: Lean.Elab.Term.SavedContext → Lean.Elab.Term.SyntheticMVarKind

  Metavariable represents a hole whose elaboration has been postponed.

instance Lean.Elab.Term.instInhabitedSyntheticMVarKind : Inhabited Lean.Elab.Term.SyntheticMVarKind

def Lean.Elab.Term.extraMsgToMsg (extraErrorMsg? : Option Lean.MessageData) : Lean.MessageData

Convert an "extra" optional error message into a message "\n{msg}" (if some msg) and MessageData.nil (if none)

Equations

• Lean.Elab.Term.extraMsgToMsg (some msg) = Lean.toMessageData "\n" ++ Lean.toMessageData msg ++ Lean.toMessageData ""
• Lean.Elab.Term.extraMsgToMsg extraErrorMsg? = Lean.MessageData.nil

instance Lean.Elab.Term.instToStringSyntheticMVarKind : ToString Lean.Elab.Term.SyntheticMVarKind

structure Lean.Elab.Term.SyntheticMVarDecl : Type

• stx : Lean.Syntax
• kind : Lean.Elab.Term.SyntheticMVarKind

instance Lean.Elab.Term.instInhabitedSyntheticMVarDecl : Inhabited Lean.Elab.Term.SyntheticMVarDecl

Equations

• Lean.Elab.Term.instInhabitedSyntheticMVarDecl = { default := { stx := default, kind := default } }

inductive Lean.Elab.Term.MVarErrorKind : Type

We can optionally associate an error context with a metavariable (see MVarErrorInfo). We have three different kinds of error context.

• implicitArg: Lean.LocalContext → Lean.Expr → Lean.Elab.Term.MVarErrorKind

  Metavariable for implicit arguments. ctx is the parent application, lctx is a local context where it is valid (necessary for eta feature for named arguments).

• hole: Lean.Elab.Term.MVarErrorKind

  Metavariable for explicit holes provided by the user (e.g., _ and ?m)

• custom: Lean.MessageData → Lean.Elab.Term.MVarErrorKind

  "Custom", msgData stores the additional error messages.

instance Lean.Elab.Term.instInhabitedMVarErrorKind : Inhabited Lean.Elab.Term.MVarErrorKind

instance Lean.Elab.Term.instToStringMVarErrorKind : ToString Lean.Elab.Term.MVarErrorKind

structure Lean.Elab.Term.MVarErrorInfo : Type

We can optionally associate an error context with metavariables.

• mvarId : Lean.MVarId
• ref : Lean.Syntax
• kind : Lean.Elab.Term.MVarErrorKind

instance Lean.Elab.Term.instInhabitedMVarErrorInfo : Inhabited Lean.Elab.Term.MVarErrorInfo

Equations

• Lean.Elab.Term.instInhabitedMVarErrorInfo = { default := { mvarId := default, ref := default, kind := default } }

structure Lean.Elab.Term.LevelMVarErrorInfo : Type

When reporting unexpected universe level metavariables, it is useful to localize the errors to particular terms, especially at let bindings and function binders, where universe polymorphism is not permitted.

• lctx : Lean.LocalContext
• expr : Lean.Expr
• ref : Lean.Syntax
• msgData? : Option Lean.MessageData

instance Lean.Elab.Term.instInhabitedLevelMVarErrorInfo : Inhabited Lean.Elab.Term.LevelMVarErrorInfo

Equations

• Lean.Elab.Term.instInhabitedLevelMVarErrorInfo = { default := { lctx := default, expr := default, ref := default, msgData? := default } }

structure Lean.Elab.Term.LetRecToLift : Type

Nested let rec expressions are eagerly lifted by the elaborator. We store the information necessary for performing the lifting here.

• ref : Lean.Syntax
• fvarId : Lean.FVarId
• attrs : Array Lean.Elab.Attribute
• shortDeclName : Lean.Name
• declName : Lean.Name
• lctx : Lean.LocalContext
• localInstances : Lean.LocalInstances
• type : Lean.Expr
• val : Lean.Expr
• mvarId : Lean.MVarId
• termination : Lean.Elab.TerminationHints

instance Lean.Elab.Term.instInhabitedLetRecToLift : Inhabited Lean.Elab.Term.LetRecToLift

Equations

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

structure Lean.Elab.Term.State : Type

State of the TermElabM monad.

• levelNames : List Lean.Name
• syntheticMVars : Lean.MVarIdMap Lean.Elab.Term.SyntheticMVarDecl
• pendingMVars : List Lean.MVarId
• mvarErrorInfos : List Lean.Elab.Term.MVarErrorInfo

  List of errors associated to a metavariable that are shown to the user if the metavariable could not be fully instantiated

• levelMVarErrorInfos : List Lean.Elab.Term.LevelMVarErrorInfo

  List of data to be able to localize universe level metavariable errors to particular expressions.

• mvarArgNames : Lean.MVarIdMap Lean.Name

  mvarArgNames stores the argument names associated to metavariables. These are used in combination with mvarErrorInfos for throwing errors about metavariables that could not be fully instantiated. For example when elaborating List _, the argument name of the placeholder will be α.

  While elaborating an application, mvarArgNames is set for each metavariable argument, using the available argument name. This may happen before or after the mvarErrorInfos is set for the same metavariable.

  We used to store the argument names in mvarErrorInfos, updating the MVarErrorInfos to add the argument name when it is available, but this doesn't work if the argument name is available before the mvarErrorInfos is set for that metavariable.

• letRecsToLift : List Lean.Elab.Term.LetRecToLift

instance Lean.Elab.Term.instInhabitedState : Inhabited Lean.Elab.Term.State

structure Lean.Elab.Term.SavedState : Type

Backtrackable state for the TermElabM monad.

• meta : Lean.Meta.SavedState
• elab : Lean.Elab.Term.State

theorem Lean.Elab.Term.instNonemptySavedState : Nonempty Lean.Elab.Term.SavedState

structure Lean.Elab.Tactic.State : Type

State of the TacticM monad.

• goals : List Lean.MVarId

instance Lean.Elab.Tactic.instInhabitedState : Inhabited Lean.Elab.Tactic.State

Equations

• Lean.Elab.Tactic.instInhabitedState = { default := { goals := default } }

structure Lean.Elab.Tactic.Snapshot : Type

Snapshots are used to implement the save tactic. This tactic caches the state of the system, and allows us to "replay" expensive proofs efficiently. This is only relevant implementing the LSP server.

• core : Lean.Core.State
• meta : Lean.Meta.State
• term : Lean.Elab.Term.State
• tactic : Lean.Elab.Tactic.State
• stx : Lean.Syntax

structure Lean.Elab.Tactic.CacheKey : Type

Key for the cache used to implement the save tactic.

• mvarId : Lean.MVarId
• pos : String.Pos

instance Lean.Elab.Tactic.instBEqCacheKey : BEq Lean.Elab.Tactic.CacheKey

Equations

• Lean.Elab.Tactic.instBEqCacheKey = { beq := Lean.Elab.Tactic.beqCacheKey✝ }

instance Lean.Elab.Tactic.instHashableCacheKey : Hashable Lean.Elab.Tactic.CacheKey

Equations

• Lean.Elab.Tactic.instHashableCacheKey = { hash := Lean.Elab.Tactic.hashCacheKey✝ }

instance Lean.Elab.Tactic.instInhabitedCacheKey : Inhabited Lean.Elab.Tactic.CacheKey

structure Lean.Elab.Tactic.Cache : Type

Cache for the save tactic.

• pre : Lean.PHashMap Lean.Elab.Tactic.CacheKey Lean.Elab.Tactic.Snapshot
• post : Lean.PHashMap Lean.Elab.Tactic.CacheKey Lean.Elab.Tactic.Snapshot

instance Lean.Elab.Tactic.instInhabitedCache : Inhabited Lean.Elab.Tactic.Cache

Equations

• Lean.Elab.Tactic.instInhabitedCache = { default := { pre := default, post := default } }

structure Lean.Elab.Tactic.SavedState : Type

• term : Lean.Elab.Term.SavedState
• tactic : Lean.Elab.Tactic.State

structure Lean.Elab.Tactic.TacticFinishedSnapshotextends Lean.Language.Snapshot : Type

Snapshot after finishing execution of a tactic.

• desc : String
• diagnostics : Lean.Language.Snapshot.Diagnostics
• infoTree? : Option Lean.Elab.InfoTree
• traces : Lean.TraceState
• isFatal : Bool
• state? : Option Lean.Elab.Tactic.SavedState

  State saved for reuse, if no fatal exception occurred.

instance Lean.Elab.Tactic.instInhabitedTacticFinishedSnapshot : Inhabited Lean.Elab.Tactic.TacticFinishedSnapshot

instance Lean.Elab.Tactic.instToSnapshotTreeTacticFinishedSnapshot : Lean.Language.ToSnapshotTree Lean.Elab.Tactic.TacticFinishedSnapshot

Equations

• Lean.Elab.Tactic.instToSnapshotTreeTacticFinishedSnapshot = { toSnapshotTree := fun (s : Lean.Elab.Tactic.TacticFinishedSnapshot) => { element := s.toSnapshot, children := #[] } }

structure Lean.Elab.Tactic.TacticParsedSnapshotextends Lean.Language.Snapshot : Type

Snapshot just before execution of a tactic.

• desc : String
• diagnostics : Lean.Language.Snapshot.Diagnostics
• infoTree? : Option Lean.Elab.InfoTree
• traces : Lean.TraceState
• isFatal : Bool
• stx : Lean.Syntax

  Syntax tree of the tactic, stored and compared for incremental reuse.

• inner? : Option (Lean.Language.SnapshotTask Lean.Elab.Tactic.TacticParsedSnapshot)

  Task for nested incrementality, if enabled for tactic.

• finished : Lean.Language.SnapshotTask Lean.Elab.Tactic.TacticFinishedSnapshot

  Task for state after tactic execution.

• next : Array (Lean.Language.SnapshotTask Lean.Elab.Tactic.TacticParsedSnapshot)

  Tasks for subsequent, potentially parallel, tactic steps.

instance Lean.Elab.Tactic.instInhabitedTacticParsedSnapshot : Inhabited Lean.Elab.Tactic.TacticParsedSnapshot

Equations

• Lean.Elab.Tactic.instInhabitedTacticParsedSnapshot = { default := { toSnapshot := default, stx := default, inner? := default, finished := default, next := default } }

instance Lean.Elab.Tactic.instToSnapshotTreeTacticParsedSnapshot : Lean.Language.ToSnapshotTree Lean.Elab.Tactic.TacticParsedSnapshot

partial def Lean.Elab.Tactic.instToSnapshotTreeTacticParsedSnapshot.go (s : Lean.Elab.Tactic.TacticParsedSnapshot) : Lean.Language.SnapshotTree

structure Lean.Elab.Term.Context : Type

• declName? : Option Lean.Name
• auxDeclToFullName : Lean.FVarIdMap Lean.Name

  Map .auxDecl local declarations used to encode recursive declarations to their full-names.

• macroStack : Lean.Elab.MacroStack
• mayPostpone : Bool

  When mayPostpone == true, an elaboration function may interrupt its execution by throwing Exception.postpone. The function elabTerm catches this exception and creates fresh synthetic metavariable ?m, stores ?m in the list of pending synthetic metavariables, and returns ?m.

• errToSorry : Bool

  When errToSorry is set to true, the method elabTerm catches exceptions and converts them into synthetic sorrys. The implementation of choice nodes and overloaded symbols rely on the fact that when errToSorry is set to false for an elaboration function F, then errToSorry remains false for all elaboration functions invoked by F. That is, it is safe to transition errToSorry from true to false, but we must not set errToSorry to true when it is currently set to false.

• autoBoundImplicit : Bool

  When autoBoundImplicit is set to true, instead of producing an "unknown identifier" error for unbound variables, we generate an internal exception. This exception is caught at elabBinders and elabTypeWithUnboldImplicit. Both methods add implicit declarations for the unbound variable and try again.

• autoBoundImplicits : Lean.PArray Lean.Expr
• autoBoundImplicitForbidden : Lean.Name → Bool

  A name n is only eligible to be an auto implicit name if autoBoundImplicitForbidden n = false. We use this predicate to disallow f to be considered an auto implicit name in a definition such as

  def f : f → Bool := fun _ => true
  

• sectionVars : Lean.NameMap Lean.Name

  Map from user name to internal unique name

• sectionFVars : Lean.NameMap Lean.Expr

  Map from internal name to fvar

• implicitLambda : Bool

  Enable/disable implicit lambdas feature.

• heedElabAsElim : Bool

  Heed elab_as_elim attribute.

• isNoncomputableSection : Bool

  Noncomputable sections automatically add the noncomputable modifier to any declaration we cannot generate code for.

• ignoreTCFailures : Bool

  When true we skip TC failures. We use this option when processing patterns.

• inPattern : Bool

  true when elaborating patterns. It affects how we elaborate named holes.

• tacticCache? : Option (IO.Ref Lean.Elab.Tactic.Cache)

  Cache for the save tactic. It is only some in the LSP server.

• tacSnap? : Option (Lean.Language.SnapshotBundle Lean.Elab.Tactic.TacticParsedSnapshot)

  Snapshot for incremental processing of current tactic, if any.

  Invariant: if the bundle's old? is set, then the state up to the start of the tactic is unchanged, i.e. reuse is possible.

• saveRecAppSyntax : Bool

  If true, we store in the Expr the Syntax for recursive applications (i.e., applications of free variables tagged with isAuxDecl). We store the Syntax using mkRecAppWithSyntax. We use the Syntax object to produce better error messages at Structural.lean and WF.lean.

• holesAsSyntheticOpaque : Bool

  If holesAsSyntheticOpaque is true, then we mark metavariables associated with _s as syntheticOpaque if they do not occur in patterns. This option is useful when elaborating terms in tactics such as refine' where we want holes there to become new goals. See issue #1681, we have `refine' (fun x => _)

@[reducible, inline]

abbrev Lean.Elab.Term.TermElabM (α : Type) : Type

@[reducible, inline]

abbrev Lean.Elab.Term.TermElab : Type

Equations

• Lean.Elab.Term.TermElab = (Lean.Syntax → Option Lean.Expr → Lean.Elab.TermElabM Lean.Expr)

@[always_inline]

instance Lean.Elab.Term.instMonadTermElabM : Monad Lean.Elab.TermElabM

instance Lean.Elab.Term.instInhabitedTermElabM {α : Type} : Inhabited (Lean.Elab.TermElabM α)

Equations

• Lean.Elab.Term.instInhabitedTermElabM = { default := throw default }

def Lean.Elab.Term.saveState : Lean.Elab.TermElabM Lean.Elab.Term.SavedState

Equations

• Lean.Elab.Term.saveState = do let __do_lift ← liftM Lean.Meta.saveState let __do_lift_1 ← get pure { meta := __do_lift, «elab» := __do_lift_1 }

def Lean.Elab.Term.SavedState.restore (s : Lean.Elab.Term.SavedState) (restoreInfo : Bool := false) : Lean.Elab.TermElabM Unit

@[specialize #[]]

def Lean.Elab.Term.withRestoreOrSaveFull {α : Type} (reusableResult? : Option (α × Lean.Elab.Term.SavedState)) (tacSnap? : Option (Lean.Language.SnapshotBundle Lean.Elab.Tactic.TacticParsedSnapshot)) (act : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM (α × Lean.Elab.Term.SavedState)

Like Meta.withRestoreOrSaveFull for TermElabM, but also takes a tacSnap? that

• when running act, is set as Context.tacSnap?
• otherwise (i.e. on restore) is used to update the new snapshot promise to the old task's value. This extra restore step is necessary because while reusableResult? can be used to replay any effects on State, Context.tacSnap? is not part of it but changed via an IO side effect, so it needs to be replayed separately.

We use an explicit parameter instead of accessing Context.tacSnap? directly because this prevents withRestoreOrSaveFull and withReader from being used in the wrong order.

instance Lean.Elab.Term.instMonadBacktrackSavedStateTermElabM : Lean.MonadBacktrack Lean.Elab.Term.SavedState Lean.Elab.TermElabM

Equations

• Lean.Elab.Term.instMonadBacktrackSavedStateTermElabM = { saveState := Lean.Elab.Term.saveState, restoreState := fun (b : Lean.Elab.Term.SavedState) => b.restore }

def Lean.Elab.Term.withReuseContext {m : Type → Type u_1} {α : Type} [Monad m] [MonadWithReaderOf Lean.Core.Context m] (stx : Lean.Syntax) (act : m α) : m α

Incremental elaboration helper. Avoids leakage of data from outside syntax via the monadic context when running act on stx by

• setting stx as the ref and
• deactivating suppressElabErrors if stx is missing-free, which also helps with not hiding useful errors in this part of the input. Note that if stx has missing, this should always be true for the outer syntax as well, so taking the old value of suppressElabErrors into account should not introduce data leakage.

This combinator should always be used when narrowing reuse to a syntax subtree, usually (in the case of tactics, to be generalized) via withNarrowed(Arg)TacticReuse.

Equations

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

def Lean.Elab.Term.withNarrowedTacticReuse {m : Type → Type} {α : Type} [Monad m] [MonadWithReaderOf Lean.Core.Context m] [MonadWithReaderOf Lean.Elab.Term.Context m] [Lean.MonadOptions m] (split : Lean.Syntax → Lean.Syntax × Lean.Syntax) (act : Lean.Syntax → m α) (stx : Lean.Syntax) : m α

Manages reuse information for nested tactics by splitting given syntax into an outer and inner part. act is then run on the inner part but with reuse information adjusted as following:

• If the old (from tacSnap?'s SyntaxGuarded.stx) and new (from stx) outer syntax are not identical according to Syntax.eqWithInfo, reuse is disabled.
• Otherwise, the old syntax as stored in tacSnap? is updated to the old inner syntax.
• In any case, withReuseContext is used on the new inner syntax to further prepare the monadic context.

For any tactic that participates in reuse, withNarrowedTacticReuse should be applied to the tactic's syntax and act should be used to do recursive tactic evaluation of nested parts.

def Lean.Elab.Term.withNarrowedArgTacticReuse {m : Type → Type} {α : Type} [Monad m] [MonadWithReaderOf Lean.Core.Context m] [MonadWithReaderOf Lean.Elab.Term.Context m] [Lean.MonadOptions m] (argIdx : Nat) (act : Lean.Syntax → m α) (stx : Lean.Syntax) : m α

A variant of withNarrowedTacticReuse that uses stx[argIdx] as the inner syntax and all stx child nodes before that as the outer syntax, i.e. reuse is disabled if there was any change before argIdx.

NOTE: child nodes after argIdx are not tested (which would almost always disable reuse as they are necessarily shifted by changes at argIdx) so it must be ensured that the result of arg does not depend on them (i.e. they should not be inspected beforehand).

def Lean.Elab.Term.withoutTacticIncrementality {m : Type → Type} {α : Type} [Monad m] [MonadWithReaderOf Lean.Elab.Term.Context m] [Lean.MonadOptions m] (cond : Bool) (act : m α) : m α

Disables incremental tactic reuse and reporting for act if cond is true by setting tacSnap? to none. This should be done for tactic blocks that are run multiple times as otherwise the reported progress will jump back and forth (and partial reuse for these kinds of tact blocks is similarly questionable).

Equations

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

def Lean.Elab.Term.withoutTacticReuse {m : Type → Type} {α : Type} [Monad m] [MonadWithReaderOf Lean.Elab.Term.Context m] [Lean.MonadOptions m] (cond : Bool) (act : m α) : m α

Disables incremental tactic reuse for act if cond is true.

def Lean.Elab.Term.wrapAsync {α : Type} (act : Unit → Lean.Elab.TermElabM α) : Lean.Elab.TermElabM (EIO Lean.Exception α)

Wraps the given action for use in EIO.asTask etc., discarding its final monadic state.

Equations

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

def Lean.Elab.Term.wrapAsyncAsSnapshot (act : Unit → Lean.Elab.TermElabM Unit) (desc : String := by exact decl_name%.toString) : Lean.Elab.TermElabM (BaseIO Lean.Language.SnapshotTree)

Wraps the given action for use in BaseIO.asTask etc., discarding its final state except for logSnapshotTask tasks, which are reported as part of the returned tree.

Equations

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

@[reducible, inline]

abbrev Lean.Elab.Term.TermElabResult (α : Type) : Type

Equations

• Lean.Elab.Term.TermElabResult α = EStateM.Result Lean.Exception Lean.Elab.Term.SavedState α

def Lean.Elab.Term.observing {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM (Lean.Elab.Term.TermElabResult α)

Execute x, save resulting expression and new state. We remove any Info created by x. The info nodes are committed when we execute applyResult. We use observing to implement overloaded notation and decls. We want to save Info nodes for the chosen alternative.

Equations

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

def Lean.Elab.Term.applyResult {α : Type} (result : Lean.Elab.Term.TermElabResult α) : Lean.Elab.TermElabM α

Apply the result/exception and state captured with observing. We use this method to implement overloaded notation and symbols.

def Lean.Elab.Term.commitIfDidNotPostpone {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x, but keep state modifications only if x did not postpone. This method is useful to implement elaboration functions that cannot decide whether they need to postpone or not without updating the state.

Equations

• Lean.Elab.Term.commitIfDidNotPostpone x = do let r ← Lean.Elab.Term.observing x Lean.Elab.Term.applyResult r

def Lean.Elab.Term.getLevelNames : Lean.Elab.TermElabM (List Lean.Name)

Return the universe level names explicitly provided by the user.

def Lean.Elab.Term.getFVarLocalDecl! (fvar : Lean.Expr) : Lean.Elab.TermElabM Lean.LocalDecl

Given a free variable fvar, return its declaration. This function panics if fvar is not a free variable.

Equations

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

instance Lean.Elab.Term.instAddErrorMessageContextTermElabM : Lean.AddErrorMessageContext Lean.Elab.TermElabM

Equations

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

def Lean.Elab.Term.withoutSavingRecAppSyntax {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x without storing Syntax for recursive applications. See saveRecAppSyntax field at Context.

unsafe def Lean.Elab.Term.mkTermElabAttributeUnsafe (ref : Lean.Name) : IO (Lean.KeyedDeclsAttribute Lean.Elab.Term.TermElab)

@[implemented_by Lean.Elab.Term.mkTermElabAttributeUnsafe]

opaque Lean.Elab.Term.mkTermElabAttribute (ref : Lean.Name) : IO (Lean.KeyedDeclsAttribute Lean.Elab.Term.TermElab)

opaque Lean.Elab.Term.termElabAttribute : Lean.KeyedDeclsAttribute Lean.Elab.Term.TermElab

inductive Lean.Elab.Term.LVal : Type

Auxiliary datatype for presenting a Lean lvalue modifier. We represent an unelaborated lvalue as a Syntax (or Expr) and List LVal. Example: a.foo.1 is represented as the Syntax a and the list [LVal.fieldName "foo", LVal.fieldIdx 1].

• fieldIdx: Lean.Syntax → Nat → Lean.Elab.Term.LVal
• fieldName: Lean.Syntax → String → Option Lean.Name → Lean.Syntax → Lean.Elab.Term.LVal

  Field suffix? is for producing better error messages because x.y may be a field access or a hierarchical/composite name. ref is the syntax object representing the field. fullRef includes the LHS.

def Lean.Elab.Term.LVal.getRef : Lean.Elab.Term.LVal → Lean.Syntax

def Lean.Elab.Term.LVal.isFieldName : Lean.Elab.Term.LVal → Bool

instance Lean.Elab.Term.instToStringLVal : ToString Lean.Elab.Term.LVal

def Lean.Elab.Term.getDeclName? : Lean.Elab.TermElabM (Option Lean.Name)

Return the name of the declaration being elaborated if available.

def Lean.Elab.Term.getLetRecsToLift : Lean.Elab.TermElabM (List Lean.Elab.Term.LetRecToLift)

Return the list of nested let rec declarations that need to be lifted.

def Lean.Elab.Term.getMVarDecl (mvarId : Lean.MVarId) : Lean.Elab.TermElabM Lean.MetavarDecl

Return the declaration of the given metavariable

instance Lean.Elab.Term.instMonadParentDeclTermElabM : Lean.Elab.MonadParentDecl Lean.Elab.TermElabM

def Lean.Elab.Term.withDeclName {α : Type} (name : Lean.Name) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute withSaveParentDeclInfoContext x with declName? := name. See getDeclName?.

def Lean.Elab.Term.setLevelNames (levelNames : List Lean.Name) : Lean.Elab.TermElabM Unit

Update the universe level parameter names.

Equations

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

def Lean.Elab.Term.withLevelNames {α : Type} (levelNames : List Lean.Name) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x using levelNames as the universe level parameter names. See getLevelNames.

def Lean.Elab.Term.withAuxDecl {α : Type} (shortDeclName : Lean.Name) (type : Lean.Expr) (declName : Lean.Name) (k : Lean.Expr → Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Declare an auxiliary local declaration shortDeclName : type for elaborating recursive declaration declName, update the mapping auxDeclToFullName, and then execute k.

Equations

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

def Lean.Elab.Term.withoutErrToSorryImp {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

def Lean.Elab.Term.withoutErrToSorry {m : Type → Type u_1} {α : Type} [MonadFunctorT Lean.Elab.TermElabM m] : m α → m α

Execute x without converting errors (i.e., exceptions) to sorry applications. Recall that when errToSorry = true, the method elabTerm catches exceptions and converts them into sorry applications.

Equations

• Lean.Elab.Term.withoutErrToSorry = monadMap fun {β : Type} => Lean.Elab.Term.withoutErrToSorryImp

def Lean.Elab.Term.withoutHeedElabAsElimImp {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

def Lean.Elab.Term.withoutHeedElabAsElim {m : Type → Type u_1} {α : Type} [MonadFunctorT Lean.Elab.TermElabM m] : m α → m α

Execute x without heeding the elab_as_elim attribute. Useful when there is no expected type (so elabAppArgs would fail), but expect that the user wants to use such constants.

Equations

• Lean.Elab.Term.withoutHeedElabAsElim = monadMap fun {β : Type} => Lean.Elab.Term.withoutHeedElabAsElimImp

def Lean.Elab.Term.withoutModifyingElabMetaStateWithInfo {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x but discard changes performed at Term.State and Meta.State. Recall that the Environment and InfoState are at Core.State. Thus, any updates to it will be preserved. This method is useful for performing computations where all metavariable must be resolved or discarded. The InfoTrees are not discarded, however, and wrapped in InfoTree.Context to store their metavariable context.

def Lean.Elab.Term.getInfoTreeWithContext? : Lean.Elab.TermElabM (Option Lean.Elab.InfoTree)

Wraps the trees returned from getInfoTrees, if any, in an InfoTree.context node based on the current monadic context and state. This is mainly used to report info trees early via Snapshot.infoTree?. The trees are not removed from the getInfoTrees state as the final info tree of the elaborated command should be complete and not depend on whether parts have been reported early.

As InfoTree.context can have only one child, this function panics if trees contains more than 1 tree. Also, PartialContextInfo.parentDeclCtx is not currently generated as that information is not available in the monadic context and only needed for the final info tree.

def Lean.Elab.Term.throwErrorIfErrors : Lean.Elab.TermElabM Unit

For testing TermElabM methods. The #eval command will sign the error.

def Lean.Elab.Term.traceAtCmdPos (cls : Lean.Name) (msg : Unit → Lean.MessageData) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.traceAtCmdPos cls msg = Lean.withRef Lean.Syntax.missing (Lean.trace cls msg)

def Lean.Elab.Term.ppGoal (mvarId : Lean.MVarId) : Lean.Elab.TermElabM Lean.Format

Equations

• Lean.Elab.Term.ppGoal mvarId = liftM (Lean.Meta.ppGoal mvarId)

def Lean.Elab.Term.liftLevelM {α : Type} (x : Lean.Elab.Level.LevelElabM α) : Lean.Elab.TermElabM α

def Lean.Elab.Term.elabLevel (stx : Lean.Syntax) : Lean.Elab.TermElabM Lean.Level

Equations

• Lean.Elab.Term.elabLevel stx = Lean.Elab.Term.liftLevelM (Lean.Elab.Level.elabLevel stx)

def Lean.Elab.Term.withPushMacroExpansionStack {α : Type} (beforeStx afterStx : Lean.Syntax) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Elaborate x with stx on the macro stack

Equations

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

def Lean.Elab.Term.withMacroExpansion {α : Type} (beforeStx afterStx : Lean.Syntax) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Elaborate x with stx on the macro stack and produce macro expansion info

Equations

• Lean.Elab.Term.withMacroExpansion beforeStx afterStx x = Lean.Elab.withMacroExpansionInfo beforeStx afterStx (Lean.Elab.Term.withPushMacroExpansionStack beforeStx afterStx x)

def Lean.Elab.Term.registerSyntheticMVar (stx : Lean.Syntax) (mvarId : Lean.MVarId) (kind : Lean.Elab.Term.SyntheticMVarKind) : Lean.Elab.TermElabM Unit

Add the given metavariable to the list of pending synthetic metavariables. The method synthesizeSyntheticMVars is used to process the metavariables on this list.

Equations

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

def Lean.Elab.Term.registerSyntheticMVarWithCurrRef (mvarId : Lean.MVarId) (kind : Lean.Elab.Term.SyntheticMVarKind) : Lean.Elab.TermElabM Unit

def Lean.Elab.Term.registerMVarErrorInfo (mvarErrorInfo : Lean.Elab.Term.MVarErrorInfo) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.registerMVarErrorHoleInfo (mvarId : Lean.MVarId) (ref : Lean.Syntax) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.registerMVarErrorHoleInfo mvarId ref = Lean.Elab.Term.registerMVarErrorInfo { mvarId := mvarId, ref := ref, kind := Lean.Elab.Term.MVarErrorKind.hole }

def Lean.Elab.Term.registerMVarErrorImplicitArgInfo (mvarId : Lean.MVarId) (ref : Lean.Syntax) (app : Lean.Expr) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.registerMVarErrorCustomInfo (mvarId : Lean.MVarId) (ref : Lean.Syntax) (msgData : Lean.MessageData) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.registerMVarErrorCustomInfo mvarId ref msgData = Lean.Elab.Term.registerMVarErrorInfo { mvarId := mvarId, ref := ref, kind := Lean.Elab.Term.MVarErrorKind.custom msgData }

def Lean.Elab.Term.registerCustomErrorIfMVar (e : Lean.Expr) (ref : Lean.Syntax) (msgData : Lean.MessageData) : Lean.Elab.TermElabM Unit

def Lean.Elab.Term.registerMVarArgName (mvarId : Lean.MVarId) (argName : Lean.Name) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.throwMVarError {α : Type} (m : Lean.MessageData) : Lean.Elab.TermElabM α

Auxiliary method for reporting errors of the form "... contains metavariables ...". This kind of error is thrown, for example, at Match.lean where elaboration cannot continue if there are metavariables in patterns. We only want to log it if we haven't logged any errors so far.

Equations

• Lean.Elab.Term.throwMVarError m = do let __do_lift ← Lean.MonadLog.hasErrors if __do_lift = true then Lean.Elab.throwAbortTerm else Lean.throwError m

def Lean.Elab.Term.MVarErrorInfo.logError (mvarErrorInfo : Lean.Elab.Term.MVarErrorInfo) (extraMsg? : Option Lean.MessageData) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.MVarErrorInfo.logError.addArgName (mvarErrorInfo : Lean.Elab.Term.MVarErrorInfo) (msg : Lean.MessageData) (extra : String := "") : Lean.Elab.TermElabM Lean.MessageData

Append the argument name (if available) to the message. Remark: if the argument name contains macro scopes we do not append it.

Equations

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

def Lean.Elab.Term.MVarErrorInfo.logError.appendExtra (extraMsg? : Option Lean.MessageData) (msg : Lean.MessageData) : Lean.MessageData

def Lean.Elab.Term.logUnassignedUsingErrorInfos (pendingMVarIds : Array Lean.MVarId) (extraMsg? : Option Lean.MessageData := none) : Lean.Elab.TermElabM Bool

Try to log errors for the unassigned metavariables pendingMVarIds.

Return true if there were "unfilled holes", and we should "abort" declaration. TODO: try to fill "all" holes using synthetic "sorry's"

Remark: We only log the "unfilled holes" as new errors if no error has been logged so far.

Equations

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

def Lean.Elab.Term.registerLevelMVarErrorInfo (levelMVarErrorInfo : Lean.Elab.Term.LevelMVarErrorInfo) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.registerLevelMVarErrorExprInfo (expr : Lean.Expr) (ref : Lean.Syntax) (msgData? : Option Lean.MessageData := none) : Lean.Elab.TermElabM Unit

def Lean.Elab.Term.exposeLevelMVars (e : Lean.Expr) : Lean.MetaM Lean.Expr

def Lean.Elab.Term.LevelMVarErrorInfo.logError (levelMVarErrorInfo : Lean.Elab.Term.LevelMVarErrorInfo) : Lean.Elab.TermElabM Unit

Equations

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

def Lean.Elab.Term.logUnassignedLevelMVarsUsingErrorInfos (pendingLevelMVarIds : Array Lean.LMVarId) : Lean.Elab.TermElabM Bool

Try to log errors for unassigned level metavariables pendingLevelMVarIds.

Returns true if there are any relevant LevelMVarErrorInfos and we should "abort" the declaration.

Remark: we only log unassigned level metavariables as new errors if no error has been logged so far.

def Lean.Elab.Term.ensureNoUnassignedMVars (decl : Lean.Declaration) : Lean.Elab.TermElabM Unit

Ensure metavariables registered using registerMVarErrorInfos (and used in the given declaration) have been assigned.

def Lean.Elab.Term.withoutPostponing {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x without allowing it to postpone elaboration tasks. That is, tryPostpone is a noop.

Equations

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

def Lean.Elab.Term.mkExplicitBinder (ident type : Lean.Syntax) : Lean.Syntax

Creates syntax for ( <ident> : <type> )

def Lean.Elab.Term.levelMVarToParam (e : Lean.Expr) (except : Lean.LMVarId → Bool := fun (x : Lean.LMVarId) => false) : Lean.Elab.TermElabM Lean.Expr

Convert unassigned universe level metavariables into parameters. The new parameter names are fresh names of the form u_i with regard to ctx.levelNames, which is updated with the new names.

def Lean.Elab.Term.mkFreshBinderName {m : Type → Type} [Monad m] [Lean.MonadQuotation m] : m Lean.Name

Auxiliary method for creating fresh binder names. Do not confuse with the method for creating fresh free/meta variable ids.

Equations

• Lean.Elab.Term.mkFreshBinderName = Lean.withFreshMacroScope (Lean.MonadQuotation.addMacroScope `x)

def Lean.Elab.Term.mkFreshIdent {m : Type → Type} [Monad m] [Lean.MonadQuotation m] (ref : Lean.Syntax) (canonical : Bool := false) : m Lean.Ident

Auxiliary method for creating a Syntax.ident containing a fresh name. This method is intended for creating fresh binder names. It is just a thin layer on top of mkFreshUserName.

def Lean.Elab.Term.applyAttributesAt (declName : Lean.Name) (attrs : Array Lean.Elab.Attribute) (applicationTime : Lean.AttributeApplicationTime) : Lean.Elab.TermElabM Unit

Apply given attributes at a given application time

Equations

• Lean.Elab.Term.applyAttributesAt declName attrs applicationTime = Lean.Elab.Term.applyAttributesCore✝ declName attrs (some applicationTime)

def Lean.Elab.Term.applyAttributes (declName : Lean.Name) (attrs : Array Lean.Elab.Attribute) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.applyAttributes declName attrs = Lean.Elab.Term.applyAttributesCore✝ declName attrs none

def Lean.Elab.Term.mkTypeMismatchError (header? : Option Lean.MessageData) (e eType expectedType : Lean.Expr) : Lean.MetaM Lean.MessageData

def Lean.Elab.Term.throwTypeMismatchError {α : Type} (header? : Option Lean.MessageData) (expectedType eType e : Lean.Expr) (f? : Option Lean.Expr := none) (_extraMsg? : Option Lean.MessageData := none) : Lean.MetaM α

def Lean.Elab.Term.withoutMacroStackAtErr {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

@[reducible, inline]

abbrev Lean.Elab.Term.ContainsPendingMVar.M (α : Type) : Type

Equations

• Lean.Elab.Term.ContainsPendingMVar.M = Lean.MonadCacheT Lean.Expr Unit (OptionT Lean.MetaM)

partial def Lean.Elab.Term.ContainsPendingMVar.visit (e : Lean.Expr) : Lean.Elab.Term.ContainsPendingMVar.M Unit

See containsPostponedTerm

def Lean.Elab.Term.containsPendingMVar (e : Lean.Expr) : Lean.MetaM Bool

Return true if e contains a pending metavariable. Remark: it also visits let-declarations.

Equations

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

def Lean.Elab.Term.synthesizeInstMVarCore (instMVar : Lean.MVarId) (maxResultSize? : Option Nat := none) (extraErrorMsg? : Option Lean.MessageData := none) : Lean.Elab.TermElabM Bool

Try to synthesize metavariable using type class resolution. This method assumes the local context and local instances of instMVar coincide with the current local context and local instances. Return true if the instance was synthesized successfully, and false if the instance contains unassigned metavariables that are blocking the type class resolution procedure. Throw an exception if resolution or assignment irrevocably fails.

If extraErrorMsg? is not none, it contains additional information that should be attached to type class synthesis failures.

Equations

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

def Lean.Elab.Term.mkCoe (expectedType e : Lean.Expr) (f? : Option Lean.Expr := none) (errorMsgHeader? : Option String := none) (mkErrorMsg? : Option (Lean.MVarId → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) := none) (mkImmedErrorMsg? : Option (Option Lean.MessageData → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) := none) : Lean.Elab.TermElabM Lean.Expr

def Lean.Elab.Term.mkCoeWithErrorMsgs (expectedType e : Lean.Expr) (mkImmedErrorMsg : Option Lean.MessageData → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) (mkErrorMsg : Lean.MVarId → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) : Lean.Elab.TermElabM Lean.Expr

Equations

• Lean.Elab.Term.mkCoeWithErrorMsgs expectedType e mkImmedErrorMsg mkErrorMsg = Lean.Elab.Term.mkCoe expectedType e none none (some mkErrorMsg) (some mkImmedErrorMsg)

def Lean.Elab.Term.ensureHasType (expectedType? : Option Lean.Expr) (e : Lean.Expr) (errorMsgHeader? : Option String := none) (f? : Option Lean.Expr := none) : Lean.Elab.TermElabM Lean.Expr

If expectedType? is some t, then ensures t and eType are definitionally equal by inserting a coercion if necessary.

Argument f? is used only for generating error messages when inserting coercions fails.

def Lean.Elab.Term.ensureHasTypeWithErrorMsgs (expectedType? : Option Lean.Expr) (e : Lean.Expr) (mkImmedErrorMsg : Option Lean.MessageData → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) (mkErrorMsg : Lean.MVarId → Lean.Expr → Lean.Expr → Lean.MetaM Lean.MessageData) : Lean.Elab.TermElabM Lean.Expr

Equations

• One or more equations did not get rendered due to their size.
• Lean.Elab.Term.ensureHasTypeWithErrorMsgs expectedType? e mkImmedErrorMsg mkErrorMsg = pure e

def Lean.Elab.Term.exceptionToSorry (ex : Lean.Exception) (expectedType? : Option Lean.Expr) : Lean.Elab.TermElabM Lean.Expr

Log the given exception, and create a synthetic sorry for representing the failed elaboration step with exception ex.

Equations

• Lean.Elab.Term.exceptionToSorry ex expectedType? = do let syntheticSorry ← Lean.Elab.Term.mkSyntheticSorryFor✝ expectedType? Lean.Elab.logException ex pure syntheticSorry

def Lean.Elab.Term.tryPostpone : Lean.Elab.TermElabM Unit

If mayPostpone == true, throw Exception.postpone.

Equations

• Lean.Elab.Term.tryPostpone = do let __do_lift ← read if __do_lift.mayPostpone = true then Lean.Elab.throwPostpone else pure PUnit.unit

def Lean.Elab.Term.isMVarApp (e : Lean.Expr) : Lean.Elab.TermElabM Bool

Return true if e reduces (by unfolding only [reducible] declarations) to ?m ...

Equations

• Lean.Elab.Term.isMVarApp e = do let __do_lift ← liftM (Lean.Meta.whnfR e) pure __do_lift.getAppFn.isMVar

def Lean.Elab.Term.tryPostponeIfMVar (e : Lean.Expr) : Lean.Elab.TermElabM Unit

If mayPostpone == true and e's head is a metavariable, throw Exception.postpone.

def Lean.Elab.Term.tryPostponeIfNoneOrMVar (e? : Option Lean.Expr) : Lean.Elab.TermElabM Unit

If e? = some e, then tryPostponeIfMVar e, otherwise it is just tryPostpone.

def Lean.Elab.Term.tryPostponeIfHasMVars? (expectedType? : Option Lean.Expr) : Lean.Elab.TermElabM (Option Lean.Expr)

Throws Exception.postpone, if expectedType? contains unassigned metavariables. It is a noop if mayPostpone == false.

Equations

• One or more equations did not get rendered due to their size.
• Lean.Elab.Term.tryPostponeIfHasMVars? expectedType? = do Lean.Elab.Term.tryPostponeIfNoneOrMVar expectedType? pure none

def Lean.Elab.Term.tryPostponeIfHasMVars (expectedType? : Option Lean.Expr) (msg : String) : Lean.Elab.TermElabM Lean.Expr

Throws Exception.postpone, if expectedType? contains unassigned metavariables. If mayPostpone == false, it throws error msg.

Equations

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

def Lean.Elab.Term.withExpectedType (expectedType? : Option Lean.Expr) (x : Lean.Expr → Lean.Elab.TermElabM Lean.Expr) : Lean.Elab.TermElabM Lean.Expr

def Lean.Elab.Term.saveContext : Lean.Elab.TermElabM Lean.Elab.Term.SavedContext

Save relevant context for term elaboration postponement.

def Lean.Elab.Term.withSavedContext {α : Type} (savedCtx : Lean.Elab.Term.SavedContext) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x with the context saved using saveContext.

def Lean.Elab.Term.getSyntheticMVarDecl? (mvarId : Lean.MVarId) : Lean.Elab.TermElabM (Option Lean.Elab.Term.SyntheticMVarDecl)

Equations

• Lean.Elab.Term.getSyntheticMVarDecl? mvarId = do let __do_lift ← get pure (Lean.RBMap.find? __do_lift.syntheticMVars mvarId)

opaque Lean.Elab.Term.debug.byAsSorry : Lean.Option Bool

def Lean.Elab.Term.mkTacticMVar (type : Lean.Expr) (tacticCode : Lean.Syntax) (kind : Lean.Elab.Term.TacticMVarKind) : Lean.Elab.TermElabM Lean.Expr

Creates a new metavariable of type type that will be synthesized using the tactic code. The tacticCode syntax is the full by .. syntax.

Equations

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

def Lean.Elab.Term.mkSaveInfoAnnotation (e : Lean.Expr) : Lean.Expr

Create an auxiliary annotation to make sure we create an Info even if e is a metavariable. See mkTermInfo.

We use this function because some elaboration functions elaborate subterms that may not be immediately part of the resulting term. Example:

let_mvar% ?m := b; wait_if_type_mvar% ?m; body

If the type of b is not known, then wait_if_type_mvar% ?m; body is postponed and just returns a fresh metavariable ?n. The elaborator for

let_mvar% ?m := b; wait_if_type_mvar% ?m; body

returns mkSaveInfoAnnotation ?n to make sure the info nodes created when elaborating b are "saved". This is a bit hackish, but elaborators like let_mvar% are rare.

Equations

• Lean.Elab.Term.mkSaveInfoAnnotation e = if e.isMVar = true then Lean.mkAnnotation `save_info e else e

def Lean.Elab.Term.isSaveInfoAnnotation? (e : Lean.Expr) : Option Lean.Expr

Equations

• Lean.Elab.Term.isSaveInfoAnnotation? e = Lean.annotation? `save_info e

partial def Lean.Elab.Term.removeSaveInfoAnnotation (e : Lean.Expr) : Lean.Expr

def Lean.Elab.Term.isTacticOrPostponedHole? (e : Lean.Expr) : Lean.Elab.TermElabM (Option Lean.MVarId)

Return some mvarId if e corresponds to a hole that is going to be filled "later" by executing a tactic or resuming elaboration.

We do not save ofTermInfo for this kind of node in the InfoTree.

Equations

• One or more equations did not get rendered due to their size.
• Lean.Elab.Term.isTacticOrPostponedHole? e = pure none

def Lean.Elab.Term.mkTermInfo (elaborator : Lean.Name) (stx : Lean.Syntax) (e : Lean.Expr) (expectedType? : Option Lean.Expr := none) (lctx? : Option Lean.LocalContext := none) (isBinder : Bool := false) : Lean.Elab.TermElabM (Lean.Elab.Info ⊕ Lean.MVarId)

Equations

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

def Lean.Elab.Term.mkPartialTermInfo (elaborator : Lean.Name) (stx : Lean.Syntax) (expectedType? : Option Lean.Expr := none) (lctx? : Option Lean.LocalContext := none) : Lean.Elab.TermElabM Lean.Elab.Info

Equations

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

def Lean.Elab.Term.addTermInfo (stx : Lean.Syntax) (e : Lean.Expr) (expectedType? : Option Lean.Expr := none) (lctx? : Option Lean.LocalContext := none) (elaborator : Lean.Name := Lean.Name.anonymous) (isBinder force : Bool := false) : Lean.Elab.TermElabM Lean.Expr

Pushes a new leaf node to the info tree associating the expression e to the syntax stx. As a result, when the user hovers over stx they will see the type of e, and if e is a constant they will see the constant's doc string.

• expectedType?: the expected type of e at the point of elaboration, if available
• lctx?: the local context in which to interpret e (otherwise it will use ← getLCtx)
• elaborator: a declaration name used as an alternative target for go-to-definition
• isBinder: if true, this will be treated as defining e (which should be a local constant) for the purpose of go-to-definition on local variables
• force: In patterns, the effect of addTermInfo is usually suppressed and replaced by a patternWithRef? annotation which will be turned into a term info on the post-match-elaboration expression. This flag overrides that behavior and adds the term info immediately. (See https://github.com/leanprover/lean4/pull/1664.)

def Lean.Elab.Term.addTermInfo' (stx : Lean.Syntax) (e : Lean.Expr) (expectedType? : Option Lean.Expr := none) (lctx? : Option Lean.LocalContext := none) (elaborator : Lean.Name := Lean.Name.anonymous) (isBinder : Bool := false) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.addTermInfo' stx e expectedType? lctx? elaborator isBinder = discard (Lean.Elab.Term.addTermInfo stx e expectedType? lctx? elaborator isBinder)

def Lean.Elab.Term.withInfoContext' (stx : Lean.Syntax) (x : Lean.Elab.TermElabM Lean.Expr) (mkInfo : Lean.Expr → Lean.Elab.TermElabM (Lean.Elab.Info ⊕ Lean.MVarId)) (mkInfoOnError : Lean.Elab.TermElabM Lean.Elab.Info) : Lean.Elab.TermElabM Lean.Expr

Equations

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

structure Lean.Elab.Term.BodyInfo : Type

Info node capturing def/let rec bodies, used by the unused variables linter.

• value? : Option Lean.Expr

  The body as a fully elaborated term. none if the body failed to elaborate.

instance Lean.Elab.Term.instTypeNameBodyInfo : TypeName Lean.Elab.Term.BodyInfo

Equations

• Lean.Elab.Term.instTypeNameBodyInfo = Lean.Elab.Term.inst✝

def Lean.Elab.Term.mkBodyInfo (stx : Lean.Syntax) (value? : Option Lean.Expr) : Lean.Elab.Info

Creates an Info.ofCustomInfo node backed by a BodyInfo.

def Lean.Elab.Term.getBodyInfo? : Lean.Elab.Info → Option Lean.Elab.Term.BodyInfo

Extracts a BodyInfo custom info.

def Lean.Elab.Term.withTermInfoContext' (elaborator : Lean.Name) (stx : Lean.Syntax) (x : Lean.Elab.TermElabM Lean.Expr) (expectedType? : Option Lean.Expr := none) (lctx? : Option Lean.LocalContext := none) (isBinder : Bool := false) : Lean.Elab.TermElabM Lean.Expr

Equations

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

def Lean.Elab.Term.postponeElabTerm (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) : Lean.Elab.TermElabM Lean.Expr

Postpone the elaboration of stx, return a metavariable that acts as a placeholder, and ensures the info tree is updated and a hole id is introduced. When stx is elaborated, new info nodes are created and attached to the new hole id in the info tree.

Equations

• Lean.Elab.Term.postponeElabTerm stx expectedType? = Lean.Elab.Term.withTermInfoContext' Lean.Name.anonymous stx (Lean.Elab.Term.postponeElabTermCore✝ stx expectedType?) expectedType?

instance Lean.Elab.Term.instMonadMacroAdapterTermElabM : Lean.Elab.MonadMacroAdapter Lean.Elab.TermElabM

Equations

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

def Lean.Elab.Term.hasNoImplicitLambdaAnnotation (type : Lean.Expr) : Bool

def Lean.Elab.Term.mkNoImplicitLambdaAnnotation (type : Lean.Expr) : Lean.Expr

def Lean.Elab.Term.blockImplicitLambda (stx : Lean.Syntax) : Bool

Block usage of implicit lambdas if stx is @f or @f arg1 ... or fun with an implicit binder annotation.

Equations

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

def Lean.Elab.Term.resolveLocalName (n : Lean.Name) : Lean.Elab.TermElabM (Option (Lean.Expr × List String))

def Lean.Elab.Term.resolveLocalName.go (localDecl : Lean.LocalDecl) (givenNameView : Lean.MacroScopesView) (fullDeclName ns : Lean.Name) : Option Lean.LocalDecl

def Lean.Elab.Term.resolveLocalName.loop (view : Lean.MacroScopesView) (findLocalDecl? : Lean.MacroScopesView → Bool → Option Lean.LocalDecl) (n : Lean.Name) (projs : List String) (globalDeclFound : Bool) : Lean.Elab.TermElabM (Option (Lean.Expr × List String))

Equations

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

def Lean.Elab.Term.isLocalIdent? (stx : Lean.Syntax) : Lean.Elab.TermElabM (Option Lean.Expr)

Return true iff stx is a Syntax.ident, and it is a local variable.

Equations

• One or more equations did not get rendered due to their size.
• Lean.Elab.Term.isLocalIdent? stx = pure none

inductive Lean.Elab.Term.UseImplicitLambdaResult : Type

• no: Lean.Elab.Term.UseImplicitLambdaResult
• yes: Lean.Expr → Lean.Elab.Term.UseImplicitLambdaResult
• postpone: Lean.Elab.Term.UseImplicitLambdaResult

def Lean.Elab.Term.addDotCompletionInfo (stx : Lean.Syntax) (e : Lean.Expr) (expectedType? : Option Lean.Expr) : Lean.Elab.TermElabM Unit

Store in the InfoTree that e is a "dot"-completion target. stx should cover the entire term.

def Lean.Elab.Term.elabTerm (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) (catchExPostpone implicitLambda : Bool := true) : Lean.Elab.TermElabM Lean.Expr

Main function for elaborating terms. It extracts the elaboration methods from the environment using the node kind. Recall that the environment has a mapping from SyntaxNodeKind to TermElab methods. It creates a fresh macro scope for executing the elaboration method. All unlogged trace messages produced by the elaboration method are logged using the position information at stx. If the elaboration method throws an Exception.error and errToSorry == true, the error is logged and a synthetic sorry expression is returned. If the elaboration throws Exception.postpone and catchExPostpone == true, a new synthetic metavariable of kind SyntheticMVarKind.postponed is created, registered, and returned. The option catchExPostpone == false is used to implement resumeElabTerm to prevent the creation of another synthetic metavariable when resuming the elaboration.

If implicitLambda == false, then disable implicit lambdas feature for the given syntax, but not for its subterms. We use this flag to implement, for example, the @ modifier. If Context.implicitLambda == false, then this parameter has no effect.

Equations

• Lean.Elab.Term.elabTerm stx expectedType? catchExPostpone implicitLambda = Lean.withRef stx (Lean.Elab.Term.elabTermAux✝ expectedType? catchExPostpone implicitLambda stx)

def Lean.Elab.Term.elabTermEnsuringType (stx : Lean.Syntax) (expectedType? : Option Lean.Expr) (catchExPostpone implicitLambda : Bool := true) (errorMsgHeader? : Option String := none) : Lean.Elab.TermElabM Lean.Expr

Similar to Lean.Elab.Term.elabTerm, but ensures that the type of the elaborated term is expectedType? by inserting coercions if necessary.

If errToSorry is true, then if coercion insertion fails, this function returns sorry and logs the error. Otherwise, it throws the error.

def Lean.Elab.Term.commitIfNoErrors? {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM (Option α)

Execute x and return some if no new errors were recorded or exceptions were thrown. Otherwise, return none.

Equations

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

def Lean.Elab.Term.adaptExpander (exp : Lean.Syntax → Lean.Elab.TermElabM Lean.Syntax) : Lean.Elab.Term.TermElab

Adapt a syntax transformation to a regular, term-producing elaborator.

def Lean.Elab.Term.mkInstMVar (type : Lean.Expr) (extraErrorMsg? : Option Lean.MessageData := none) : Lean.Elab.TermElabM Lean.Expr

Create a new metavariable with the given type, and try to synthesize it. If type class resolution cannot be executed (e.g., it is stuck because of metavariables in type), register metavariable as a pending one.

def Lean.Elab.Term.ensureType (e : Lean.Expr) : Lean.Elab.TermElabM Lean.Expr

Make sure e is a type by inferring its type and making sure it is an Expr.sort or is unifiable with Expr.sort, or can be coerced into one.

def Lean.Elab.Term.elabType (stx : Lean.Syntax) : Lean.Elab.TermElabM Lean.Expr

Elaborate stx and ensure result is a type.

def Lean.Elab.Term.withAutoBoundImplicit {α : Type} (k : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Enable auto-bound implicits, and execute k while catching auto bound implicit exceptions. When an exception is caught, a new local declaration is created, registered, and k is tried to be executed again.

partial def Lean.Elab.Term.withAutoBoundImplicit.loop {α : Type} (k : Lean.Elab.TermElabM α) (s : Lean.Elab.Term.SavedState) : Lean.Elab.TermElabM α

def Lean.Elab.Term.withoutAutoBoundImplicit {α : Type} (k : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

def Lean.Elab.Term.withAutoBoundImplicitForbiddenPred {α : Type} (p : Lean.Name → Bool) (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Equations

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

def Lean.Elab.Term.collectUnassignedMVars (type : Lean.Expr) (init : Array Lean.Expr := #[]) (except : Lean.MVarId → Bool := fun (x : Lean.MVarId) => false) : Lean.Elab.TermElabM (Array Lean.Expr)

Collect unassigned metavariables in type that are not already in init and not satisfying except.

partial def Lean.Elab.Term.collectUnassignedMVars.go (except : Lean.MVarId → Bool := fun (x : Lean.MVarId) => false) (mvarIds : List Lean.MVarId) (result visited : Array Lean.Expr) : Lean.Elab.TermElabM (Array Lean.Expr)

def Lean.Elab.Term.addAutoBoundImplicits (xs : Array Lean.Expr) : Lean.Elab.TermElabM (Array Lean.Expr)

Return autoBoundImplicits ++ xs This method throws an error if a variable in autoBoundImplicits depends on some x in xs. The autoBoundImplicits may contain free variables created by the auto-implicit feature, and unassigned free variables. It avoids the hack used at autoBoundImplicitsOld.

Remark: we cannot simply replace every occurrence of addAutoBoundImplicitsOld with this one because a particular use-case may not be able to handle the metavariables in the array being given to k.

Equations

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

def Lean.Elab.Term.addAutoBoundImplicits.go (xs : Array Lean.Expr) (todo : List Lean.Expr) (autos : Array Lean.Expr) : Lean.Elab.TermElabM (Array Lean.Expr)

def Lean.Elab.Term.addAutoBoundImplicits' {α : Type} (xs : Array Lean.Expr) (type : Lean.Expr) (k : Array Lean.Expr → Lean.Expr → Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Similar to autoBoundImplicits, but immediately if the resulting array of expressions contains metavariables, it immediately uses mkForallFVars + forallBoundedTelescope to convert them into free variables. The type type is modified during the process if type depends on xs. We use this method to simplify the conversion of code using autoBoundImplicitsOld to autoBoundImplicits.

Equations

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

def Lean.Elab.Term.mkAuxName (suffix : Lean.Name) : Lean.Elab.TermElabM Lean.Name

def Lean.Elab.Term.isLetRecAuxMVar (mvarId : Lean.MVarId) : Lean.Elab.TermElabM Bool

Return true if mvarId is an auxiliary metavariable created for compiling let rec or it is delayed assigned to one.

Equations

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

def Lean.Elab.Term.mkConst (constName : Lean.Name) (explicitLevels : List Lean.Level := []) (checkDeprecated : Bool := true) : Lean.Elab.TermElabM Lean.Expr

Create an Expr.const using the given name and explicit levels. Remark: fresh universe metavariables are created if the constant has more universe parameters than explicitLevels.

If checkDeprecated := true, then Linter.checkDeprecated is invoked.

def Lean.Elab.Term.checkDeprecated (ref : Lean.Syntax) (e : Lean.Expr) : Lean.Elab.TermElabM Unit

Equations

• Lean.Elab.Term.checkDeprecated ref e = match e.getAppFn with | Lean.Expr.const declName us => Lean.withRef ref (Lean.Linter.checkDeprecated declName) | x => pure PUnit.unit

def Lean.Elab.Term.resolveName (stx : Lean.Syntax) (n : Lean.Name) (preresolved : List Lean.Syntax.Preresolved) (explicitLevels : List Lean.Level) (expectedType? : Option Lean.Expr := none) : Lean.Elab.TermElabM (List (Lean.Expr × List String))

def Lean.Elab.Term.resolveName.process (n : Lean.Name) (explicitLevels : List Lean.Level) (candidates : List (Lean.Name × List String)) : Lean.Elab.TermElabM (List (Lean.Expr × List String))

def Lean.Elab.Term.resolveName' (ident : Lean.Syntax) (explicitLevels : List Lean.Level) (expectedType? : Option Lean.Expr := none) : Lean.Elab.TermElabM (List (Lean.Expr × Lean.Syntax × List Lean.Syntax))

Similar to resolveName, but creates identifiers for the main part and each projection with position information derived from ident. Example: Assume resolveName v.head.bla.boo produces (v.head, ["bla", "boo"]), then this method produces (v.head, id, [f₁, f₂]) where id is an identifier for v.head, and f₁ and f₂ are identifiers for fields "bla" and "boo".

Equations

• One or more equations did not get rendered due to their size.
• Lean.Elab.Term.resolveName' ident explicitLevels expectedType? = Lean.throwError (Lean.toMessageData "identifier expected")

def Lean.Elab.Term.resolveId? (stx : Lean.Syntax) (kind : String := "term") (withInfo : Bool := false) : Lean.Elab.TermElabM (Option Lean.Expr)

def Lean.Elab.Term.TermElabM.run {α : Type} (x : Lean.Elab.TermElabM α) (ctx : Lean.Elab.Term.Context := { declName? := none, auxDeclToFullName := ∅, macroStack := [], mayPostpone := true, errToSorry := true, autoBoundImplicit := false, autoBoundImplicits := { root := Lean.PersistentArrayNode.node (Array.mkEmpty Lean.PersistentArray.branching.toNat), tail := Array.mkEmpty Lean.PersistentArray.branching.toNat, size := 0, shift := Lean.PersistentArray.initShift, tailOff := 0 }, autoBoundImplicitForbidden := fun (x : Lean.Name) => false, sectionVars := ∅, sectionFVars := ∅, implicitLambda := true, heedElabAsElim := true, isNoncomputableSection := false, ignoreTCFailures := false, inPattern := false, tacticCache? := none, tacSnap? := none, saveRecAppSyntax := true, holesAsSyntheticOpaque := false }) (s : Lean.Elab.Term.State := { levelNames := [], syntheticMVars := ∅, pendingMVars := ∅, mvarErrorInfos := [], levelMVarErrorInfos := [], mvarArgNames := ∅, letRecsToLift := [] }) : Lean.MetaM (α × Lean.Elab.Term.State)

@[inline]

def Lean.Elab.Term.TermElabM.run' {α : Type} (x : Lean.Elab.TermElabM α) (ctx : Lean.Elab.Term.Context := { declName? := none, auxDeclToFullName := ∅, macroStack := [], mayPostpone := true, errToSorry := true, autoBoundImplicit := false, autoBoundImplicits := { root := Lean.PersistentArrayNode.node (Array.mkEmpty Lean.PersistentArray.branching.toNat), tail := Array.mkEmpty Lean.PersistentArray.branching.toNat, size := 0, shift := Lean.PersistentArray.initShift, tailOff := 0 }, autoBoundImplicitForbidden := fun (x : Lean.Name) => false, sectionVars := ∅, sectionFVars := ∅, implicitLambda := true, heedElabAsElim := true, isNoncomputableSection := false, ignoreTCFailures := false, inPattern := false, tacticCache? := none, tacSnap? := none, saveRecAppSyntax := true, holesAsSyntheticOpaque := false }) (s : Lean.Elab.Term.State := { levelNames := [], syntheticMVars := ∅, pendingMVars := ∅, mvarErrorInfos := [], levelMVarErrorInfos := [], mvarArgNames := ∅, letRecsToLift := [] }) : Lean.MetaM α

def Lean.Elab.Term.TermElabM.toIO {α : Type} (x : Lean.Elab.TermElabM α) (ctxCore : Lean.Core.Context) (sCore : Lean.Core.State) (ctxMeta : Lean.Meta.Context) (sMeta : Lean.Meta.State) (ctx : Lean.Elab.Term.Context) (s : Lean.Elab.Term.State) : IO (α × Lean.Core.State × Lean.Meta.State × Lean.Elab.Term.State)

def Lean.Elab.Term.universeConstraintsCheckpoint {α : Type} (x : Lean.Elab.TermElabM α) : Lean.Elab.TermElabM α

Execute x and then tries to solve pending universe constraints. Note that, stuck constraints will not be discarded.

def Lean.Elab.Term.expandDeclId (currNamespace : Lean.Name) (currLevelNames : List Lean.Name) (declId : Lean.Syntax) (modifiers : Lean.Elab.Modifiers) : Lean.Elab.TermElabM Lean.Elab.ExpandDeclIdResult

def Lean.Elab.Term.exprToSyntax (e : Lean.Expr) : Lean.Elab.TermElabM Lean.Term

Helper function for "embedding" an Expr in Syntax. It creates a named hole ?m and immediately assigns e to it. Examples:

let e := mkConst ``Nat.zero
`(Nat.succ $(← exprToSyntax e))

Equations

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

def Lean.Elab.withoutModifyingStateWithInfoAndMessages {m : Type → Type u_1} {α : Type} [MonadControlT Lean.Elab.TermElabM m] [Monad m] (x : m α) : m α

opaque Lean.Elab.incrementalAttr : Lean.TagAttribute

opaque Lean.Elab.builtinIncrementalElabs : IO.Ref Lean.NameSet

def Lean.Elab.addBuiltinIncrementalElab (decl : Lean.Name) : IO Unit

def Lean.Elab.isIncrementalElab {m : Type → Type} [Monad m] [Lean.MonadEnv m] [MonadLiftT IO m] (decl : Lean.Name) : m Bool

Checks whether a declaration is annotated with [builtin_incremental] or [incremental].

Equations

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