Lean.Elab.Binders

source

structure Lean.Elab.Term.BinderView :

Type

Auxiliary datatype for elaborating binders.

ref : Lean.Syntax
Position information provider for the Info Tree. We currently do not track binder "macro expansion" steps in the info tree. For example, suppose we expand a _ into a fresh identifier. The fresh identifier has synthetic position since it was not written by the user, and we would not get hover information for the _ because we also don't have this macro expansion step stored in the info tree. Thus, we store the original Syntax in ref, and use it when storing the binder information in the info tree.
Potential better solution: add a binder syntax category, an extensible elabBinder (like we have elabTerm), and perform all macro expansion steps at elabBinder and record them in the infro tree.
id : Lean.Syntax
type : Lean.Syntax
bi : Lean.BinderInfo

Instances For

source

def Lean.Elab.Term.kindOfBinderName (binderName : Lake.Name) :

Lean.LocalDeclKind

Determines the local declaration kind depending on the variable name.

The __x in let __x := 42; body gets kind .implDetail.

Equations

Lean.Elab.Term.kindOfBinderName binderName = if binderName.isImplementationDetail = true then Lean.LocalDeclKind.implDetail else Lean.LocalDeclKind.default

Instances For

source

partial def Lean.Elab.Term.quoteAutoTactic :

Lean.Syntax → Lean.CoreM Lean.Expr

source

def Lean.Elab.Term.declareTacticSyntax (tactic : Lean.Syntax) :

Lean.Elab.TermElabM Lake.Name

Equations

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

Instances For

source

def Lean.Elab.Term.addLocalVarInfo (stx : Lean.Syntax) (fvar : Lean.Expr) :

Lean.Elab.TermElabM Unit

Equations

Lean.Elab.Term.addLocalVarInfo stx fvar = Lean.Elab.Term.addTermInfo' stx fvar none none Lean.Name.anonymous true

Instances For

source

opaque Lean.Elab.Term.checkBinderAnnotations :

Lean.Option Bool

source

def Lean.Elab.Term.elabBindersEx {α : Type} (binders : Array Lean.Syntax) (k : Array (Lean.Syntax × Lean.Expr) → Lean.Elab.TermElabM α) :

Lean.Elab.TermElabM α

Like elabBinders, but also pass syntax node per binder. elabBinders(Ex) automatically adds binder info nodes for the produced fvars, but storing the syntax nodes might be necessary when later adding the same binders back to the local context so that info nodes can manually be added for the new fvars; see MutualDef for an example.

Equations

Lean.Elab.Term.elabBindersEx binders k = Lean.Elab.Term.universeConstraintsCheckpoint (if binders.isEmpty = true then k #[] else Lean.Elab.Term.elabBindersAux binders k)

Instances For

source

def Lean.Elab.Term.elabBinders {α : Type} (binders : Array Lean.Syntax) (k : Array Lean.Expr → Lean.Elab.TermElabM α) :

Lean.Elab.TermElabM α

Elaborate the given binders (i.e., Syntax objects for bracketedBinder), update the local context, set of local instances, reset instance cache (if needed), and then execute k with the updated context. The local context will only be included inside k.

For example, suppose you have binders [(a : α), (b : β a)], then the elaborator will create two new free variables a and b, push these to the context and pass to k #[a,b].

Equations

Lean.Elab.Term.elabBinders binders k = Lean.Elab.Term.elabBindersEx binders fun (fvars : Array (Lean.Syntax × Lean.Expr)) => k (Array.map (fun (x : Lean.Syntax × Lean.Expr) => x.snd) fvars)

Instances For

source

def Lean.Elab.Term.elabBinder {α : Type} (binder : Lean.Syntax) (x : Lean.Expr → Lean.Elab.TermElabM α) :

Lean.Elab.TermElabM α

Same as elabBinder with a single binder.

Equations

Lean.Elab.Term.elabBinder binder x = Lean.Elab.Term.elabBinders #[binder] fun (fvars : Array Lean.Expr) => x fvars[0]!

Instances For

source

def Lean.Elab.Term.expandSimpleBinderWithType (type : Lean.Term) (binder : Lean.Syntax) :

Lean.MacroM Lean.Syntax

If binder is a _ or an identifier, return a bracketedBinder using type otherwise throw an exception.

Equations

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

Instances For

source

def Lean.Elab.Term.expandForall :

Lean.Macro

Equations

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

Instances For

source

def Lean.Elab.Term.elabForall :

Lean.Elab.Term.TermElab

Equations

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

Instances For

source

def Lean.Elab.Term.precheckArrow :

Lean.Elab.Term.Quotation.Precheck

Equations

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

Instances For

source

def Lean.Elab.Term.elabArrow :

Lean.Elab.Term.TermElab

Equations

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

Instances For

source

def Lean.Elab.Term.elabDepArrow :

Lean.Elab.Term.TermElab

The dependent arrow. (x : α) → β is equivalent to ∀ x : α, β, but we usually reserve the latter for propositions. Also written as Π x : α, β (the "Pi-type") in the literature.

Equations

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

Instances For

source

def Lean.Elab.Term.expandFunBinders (binders : Array Lean.Syntax) (body : Lean.Syntax) :

Lean.MacroM (Array Lean.Syntax × Lean.Syntax × Bool)

Auxiliary function for expanding fun notation binders. Recall that fun parser is defined as

def funBinder : Parser := implicitBinder <|> instBinder <|> termParser maxPrec
leading_parser unicodeSymbol "λ" "fun" >> many1 funBinder >> "=>" >> termParser

to allow notation such as fun (a, b) => a + b, where (a, b) should be treated as a pattern. The result is a pair (explicitBinders, newBody), where explicitBinders is syntax of the form

`(` ident `:` term `)`

which can be elaborated using elabBinders, and newBody is the updated body syntax. We update the body syntax when expanding the pattern notation. Example: fun (a, b) => a + b expands into fun _a_1 => match _a_1 with | (a, b) => a + b. See local function processAsPattern at expandFunBindersAux.

The resulting Bool is true if a pattern was found. We use it "mark" a macro expansion.

Equations

Lean.Elab.Term.expandFunBinders binders body = Lean.Elab.Term.expandFunBinders.loop binders body 0 #[]

Instances For

source

partial def Lean.Elab.Term.expandFunBinders.loop (binders : Array Lean.Syntax) (body : Lean.Syntax) (i : Nat) (newBinders : Array Lean.Syntax) :

Lean.MacroM (Array Lean.Syntax × Lean.Syntax × Bool)

source

structure Lean.Elab.Term.FunBinders.State :

Type

fvars : Array Lean.Expr
lctx : Lean.LocalContext
localInsts : Lean.LocalInstances
expectedType? : Option Lean.Expr

Instances For

source

partial def Lean.Elab.Term.FunBinders.elabFunBindersAux (binders : Array Lean.Syntax) (i : Nat) (s : Lean.Elab.Term.FunBinders.State) :

Lean.Elab.TermElabM Lean.Elab.Term.FunBinders.State

source

def Lean.Elab.Term.elabFunBinders {α : Type} (binders : Array Lean.Syntax) (expectedType? : Option Lean.Expr) (x : Array Lean.Expr → Option Lean.Expr → Lean.Elab.TermElabM α) :

Lean.Elab.TermElabM α

Equations

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

Instances For

source

def Lean.Elab.Term.expandWhereDecls (whereDecls : Lean.Syntax) (body : Lean.Syntax) :

Lean.MacroM Lean.Syntax

Equations

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

Instances For

source

def Lean.Elab.Term.expandWhereDeclsOpt (whereDeclsOpt : Lean.Syntax) (body : Lean.Syntax) :

Lean.MacroM Lean.Syntax

Equations

Lean.Elab.Term.expandWhereDeclsOpt whereDeclsOpt body = if whereDeclsOpt.isNone = true then pure body else Lean.Elab.Term.expandWhereDecls whereDeclsOpt[0] body

Instances For

source

def Lean.Elab.Term.expandMatchAltsIntoMatch (ref : Lean.Syntax) (matchAlts : Lean.Syntax) (useExplicit : optParam Bool true) :

Lean.MacroM Lean.Syntax

Expand matchAlts syntax into a full match-expression. Example:

| 0, true => alt_1
| i, _    => alt_2

expands into (for tactic == false)

fun x_1 x_2 =>
match @x_1, @x_2 with
| 0, true => alt_1
| i, _    => alt_2

and (for tactic == true)

intro x_1; intro x_2;
match @x_1, @x_2 with
| 0, true => alt_1
| i, _    => alt_2

If useExplicit = true, we add a @ before fun to disable implicit lambdas. We disable them when processing let and let rec declarations to make sure the behavior is consistent with top-level declarations where we can write

def f : {α : Type} → α → α
  | _, a => a

We use useExplicit = false when we are elaborating the fun | ... => ... | ... notation. See issue #1132. If @fun is used with this notation, the we set useExplicit = true. We also use useExplicit = false when processing instance ... where notation declarations. The motivation is to have compact declarations such as

instance [Alternative m] : MonadLiftT Option m where
monadLift -- We don't want to provide the implicit arguments of `monadLift` here. One should use `monadLift := @fun ...` if they want to provide them.
  | some a => pure a
  | none => failure

Remark: we add @ at discriminants to make sure we don't consume implicit arguments, and to make the behavior consistent with fun. Example:

inductive T : Type 1 :=
| mkT : (forall {a : Type}, a -> a) -> T

def makeT (f : forall {a : Type}, a -> a) : T :=
  mkT f

def makeT' : (forall {a : Type}, a -> a) -> T
| f => mkT f

The two definitions should be elaborated without errors and be equivalent.

Equations

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

Instances For

source

def Lean.Elab.Term.expandMatchAltsIntoMatchTactic (ref : Lean.Syntax) (matchAlts : Lean.Syntax) :

Lean.MacroM Lean.Syntax

Equations

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

Instances For

source

def Lean.Elab.Term.expandMatchAltsWhereDecls (matchAltsWhereDecls : Lean.Syntax) :

Lean.MacroM Lean.Syntax

Similar to expandMatchAltsIntoMatch, but supports an optional where clause.

Expand matchAltsWhereDecls into let rec + match-expression. Example

| 0, true => ... f 0 ...
| i, _    => ... f i + g i ...
where
  f x := g x + 1

  g : Nat → Nat
    | 0   => 1
    | x+1 => f x

expands into

fux x_1 x_2 =>
  let rec
    f x := g x + 1,
    g : Nat → Nat
      | 0   => 1
      | x+1 => f x
  match x_1, x_2 with
  | 0, true => ... f 0 ...
  | i, _    => ... f i + g i ...

Equations

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

Instances For

source

def Lean.Elab.Term.expandMatchAltsWhereDecls.loop (matchAlts : Lean.Syntax) (whereDeclsOpt : Lean.Syntax) (i : Nat) (discrs : Array Lean.Syntax) :

Lean.MacroM Lean.Syntax

Equations

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

Instances For

source

def Lean.Elab.Term.expandFun :

Lean.Macro

Equations

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

Instances For

source

def Lean.Elab.Term.expandExplicitFun :

Lean.Macro

Equations

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

Instances For

source

def Lean.Elab.Term.precheckFun :

Lean.Elab.Term.Quotation.Precheck

Equations

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

Instances For

source

def Lean.Elab.Term.elabFun :

Lean.Elab.Term.TermElab

Equations

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

Instances For

source

def Lean.Elab.Term.elabLetDeclAux (id : Lean.Syntax) (binders : Array Lean.Syntax) (typeStx : Lean.Syntax) (valStx : Lean.Syntax) (body : Lean.Syntax) (expectedType? : Option Lean.Expr) (useLetExpr : Bool) (elabBodyFirst : Bool) (usedLetOnly : Bool) :

Lean.Elab.TermElabM Lean.Expr

If useLetExpr is true, then a kernel let-expression let x : type := val; body is created. Otherwise, we create a term of the form letFun val (fun (x : type) => body)

The default elaboration order is binders, typeStx, valStx, and body. If elabBodyFirst == true, then we use the order binders, typeStx, body, and valStx.

Equations

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

Instances For

source

structure Lean.Elab.Term.LetIdDeclView :

Type

id : Lean.Syntax
binders : Array Lean.Syntax
type : Lean.Syntax
value : Lean.Syntax

Instances For

source

def Lean.Elab.Term.mkLetIdDeclView (letIdDecl : Lean.Syntax) :

Lean.Elab.Term.LetIdDeclView

Equations

Lean.Elab.Term.mkLetIdDeclView letIdDecl = { id := letIdDecl[0], binders := letIdDecl[1].getArgs, type := Lean.Elab.Term.expandOptType letIdDecl[0] letIdDecl[2], value := letIdDecl[4] }