inductive Lean.Literal : Type

• natVal: Nat → Lean.Literal

  Natural number literal

• strVal: String → Lean.Literal

  String literal

Literal values for Expr.

instance Lean.instInhabitedLiteral : Inhabited Lean.Literal

instance Lean.instBEqLiteral : BEq Lean.Literal

instance Lean.instReprLiteral : Repr Lean.Literal

def Lean.Literal.hash : Lean.Literal → UInt64

instance Lean.instHashableLiteral : Hashable Lean.Literal

def Lean.Literal.lt : Lean.Literal → Lean.Literal → Bool

Total order on Expr literal values. Natural number values are smaller than string literal values.

instance Lean.instLTLiteral : LT Lean.Literal

instance Lean.instDecidableLtLiteralInstLTLiteral (a : Lean.Literal) (b : Lean.Literal) : Decidable (a < b)

inductive Lean.BinderInfo : Type

• default: Lean.BinderInfo

  Default binder annotation, e.g. (x : α)

• implicit: Lean.BinderInfo

  Implicit binder annotation, e.g., {x : α}

• strictImplicit: Lean.BinderInfo

  Strict implict binder annotation, e.g., {{ x : α }}

• instImplicit: Lean.BinderInfo

  Local instance binder annotataion, e.g., [Decidable α]

Arguments in forallE binders can be labelled as implicit or explicit.

Each lam or forallE binder comes with a binderInfo argument (stored in ExprData). This can be set to

• default -- (x : α)
• implicit -- {x : α}
• strict_implicit -- ⦃x : α⦄
• inst_implicit -- [x : α].
• aux_decl -- Auxillary definitions are helper methods that Lean generates. aux_decl is used for _match, _fun_match, _let_match and the self reference that appears in recursive pattern matching.

The difference between implicit {} and strict-implicit ⦃⦄ is how implicit arguments are treated that are not followed by explicit arguments. {} arguments are applied eagerly, while ⦃⦄ arguments are left partially applied:

def foo {x : Nat} : Nat := x
def bar ⦃x : Nat⦄ : Nat := x
#check foo -- foo : Nat
#check bar -- bar : ⦃x : Nat⦄ → Nat

See also the Lean manual: https://leanprover.github.io/lean4/doc/expressions.html#implicit-arguments

instance Lean.instInhabitedBinderInfo : Inhabited Lean.BinderInfo

instance Lean.instBEqBinderInfo : BEq Lean.BinderInfo

instance Lean.instReprBinderInfo : Repr Lean.BinderInfo

def Lean.BinderInfo.hash : Lean.BinderInfo → UInt64

def Lean.BinderInfo.isExplicit : Lean.BinderInfo → Bool

Return true if the given BinderInfo does not correspond to an implicit binder annotation (i.e., implicit, strictImplicit, or instImplicit).

instance Lean.instHashableBinderInfo : Hashable Lean.BinderInfo

def Lean.BinderInfo.isInstImplicit : Lean.BinderInfo → Bool

Return true if the given BinderInfo is an instance implicit annotation (e.g., [Decidable α])

def Lean.BinderInfo.isImplicit : Lean.BinderInfo → Bool

Return true if the given BinderInfo is a regular implicit annotation (e.g., {α : Type u})

def Lean.BinderInfo.isStrictImplicit : Lean.BinderInfo → Bool

Return true if the given BinderInfo is a strict implicit annotation (e.g., {{α : Type u}})

@[inline, reducible]

abbrev Lean.MData : Type

Expression metadata. Used with the Expr.mdata constructor.

@[inline, reducible]

abbrev Lean.MData.empty : Lean.MData

def Lean.Expr.Data : Type

Cached hash code, cached results, and other data for Expr.

• hash : 32-bits
• approxDepth : 8-bits -- the approximate depth is used to minimize the number of hash collisions
• hasFVar : 1-bit -- does it contain free variables?
• hasExprMVar : 1-bit -- does it contain metavariables?
• hasLevelMVar : 1-bit -- does it contain level metavariables?
• hasLevelParam : 1-bit -- does it contain level parameters?
• looseBVarRange : 20-bits

Remark: this is mostly an internal datastructure used to implement Expr, most will never have to use it.

instance Lean.instInhabitedData_1 : Inhabited Lean.Expr.Data

def Lean.Expr.Data.hash (c : Lean.Expr.Data) : UInt64

instance Lean.instBEqData_1 : BEq Lean.Expr.Data

def Lean.Expr.Data.approxDepth (c : Lean.Expr.Data) : UInt8

def Lean.Expr.Data.looseBVarRange (c : Lean.Expr.Data) : UInt32

def Lean.Expr.Data.hasFVar (c : Lean.Expr.Data) : Bool

def Lean.Expr.Data.hasExprMVar (c : Lean.Expr.Data) : Bool

def Lean.Expr.Data.hasLevelMVar (c : Lean.Expr.Data) : Bool

def Lean.Expr.Data.hasLevelParam (c : Lean.Expr.Data) : Bool

@[extern lean_uint8_to_uint64]

def Lean.BinderInfo.toUInt64 : Lean.BinderInfo → UInt64

def Lean.Expr.mkData (h : UInt64) (looseBVarRange : optParam Nat 0) (approxDepth : optParam UInt32 0) (hasFVar : optParam Bool false) (hasExprMVar : optParam Bool false) (hasLevelMVar : optParam Bool false) (hasLevelParam : optParam Bool false) : Lean.Expr.Data

@[inline]

def Lean.Expr.mkAppData (fData : Lean.Expr.Data) (aData : Lean.Expr.Data) : Lean.Expr.Data

Optimized version of Expr.mkData for applications.

@[inline]

def Lean.Expr.mkDataForBinder (h : UInt64) (looseBVarRange : Nat) (approxDepth : UInt32) (hasFVar : Bool) (hasExprMVar : Bool) (hasLevelMVar : Bool) (hasLevelParam : Bool) : Lean.Expr.Data

@[inline]

def Lean.Expr.mkDataForLet (h : UInt64) (looseBVarRange : Nat) (approxDepth : UInt32) (hasFVar : Bool) (hasExprMVar : Bool) (hasLevelMVar : Bool) (hasLevelParam : Bool) : Lean.Expr.Data

instance Lean.instReprData_1 : Repr Lean.Expr.Data

structure Lean.FVarId : Type

• name : Lake.Name

The unique free variable identifier. It is just a hierarchical name, but we wrap it in FVarId to make sure they don't get mixed up with MVarId.

This is not the user-facing name for a free variable. This information is stored in the local context (LocalContext). The unique identifiers are generated using a NameGenerator.

instance Lean.instInhabitedFVarId : Inhabited Lean.FVarId

instance Lean.instBEqFVarId : BEq Lean.FVarId

instance Lean.instHashableFVarId : Hashable Lean.FVarId

instance Lean.instReprFVarId : Repr Lean.FVarId

def Lean.FVarIdSet : Type

A set of unique free variable identifiers. This is a persistent data structure implemented using red-black trees.

instance Lean.instForInFVarIdSetFVarId {m : Type u_1 → Type u_2} : ForIn m Lean.FVarIdSet Lean.FVarId

def Lean.FVarIdSet.insert (s : Lean.FVarIdSet) (fvarId : Lean.FVarId) : Lean.FVarIdSet

def Lean.FVarIdHashSet : Type

A set of unique free variable identifiers implemented using hashtables. Hashtables are faster than red-black trees if they are used linearly. They are not persistent data-structures.

def Lean.FVarIdMap (α : Type) : Type

A mapping from free variable identifiers to values of type α. This is a persistent data structure implemented using red-black trees.

def Lean.FVarIdMap.insert {α : Type} (s : Lean.FVarIdMap α) (fvarId : Lean.FVarId) (a : α) : Lean.FVarIdMap α

instance Lean.instEmptyCollectionFVarIdMap {α : Type} : EmptyCollection (Lean.FVarIdMap α)

instance Lean.instInhabitedFVarIdMap {α : Type} : Inhabited (Lean.FVarIdMap α)

structure Lean.MVarId : Type

• name : Lake.Name

Universe metavariable Id

instance Lean.instInhabitedMVarId : Inhabited Lean.MVarId

instance Lean.instBEqMVarId : BEq Lean.MVarId

instance Lean.instHashableMVarId : Hashable Lean.MVarId

instance Lean.instReprMVarId : Repr Lean.MVarId

instance Lean.instReprMVarId_1 : Repr Lean.MVarId

def Lean.MVarIdSet : Type

def Lean.MVarIdSet.insert (s : Lean.MVarIdSet) (mvarId : Lean.MVarId) : Lean.MVarIdSet

instance Lean.instForInMVarIdSetMVarId {m : Type u_1 → Type u_2} : ForIn m Lean.MVarIdSet Lean.MVarId

def Lean.MVarIdMap (α : Type) : Type

def Lean.MVarIdMap.insert {α : Type} (s : Lean.MVarIdMap α) (mvarId : Lean.MVarId) (a : α) : Lean.MVarIdMap α

instance Lean.instEmptyCollectionMVarIdMap {α : Type} : EmptyCollection (Lean.MVarIdMap α)

instance Lean.instForInMVarIdMapProdMVarId {m : Type u_1 → Type u_2} {α : Type} : ForIn m (Lean.MVarIdMap α) (Lean.MVarId × α)

instance Lean.instInhabitedMVarIdMap {α : Type} : Inhabited (Lean.MVarIdMap α)

@[extern lean_expr_data]

noncomputable def Lean.Expr.data : Lean.Expr → Lean.Expr.Data

inductive Lean.Expr : Type

• bvar: Nat → Lean.Expr

  The bvar constructor represents bound variables, i.e. occurrences of a variable in the expression where there is a variable binder above it (i.e. introduced by a lam, forallE, or letE).

  The deBruijnIndex parameter is the de-Bruijn index for the bound variable. See here for additional information on de-Bruijn indexes.

  For example, consider the expression fun x : Nat => forall y : Nat, x = y. The x and y variables in the equality expression are constructed using bvar and bound to the binders introduced by the earlier lam and forallE constructors. Here is the corresponding Expr representation for the same expression:

  .lam `x (.const `Nat [])
    (.forallE `y (.const `Nat [])
      (.app (.app (.app (.const `Eq [.succ .zero]) (.const `Nat [])) (.bvar 1)) (.bvar 0))
      .default)
    .default
  

• fvar: Lean.FVarId → Lean.Expr

  The fvar constructor represent free variables. These /free/ variable occurrences are not bound by an earlier lam, forallE, or letE contructor and its binder exists in a local context only.

  Note that Lean uses the /locally nameless approach/. See here for additional details.

  When "visiting" the body of a binding expression (i.e. lam, forallE, or letE), bound variables are converted into free variables using a unique identifier, and their user-facing name, type, value (for LetE), and binder annotation are stored in the LocalContext.

• mvar: Lean.MVarId → Lean.Expr

  Metavariables are used to represent "holes" in expressions, and goals in the tactic framework. Metavariable declarations are stored in the MetavarContext. Metavariables are used during elaboration, and are not allowed in the kernel, or in the code generator.

• sort: Lean.Level → Lean.Expr

  Used for Type u, Sort u, and Prop:

  • Prop is represented as .sort .zero,
  • Sort u as .sort (.param `u), and
  • Type u as .sort (.succ (.param `u))
• const: Lake.Name → List Lean.Level → Lean.Expr

  A (universe polymorphic) constant that has been defined earlier in the module or by another imported module. For example, @Eq.{1} is represented as Expr.const `Eq [.succ .zero], and @Array.map.{0, 0} is represented as Expr.const `Array.map [.zero, .zero].

• app: Lean.Expr → Lean.Expr → Lean.Expr

  A function application.

  For example, the natural number one, i.e. Nat.succ Nat.zero is represented as Expr.app (.const Nat.succ []) (.const .zero [])` Note that multiple arguments are represented using partial application.

  For example, the two argument application f x y is represented as Expr.app (.app f x) y.

• lam: Lake.Name → Lean.Expr → Lean.Expr → Lean.BinderInfo → Lean.Expr

  A lambda abstraction (aka anonymous functions). It introduces a new binder for variable x in scope for the lambda body.

  For example, the expression fun x : Nat => x is represented as

  Expr.lam `x (.const `Nat []) (.bvar 0) .default
  

• forallE: Lake.Name → Lean.Expr → Lean.Expr → Lean.BinderInfo → Lean.Expr

  A dependent arrow (a : α) → β) (aka forall-expression) where β may dependent on a. Note that this constructor is also used to represent non-dependent arrows where β does not depend on a.

  For example:

  • forall x : Prop, x ∧ x:

  Expr.forallE `x (.sort .zero)
    (.app (.app (.const `And []) (.bvar 0)) (.bvar 0)) .default
  

  • Nat → Bool:

  Expr.forallE `a (.const `Nat [])
    (.const `Bool []) .default
  

• letE: Lake.Name → Lean.Expr → Lean.Expr → Lean.Expr → Bool → Lean.Expr

  Let-expressions.

  IMPORTANT: The nonDep flag is for "local" use only. That is, a module should not "trust" its value for any purpose. In the intended use-case, the compiler will set this flag, and be responsible for maintaining it. Other modules may not preserve its value while applying transformations.

  Given an environment, a metavariable context, and a local context, we say a let-expression let x : t := v; e is non-dependent when it is equivalent to (fun x : t => e) v. Here is an example of a dependent let-expression let n : Nat := 2; fun (a : Array Nat n) (b : Array Nat 2) => a = b is type correct, but (fun (n : Nat) (a : Array Nat n) (b : Array Nat 2) => a = b) 2 is not.

  The let-expression let x : Nat := 2; Nat.succ x is represented as

  Expr.letE `x (.const `Nat []) (.lit (.natVal 2)) (.app (.const `Nat.succ []) (.bvar 0)) true
  

• lit: Lean.Literal → Lean.Expr

  Natural number and string literal values.

  They are not really needed, but provide a more compact representation in memory for these two kinds of literals, and are used to implement efficient reduction in the elaborator and kernel. The "raw" natural number 2 can be represented as Expr.lit (.natVal 2). Note that, it is definitionally equal to:

  Expr.app (.const `Nat.succ []) (.app (.const `Nat.succ []) (.const `Nat.zero []))
  

• mdata: Lean.MData → Lean.Expr → Lean.Expr

  Metadata (aka annotations).

  We use annotations to provide hints to the pretty-printer, store references to Syntax nodes, position information, and save information for elaboration procedures (e.g., we use the inaccessible annotation during elaboration to mark Exprs that correspond to inaccessible patterns).

  Note that Expr.mdata data e is definitionally equal to e.

• proj: Lake.Name → Nat → Lean.Expr → Lean.Expr

  Projection-expressions. They are redundant, but are used to create more compact terms, speedup reduction, and implement eta for structures. The type of struct must be an structure-like inductive type. That is, it has only one constructor, is not recursive, and it is not an inductive predicate. The kernel and elaborators check whether the typeName matches the type of struct, and whether the (zero-based) index is valid (i.e., it is smaller than the numbef of constructor fields). When exporting Lean developments to other systems, proj can be replaced with typeName.rec applications.

  Example, given a : Nat x Bool, a.1 is represented as

  .proj `Prod 0 a
  

Lean expressions. This data structure is used in the kernel and elaborator. However, expressions sent to the kernel should not contain metavariables.

Remark: we use the E suffix (short for Expr) to avoid collision with keywords. We considered using «...», but it is too inconvenient to use.

instance Lean.instInhabitedExpr : Inhabited Lean.Expr

instance Lean.instReprExpr : Repr Lean.Expr

def Lean.Expr.ctorName : Lean.Expr → String

The constructor name for the given expression. This is used for debugging purposes.

def Lean.Expr.hash (e : Lean.Expr) : UInt64

instance Lean.Expr.instHashableExpr : Hashable Lean.Expr

def Lean.Expr.hasFVar (e : Lean.Expr) : Bool

Return true if e contains free variables. This is a constant time operation.

def Lean.Expr.hasExprMVar (e : Lean.Expr) : Bool

Return true if e contains expression metavariables. This is a constant time operation.

def Lean.Expr.hasLevelMVar (e : Lean.Expr) : Bool

Return true if e contains universe (aka Level) metavariables. This is a constant time operation.

def Lean.Expr.hasMVar (e : Lean.Expr) : Bool

Does the expression contain level (aka universe) or expression metavariables? This is a constant time operation.

def Lean.Expr.hasLevelParam (e : Lean.Expr) : Bool

Return true if e contains universe level parameters. This is a constant time operation.

def Lean.Expr.approxDepth (e : Lean.Expr) : UInt32

Return the approximated depth of an expression. This information is used to compute the expression hash code, and speedup comparisons. This is a constant time operation. We say it is approximate because it maxes out at 255.

def Lean.Expr.looseBVarRange (e : Lean.Expr) : Nat

The range of de-Bruijn variables that are loose. That is, bvars that are not bound by a binder. For example, bvar i has range i + 1 and an expression with no loose bvars has range 0.

def Lean.Expr.binderInfo (e : Lean.Expr) : Lean.BinderInfo

Return the binder information if e is a lambda or forall expression, and .default otherwise.

Export functions.

@[export lean_expr_hash]

def Lean.Expr.hashEx : Lean.Expr → UInt64

@[export lean_expr_has_fvar]

def Lean.Expr.hasFVarEx : Lean.Expr → Bool

@[export lean_expr_has_expr_mvar]

def Lean.Expr.hasExprMVarEx : Lean.Expr → Bool

@[export lean_expr_has_level_mvar]

def Lean.Expr.hasLevelMVarEx : Lean.Expr → Bool

@[export lean_expr_has_mvar]

def Lean.Expr.hasMVarEx : Lean.Expr → Bool

@[export lean_expr_has_level_param]

def Lean.Expr.hasLevelParamEx : Lean.Expr → Bool

@[export lean_expr_loose_bvar_range]

def Lean.Expr.looseBVarRangeEx (e : Lean.Expr) : UInt32

@[export lean_expr_binder_info]

def Lean.Expr.binderInfoEx : Lean.Expr → Lean.BinderInfo

def Lean.mkConst (declName : Lake.Name) (us : optParam (List Lean.Level) []) : Lean.Expr

mkConst declName us return .const declName us.

def Lean.Literal.type : Lean.Literal → Lean.Expr

Return the type of a literal value.

@[export lean_lit_type]

def Lean.Literal.typeEx : Lean.Literal → Lean.Expr

def Lean.mkBVar (idx : Nat) : Lean.Expr

.bvar idx is now the preferred form.

def Lean.mkSort (u : Lean.Level) : Lean.Expr

.sort u is now the preferred form.

def Lean.mkFVar (fvarId : Lean.FVarId) : Lean.Expr

.fvar fvarId is now the preferred form. This function is seldom used, free variables are often automatically created using the telescope functions (e.g., forallTelescope and lambdaTelescope) at MetaM.

def Lean.mkMVar (mvarId : Lean.MVarId) : Lean.Expr

.mvar mvarId is now the preferred form. This function is seldom used, metavariables are often created using functions such as mkFresheExprMVar at MetaM.

def Lean.mkMData (m : Lean.MData) (e : Lean.Expr) : Lean.Expr

.mdata m e is now the preferred form.

def Lean.mkProj (structName : Lake.Name) (idx : Nat) (struct : Lean.Expr) : Lean.Expr

.proj structName idx struct is now the preferred form.

def Lean.mkApp (f : Lean.Expr) (a : Lean.Expr) : Lean.Expr

.app f a is now the preferred form.

def Lean.mkLambda (x : Lake.Name) (bi : Lean.BinderInfo) (t : Lean.Expr) (b : Lean.Expr) : Lean.Expr

.lam x t b bi is now the preferred form.

def Lean.mkForall (x : Lake.Name) (bi : Lean.BinderInfo) (t : Lean.Expr) (b : Lean.Expr) : Lean.Expr

.forallE x t b bi is now the preferred form.

def Lean.mkSimpleThunkType (type : Lean.Expr) : Lean.Expr

Return Unit -> type. Do not confuse with Thunk type

def Lean.mkSimpleThunk (type : Lean.Expr) : Lean.Expr

Return fun (_ : Unit), e

def Lean.mkLet (x : Lake.Name) (t : Lean.Expr) (v : Lean.Expr) (b : Lean.Expr) (nonDep : optParam Bool false) : Lean.Expr

.letE x t v b nonDep is now the preferred form.

def Lean.mkAppB (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) : Lean.Expr

def Lean.mkApp2 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) : Lean.Expr

def Lean.mkApp3 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) : Lean.Expr

def Lean.mkApp4 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) : Lean.Expr

def Lean.mkApp5 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e : Lean.Expr) : Lean.Expr

def Lean.mkApp6 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e₁ : Lean.Expr) (e₂ : Lean.Expr) : Lean.Expr

def Lean.mkApp7 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e₁ : Lean.Expr) (e₂ : Lean.Expr) (e₃ : Lean.Expr) : Lean.Expr

def Lean.mkApp8 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e₁ : Lean.Expr) (e₂ : Lean.Expr) (e₃ : Lean.Expr) (e₄ : Lean.Expr) : Lean.Expr

def Lean.mkApp9 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e₁ : Lean.Expr) (e₂ : Lean.Expr) (e₃ : Lean.Expr) (e₄ : Lean.Expr) (e₅ : Lean.Expr) : Lean.Expr

def Lean.mkApp10 (f : Lean.Expr) (a : Lean.Expr) (b : Lean.Expr) (c : Lean.Expr) (d : Lean.Expr) (e₁ : Lean.Expr) (e₂ : Lean.Expr) (e₃ : Lean.Expr) (e₄ : Lean.Expr) (e₅ : Lean.Expr) (e₆ : Lean.Expr) : Lean.Expr

def Lean.mkLit (l : Lean.Literal) : Lean.Expr

.lit l is now the preferred form.

def Lean.mkRawNatLit (n : Nat) : Lean.Expr

Return the "raw" natural number .lit (.natVal n). This is not the default representation used by the Lean frontend. See mkNatLit.

def Lean.mkNatLit (n : Nat) : Lean.Expr

Return a natural number literal used in the frontend. It is a OfNat.ofNat application. Recall that all theorems and definitions containing numeric literals are encoded using OfNat.ofNat applications in the frontend.

def Lean.mkStrLit (s : String) : Lean.Expr

Return the string literal .lit (.strVal s)

@[export lean_expr_mk_bvar]

def Lean.mkBVarEx : Nat → Lean.Expr

@[export lean_expr_mk_fvar]

def Lean.mkFVarEx : Lean.FVarId → Lean.Expr

@[export lean_expr_mk_mvar]

def Lean.mkMVarEx : Lean.MVarId → Lean.Expr

@[export lean_expr_mk_sort]

def Lean.mkSortEx : Lean.Level → Lean.Expr

@[export lean_expr_mk_const]

def Lean.mkConstEx (c : Lake.Name) (lvls : List Lean.Level) : Lean.Expr

@[export lean_expr_mk_app]

def Lean.mkAppEx : Lean.Expr → Lean.Expr → Lean.Expr

@[export lean_expr_mk_lambda]

def Lean.mkLambdaEx (n : Lake.Name) (d : Lean.Expr) (b : Lean.Expr) (bi : Lean.BinderInfo) : Lean.Expr

@[export lean_expr_mk_forall]

def Lean.mkForallEx (n : Lake.Name) (d : Lean.Expr) (b : Lean.Expr) (bi : Lean.BinderInfo) : Lean.Expr

@[export lean_expr_mk_let]

def Lean.mkLetEx (n : Lake.Name) (t : Lean.Expr) (v : Lean.Expr) (b : Lean.Expr) : Lean.Expr

@[export lean_expr_mk_lit]

def Lean.mkLitEx : Lean.Literal → Lean.Expr

@[export lean_expr_mk_mdata]

def Lean.mkMDataEx : Lean.MData → Lean.Expr → Lean.Expr

@[export lean_expr_mk_proj]

def Lean.mkProjEx : Lake.Name → Nat → Lean.Expr → Lean.Expr

def Lean.mkAppN (f : Lean.Expr) (args : Array Lean.Expr) : Lean.Expr

mkAppN f #[a₀, ..., aₙ] ==> f a₀ a₁ .. aₙ

def Lean.mkAppRange (f : Lean.Expr) (i : Nat) (j : Nat) (args : Array Lean.Expr) : Lean.Expr

mkAppRange f i j #[a_1, ..., a_i, ..., a_j, ... ] ==> the expression f a_i ... a_{j-1}

def Lean.mkAppRev (fn : Lean.Expr) (revArgs : Array Lean.Expr) : Lean.Expr

Same as mkApp f args but reversing args.

@[extern lean_expr_dbg_to_string]

opaque Lean.Expr.dbgToString (e : Lean.Expr) : String

@[extern lean_expr_quick_lt]

opaque Lean.Expr.quickLt (a : Lean.Expr) (b : Lean.Expr) : Bool

A total order for expressions. We say it is quick because it first compares the hashcodes.

@[extern lean_expr_lt]

opaque Lean.Expr.lt (a : Lean.Expr) (b : Lean.Expr) : Bool

A total order for expressions that takes the structure into account (e.g., variable names).

@[extern lean_expr_eqv]

opaque Lean.Expr.eqv (a : Lean.Expr) (b : Lean.Expr) : Bool

Return true iff a and b are alpha equivalent. Binder annotations are ignored.

instance Lean.Expr.instBEqExpr : BEq Lean.Expr

@[extern lean_expr_equal]

opaque Lean.Expr.equal (a : Lean.Expr) (b : Lean.Expr) : Bool

Return true iff a and b are equal. Binder names and annotations are taking into account.

def Lean.Expr.isSort : Lean.Expr → Bool

Return true if the given expression is a .sort ..

def Lean.Expr.isType : Lean.Expr → Bool

Return true if the given expression is of the form .sort (.succ ..).

def Lean.Expr.isType0 : Lean.Expr → Bool

Return true if the given expression is of the form .sort (.succ .zero).

def Lean.Expr.isProp : Lean.Expr → Bool

Return true if the given expression is a .sort .zero

def Lean.Expr.isBVar : Lean.Expr → Bool

Return true if the given expression is a bound variable.

def Lean.Expr.isMVar : Lean.Expr → Bool

Return true if the given expression is a metavariable.

def Lean.Expr.isFVar : Lean.Expr → Bool

Return true if the given expression is a free variable.

def Lean.Expr.isApp : Lean.Expr → Bool

Return true if the given expression is an application.

def Lean.Expr.isProj : Lean.Expr → Bool

Return true if the given expression is a projection .proj ..

def Lean.Expr.isConst : Lean.Expr → Bool

Return true if the given expression is a constant.

def Lean.Expr.isConstOf : Lean.Expr → Lake.Name → Bool

Return true if the given expression is a constant of the give name. Examples:

• (.const `Nat []).isConstOf `Nat is true
• (.const `Nat []).isConstOf `False is false

def Lean.Expr.isFVarOf : Lean.Expr → Lean.FVarId → Bool

Return true if the given expression is a free variable with the given id. Examples:

• isFVarOf (.fvar id) id is true
• isFVarOf (.fvar id) id' is false
• isFVarOf (.sort levelZero) id is false

def Lean.Expr.isForall : Lean.Expr → Bool

Return true if the given expression is a forall-expression aka (dependent) arrow.

def Lean.Expr.isLambda : Lean.Expr → Bool

Return true if the given expression is a lambda abstraction aka anonymous function.

def Lean.Expr.isBinding : Lean.Expr → Bool

Return true if the given expression is a forall or lambda expression.

def Lean.Expr.isLet : Lean.Expr → Bool

Return true if the given expression is a let-expression.

def Lean.Expr.isMData : Lean.Expr → Bool

Return true if the given expression is a metadata.

def Lean.Expr.isLit : Lean.Expr → Bool

Return true if the given expression is a literal value.

def Lean.Expr.getForallBody : Lean.Expr → Lean.Expr

Return the "body" of a forall expression. Example: let e be the representation for forall (p : Prop) (q : Prop), p ∧ q, then getForallBody e returns .app (.app (.const `And []) (.bvar 1)) (.bvar 0)

Equations

• Lean.Expr.getForallBody (Lean.Expr.forallE binderName binderType body binderInfo) = Lean.Expr.getForallBody body
• Lean.Expr.getForallBody x = x

def Lean.Expr.getForallBodyMaxDepth (maxDepth : Nat) : Lean.Expr → Lean.Expr

Equations

• Lean.Expr.getForallBodyMaxDepth (Nat.succ n) (Lean.Expr.forallE binderName binderType b binderInfo) = Lean.Expr.getForallBodyMaxDepth n b
• Lean.Expr.getForallBodyMaxDepth 0 x = x
• Lean.Expr.getForallBodyMaxDepth x x = x

def Lean.Expr.getForallBinderNames : Lean.Expr → List Lake.Name

Given a sequence of nested foralls (a₁ : α₁) → ... → (aₙ : αₙ) → _, returns the names [a₁, ... aₙ].

Equations

• Lean.Expr.getForallBinderNames (Lean.Expr.forallE binderName binderType body binderInfo) = binderName :: Lean.Expr.getForallBinderNames body
• Lean.Expr.getForallBinderNames x = []

def Lean.Expr.getAppFn : Lean.Expr → Lean.Expr

If the given expression is a sequence of function applications f a₁ .. aₙ, return f. Otherwise return the input expression.

Equations

• Lean.Expr.getAppFn (Lean.Expr.app fn arg) = Lean.Expr.getAppFn fn
• Lean.Expr.getAppFn x = x

def Lean.Expr.getAppNumArgs (e : Lean.Expr) : Nat

Counts the number n of arguments for an expression f a₁ .. aₙ.

@[inline]

def Lean.Expr.getAppArgs (e : Lean.Expr) : Array Lean.Expr

Given f a₁ a₂ ... aₙ, returns #[a₁, ..., aₙ]

@[inline]

def Lean.Expr.getAppRevArgs (e : Lean.Expr) : Array Lean.Expr

Same as getAppArgs but reverse the output array.

@[specialize #[]]

def Lean.Expr.withAppAux {α : Sort u_1} (k : Lean.Expr → Array Lean.Expr → α) : Lean.Expr → Array Lean.Expr → Nat → α

Equations

• Lean.Expr.withAppAux k (Lean.Expr.app f a) x x = Lean.Expr.withAppAux k f (Array.set! x x a) (x - 1)
• Lean.Expr.withAppAux k x x x = k x x

@[inline]

def Lean.Expr.withApp {α : Sort u_1} (e : Lean.Expr) (k : Lean.Expr → Array Lean.Expr → α) : α

Given e = f a₁ a₂ ... aₙ, returns k f #[a₁, ..., aₙ].

def Lean.Expr.traverseApp {M : Type → Type u_1} [Monad M] (f : Lean.Expr → M Lean.Expr) (e : Lean.Expr) : M Lean.Expr

Given e = fn a₁ ... aₙ, runs f on fn and each of the arguments aᵢ and makes a new function application with the results.

@[inline]

def Lean.Expr.withAppRev {α : Sort u_1} (e : Lean.Expr) (k : Lean.Expr → Array Lean.Expr → α) : α

Same as withApp but with arguments reversed.

def Lean.Expr.getRevArgD : Lean.Expr → Nat → Lean.Expr → Lean.Expr

Equations

• Lean.Expr.getRevArgD (Lean.Expr.app fn a) 0 x = a
• Lean.Expr.getRevArgD (Lean.Expr.app f arg) (Nat.succ i) x = Lean.Expr.getRevArgD f i x
• Lean.Expr.getRevArgD x x x = x

def Lean.Expr.getRevArg! : Lean.Expr → Nat → Lean.Expr

Equations

• Lean.Expr.getRevArg! (Lean.Expr.app fn a) 0 = a
• Lean.Expr.getRevArg! (Lean.Expr.app f arg) (Nat.succ i) = Lean.Expr.getRevArg! f i
• Lean.Expr.getRevArg! x x = panicWithPosWithDecl "Lean.Expr" "Lean.Expr.getRevArg!" 972 20 "invalid index"

@[inline]

def Lean.Expr.getArg! (e : Lean.Expr) (i : Nat) (n : optParam Nat (Lean.Expr.getAppNumArgs e)) : Lean.Expr

Given f a₀ a₁ ... aₙ, returns the ith argument or panics if out of bounds.

@[inline]

def Lean.Expr.getArgD (e : Lean.Expr) (i : Nat) (v₀ : Lean.Expr) (n : optParam Nat (Lean.Expr.getAppNumArgs e)) : Lean.Expr

Given f a₀ a₁ ... aₙ, returns the ith argument or returns v₀ if out of bounds.

def Lean.Expr.isAppOf (e : Lean.Expr) (n : Lake.Name) : Bool

Given f a₀ a₁ ... aₙ, returns true if f is a constant with name n.

def Lean.Expr.isAppOfArity : Lean.Expr → Lake.Name → Nat → Bool

Given f a₁ ... aᵢ, returns true if f is a constant with name n and has the correct number of arguments.

Equations

• Lean.Expr.isAppOfArity (Lean.Expr.const c us) x 0 = (c == x)
• Lean.Expr.isAppOfArity (Lean.Expr.app f arg) x (Nat.succ a) = Lean.Expr.isAppOfArity f x a
• Lean.Expr.isAppOfArity x x x = false

def Lean.Expr.isAppOfArity' : Lean.Expr → Lake.Name → Nat → Bool

Similar to isAppOfArity but skips Expr.mdata.

Equations

• Lean.Expr.isAppOfArity' (Lean.Expr.mdata data b) x x = Lean.Expr.isAppOfArity' b x x
• Lean.Expr.isAppOfArity' (Lean.Expr.const c us) x 0 = (c == x)
• Lean.Expr.isAppOfArity' (Lean.Expr.app f arg) x (Nat.succ a) = Lean.Expr.isAppOfArity' f x a
• Lean.Expr.isAppOfArity' x x x = false

def Lean.Expr.appFn! : Lean.Expr → Lean.Expr

def Lean.Expr.appArg! : Lean.Expr → Lean.Expr

def Lean.Expr.appFn!' : Lean.Expr → Lean.Expr

Equations

• Lean.Expr.appFn!' (Lean.Expr.mdata data b) = Lean.Expr.appFn!' b
• Lean.Expr.appFn!' (Lean.Expr.app f arg) = f
• Lean.Expr.appFn!' x = panicWithPosWithDecl "Lean.Expr" "Lean.Expr.appFn!'" 1015 17 "application expected"

def Lean.Expr.appArg!' : Lean.Expr → Lean.Expr

Equations

• Lean.Expr.appArg!' (Lean.Expr.mdata data b) = Lean.Expr.appArg!' b
• Lean.Expr.appArg!' (Lean.Expr.app f arg) = arg
• Lean.Expr.appArg!' x = panicWithPosWithDecl "Lean.Expr" "Lean.Expr.appArg!'" 1020 17 "application expected"

def Lean.Expr.sortLevel! : Lean.Expr → Lean.Level

def Lean.Expr.litValue! : Lean.Expr → Lean.Literal

def Lean.Expr.isNatLit : Lean.Expr → Bool

def Lean.Expr.natLit? : Lean.Expr → Option Nat

def Lean.Expr.isStringLit : Lean.Expr → Bool

def Lean.Expr.isCharLit (e : Lean.Expr) : Bool

def Lean.Expr.constName! : Lean.Expr → Lake.Name

def Lean.Expr.constName? : Lean.Expr → Option Lake.Name

def Lean.Expr.constLevels! : Lean.Expr → List Lean.Level

def Lean.Expr.bvarIdx! : Lean.Expr → Nat

def Lean.Expr.fvarId! : Lean.Expr → Lean.FVarId

def Lean.Expr.mvarId! : Lean.Expr → Lean.MVarId

def Lean.Expr.bindingName! : Lean.Expr → Lake.Name

def Lean.Expr.bindingDomain! : Lean.Expr → Lean.Expr

def Lean.Expr.bindingBody! : Lean.Expr → Lean.Expr

def Lean.Expr.bindingInfo! : Lean.Expr → Lean.BinderInfo

def Lean.Expr.letName! : Lean.Expr → Lake.Name

def Lean.Expr.letType! : Lean.Expr → Lean.Expr

def Lean.Expr.letValue! : Lean.Expr → Lean.Expr

def Lean.Expr.letBody! : Lean.Expr → Lean.Expr

def Lean.Expr.consumeMData : Lean.Expr → Lean.Expr

Equations

• Lean.Expr.consumeMData (Lean.Expr.mdata data expr) = Lean.Expr.consumeMData expr
• Lean.Expr.consumeMData x = x

def Lean.Expr.mdataExpr! : Lean.Expr → Lean.Expr

def Lean.Expr.projExpr! : Lean.Expr → Lean.Expr

def Lean.Expr.projIdx! : Lean.Expr → Nat

def Lean.Expr.hasLooseBVars (e : Lean.Expr) : Bool

def Lean.Expr.isArrow (e : Lean.Expr) : Bool

Return true if e is a non-dependent arrow. Remark: the following function assumes e does not have loose bound variables.

@[extern lean_expr_has_loose_bvar]

opaque Lean.Expr.hasLooseBVar (e : Lean.Expr) (bvarIdx : Nat) : Bool

def Lean.Expr.hasLooseBVarInExplicitDomain : Lean.Expr → Nat → Bool → Bool

Return true if e contains the loose bound variable bvarIdx in an explicit parameter, or in the range if tryRange == true.

Equations

• One or more equations did not get rendered due to their size.
• Lean.Expr.hasLooseBVarInExplicitDomain x x x = (x && Lean.Expr.hasLooseBVar x x)

@[extern lean_expr_lower_loose_bvars]

opaque Lean.Expr.lowerLooseBVars (e : Lean.Expr) (s : Nat) (d : Nat) : Lean.Expr

Lower the loose bound variables >= s in e by d. That is, a loose bound variable bvar i. i >= s is mapped into bvar (i-d).

Remark: if s < d, then result is e

@[extern lean_expr_lift_loose_bvars]

opaque Lean.Expr.liftLooseBVars (e : Lean.Expr) (s : Nat) (d : Nat) : Lean.Expr

Lift loose bound variables >= s in e by d.

def Lean.Expr.inferImplicit : Lean.Expr → Nat → Bool → Lean.Expr

inferImplicit e numParams considerRange updates the first numParams parameter binder annotations of the e forall type. It marks any parameter with an explicit binder annotation if there is another explicit arguments that depends on it or the resulting type if considerRange == true.

Remark: we use this function to infer the bind annotations of inductive datatype constructors, and structure projections. When the {} annotation is used in these commands, we set considerRange == false.

@[extern lean_expr_instantiate]

opaque Lean.Expr.instantiate (e : Lean.Expr) (subst : Array Lean.Expr) : Lean.Expr

Instantiate the loose bound variables in e using subst. That is, a loose Expr.bvar i is replaced with subst[i].

@[extern lean_expr_instantiate1]

opaque Lean.Expr.instantiate1 (e : Lean.Expr) (subst : Lean.Expr) : Lean.Expr

@[extern lean_expr_instantiate_rev]

opaque Lean.Expr.instantiateRev (e : Lean.Expr) (subst : Array Lean.Expr) : Lean.Expr

Similar to instantiate, but Expr.bvar i is replaced with subst[subst.size - i - 1]

@[extern lean_expr_instantiate_range]

opaque Lean.Expr.instantiateRange (e : Lean.Expr) (beginIdx : Nat) (endIdx : Nat) (xs : Array Lean.Expr) : Lean.Expr

Similar to instantiate, but consider only the variables xs in the range [beginIdx, endIdx). Function panics if beginIdx <= endIdx <= xs.size does not hold.

@[extern lean_expr_instantiate_rev_range]

opaque Lean.Expr.instantiateRevRange (e : Lean.Expr) (beginIdx : Nat) (endIdx : Nat) (xs : Array Lean.Expr) : Lean.Expr

Similar to instantiateRev, but consider only the variables xs in the range [beginIdx, endIdx). Function panics if beginIdx <= endIdx <= xs.size does not hold.

@[extern lean_expr_abstract]

opaque Lean.Expr.abstract (e : Lean.Expr) (xs : Array Lean.Expr) : Lean.Expr

Replace free (or meta) variables xs with loose bound variables.

@[extern lean_expr_abstract_range]

opaque Lean.Expr.abstractRange (e : Lean.Expr) (n : Nat) (xs : Array Lean.Expr) : Lean.Expr

Similar to abstract, but consider only the first min n xs.size entries in xs.

def Lean.Expr.replaceFVar (e : Lean.Expr) (fvar : Lean.Expr) (v : Lean.Expr) : Lean.Expr

Replace occurrences of the free variable fvar in e with v

def Lean.Expr.replaceFVarId (e : Lean.Expr) (fvarId : Lean.FVarId) (v : Lean.Expr) : Lean.Expr

Replace occurrences of the free variable fvarId in e with v

def Lean.Expr.replaceFVars (e : Lean.Expr) (fvars : Array Lean.Expr) (vs : Array Lean.Expr) : Lean.Expr

Replace occurrences of the free variables fvars in e with vs

instance Lean.Expr.instToStringExpr : ToString Lean.Expr

def Lean.Expr.isAtomic : Lean.Expr → Bool

Returns true when the expression does not have any sub-expressions.

def Lean.mkDecIsTrue (pred : Lean.Expr) (proof : Lean.Expr) : Lean.Expr

def Lean.mkDecIsFalse (pred : Lean.Expr) (proof : Lean.Expr) : Lean.Expr

@[inline, reducible]

abbrev Lean.ExprMap (α : Type) : Type

@[inline, reducible]

abbrev Lean.PersistentExprMap (α : Type) : Type

@[inline, reducible]

abbrev Lean.ExprSet : Type

@[inline, reducible]

abbrev Lean.PersistentExprSet : Type

@[inline, reducible]

abbrev Lean.PExprSet : Type

structure Lean.ExprStructEq : Type

• val : Lean.Expr

Auxiliary type for forcing == to be structural equality for Expr

instance Lean.instInhabitedExprStructEq : Inhabited Lean.ExprStructEq

instance Lean.instCoeExprExprStructEq : Coe Lean.Expr Lean.ExprStructEq

def Lean.ExprStructEq.beq : Lean.ExprStructEq → Lean.ExprStructEq → Bool

def Lean.ExprStructEq.hash : Lean.ExprStructEq → UInt64

instance Lean.ExprStructEq.instBEqExprStructEq : BEq Lean.ExprStructEq

instance Lean.ExprStructEq.instHashableExprStructEq : Hashable Lean.ExprStructEq

instance Lean.ExprStructEq.instToStringExprStructEq : ToString Lean.ExprStructEq

@[inline, reducible]

abbrev Lean.ExprStructMap (α : Type) : Type

@[inline, reducible]

abbrev Lean.PersistentExprStructMap (α : Type) : Type

def Lean.Expr.mkAppRevRange (f : Lean.Expr) (beginIdx : Nat) (endIdx : Nat) (revArgs : Array Lean.Expr) : Lean.Expr

mkAppRevRange f b e args == mkAppRev f (revArgs.extract b e)

def Lean.Expr.betaRev (f : Lean.Expr) (revArgs : Array Lean.Expr) (useZeta : optParam Bool false) (preserveMData : optParam Bool false) : Lean.Expr

If f is a lambda expression, than "beta-reduce" it using revArgs. This function is often used with getAppRev or withAppRev. Examples:

• betaRev (fun x y => t x y) #[] ==> fun x y => t x y
• betaRev (fun x y => t x y) #[a] ==> fun y => t a y
• betaRev (fun x y => t x y) #[a, b] ==> t b a
• betaRev (fun x y => t x y) #[a, b, c, d] ==> t d c b a Suppose t is (fun x y => t x y) a b c d, then args := t.getAppRev is #[d, c, b, a], and betaRev (fun x y => t x y) #[d, c, b, a] is t a b c d.

If useZeta is true, the function also performs zeta-reduction (reduction of let binders) to create further opportunities for beta reduction.

partial def Lean.Expr.betaRev.go (revArgs : Array Lean.Expr) (useZeta : optParam Bool false) (preserveMData : optParam Bool false) (sz : Nat) (e : Lean.Expr) (i : Nat) : Lean.Expr

def Lean.Expr.beta (f : Lean.Expr) (args : Array Lean.Expr) : Lean.Expr

Apply the given arguments to f, beta-reducing if f is a lambda expression. See docstring for betaRev for examples.

def Lean.Expr.isHeadBetaTargetFn (useZeta : Bool) : Lean.Expr → Bool

Return true if the given expression is the function of an expression that is target for (head) beta reduction. If useZeta = true, then let-expressions are visited. That is, it assumes that zeta-reduction (aka let-expansion) is going to be used.

See isHeadBetaTarget.

Equations

• Lean.Expr.isHeadBetaTargetFn useZeta (Lean.Expr.lam binderName binderType b binderInfo) = true
• Lean.Expr.isHeadBetaTargetFn useZeta (Lean.Expr.letE declName type v b nonDep) = (useZeta && Lean.Expr.isHeadBetaTargetFn useZeta b)
• Lean.Expr.isHeadBetaTargetFn useZeta (Lean.Expr.mdata k b) = Lean.Expr.isHeadBetaTargetFn useZeta b
• Lean.Expr.isHeadBetaTargetFn useZeta x = false

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

(fun x => e) a ==> e[x/a].

def Lean.Expr.isHeadBetaTarget (e : Lean.Expr) (useZeta : optParam Bool false) : Bool

Return true if the given expression is a target for (head) beta reduction. If useZeta = true, then let-expressions are visited. That is, it assumes that zeta-reduction (aka let-expansion) is going to be used.

def Lean.Expr.etaExpanded? (e : Lean.Expr) : Option Lean.Expr

If e is of the form (fun x₁ ... xₙ => f x₁ ... xₙ) and f does not contain x₁, ..., xₙ, then return some f. Otherwise, return none.

It assumes e does not have loose bound variables.

Remark: ₙ may be 0

def Lean.Expr.etaExpandedStrict? : Lean.Expr → Option Lean.Expr

Similar to etaExpanded?, but only succeeds if ₙ ≥ 1.

def Lean.Expr.getOptParamDefault? (e : Lean.Expr) : Option Lean.Expr

Return some e' if e is of the form optParam _ e'

def Lean.Expr.getAutoParamTactic? (e : Lean.Expr) : Option Lean.Expr

Return some e' if e is of the form autoParam _ e'

@[export lean_is_out_param]

def Lean.Expr.isOutParam (e : Lean.Expr) : Bool

Return true if e is of the form outParam _

def Lean.Expr.isSemiOutParam (e : Lean.Expr) : Bool

Return true if e is of the form semiOutParam _

def Lean.Expr.isOptParam (e : Lean.Expr) : Bool

Return true if e is of the form optParam _ _

def Lean.Expr.isAutoParam (e : Lean.Expr) : Bool

Return true if e is of the form autoParam _ _

@[export lean_expr_consume_type_annotations]

partial def Lean.Expr.consumeTypeAnnotations (e : Lean.Expr) : Lean.Expr

Remove outParam, optParam, and autoParam applications/annotations from e. Note that it does not remove nested annotations. Examples:

• Given e of the form outParam (optParam Nat b), consumeTypeAnnotations e = b.
• Given e of the form Nat → outParam (optParam Nat b), consumeTypeAnnotations e = e.

partial def Lean.Expr.cleanupAnnotations (e : Lean.Expr) : Lean.Expr

Remove metadata annotations and outParam, optParam, and autoParam applications/annotations from e. Note that it does not remove nested annotations. Examples:

• Given e of the form outParam (optParam Nat b), cleanupAnnotations e = b.
• Given e of the form Nat → outParam (optParam Nat b), cleanupAnnotations e = e.

@[inline]

def Lean.Expr.hasAnyFVar (e : Lean.Expr) (p : Lean.FVarId → Bool) : Bool

Return true iff e contains a free variable which statisfies p.

@[specialize #[]]

def Lean.Expr.hasAnyFVar.visit (p : Lean.FVarId → Bool) (e : Lean.Expr) : Bool

def Lean.Expr.containsFVar (e : Lean.Expr) (fvarId : Lean.FVarId) : Bool

Return true if e contains the given free variable.

The update functions try to avoid allocating new values using pointer equality. Note that if the update*! functions are used under a match-expression, the compiler will eliminate the double-match.

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateApp!Impl]

def Lean.Expr.updateApp! (e : Lean.Expr) (newFn : Lean.Expr) (newArg : Lean.Expr) : Lean.Expr

@[inline]

def Lean.Expr.updateFVar! (e : Lean.Expr) (fvarIdNew : Lean.FVarId) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateConst!Impl]

def Lean.Expr.updateConst! (e : Lean.Expr) (newLevels : List Lean.Level) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateSort!Impl]

def Lean.Expr.updateSort! (e : Lean.Expr) (newLevel : Lean.Level) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateMData!Impl]

def Lean.Expr.updateMData! (e : Lean.Expr) (newExpr : Lean.Expr) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateProj!Impl]

def Lean.Expr.updateProj! (e : Lean.Expr) (newExpr : Lean.Expr) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateForall!Impl]

def Lean.Expr.updateForall! (e : Lean.Expr) (newBinfo : Lean.BinderInfo) (newDomain : Lean.Expr) (newBody : Lean.Expr) : Lean.Expr

@[inline]

def Lean.Expr.updateForallE! (e : Lean.Expr) (newDomain : Lean.Expr) (newBody : Lean.Expr) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateLambda!Impl]

def Lean.Expr.updateLambda! (e : Lean.Expr) (newBinfo : Lean.BinderInfo) (newDomain : Lean.Expr) (newBody : Lean.Expr) : Lean.Expr

@[inline]

def Lean.Expr.updateLambdaE! (e : Lean.Expr) (newDomain : Lean.Expr) (newBody : Lean.Expr) : Lean.Expr

@[implemented_by _private.Lean.Expr.0.Lean.Expr.updateLet!Impl]

def Lean.Expr.updateLet! (e : Lean.Expr) (newType : Lean.Expr) (newVal : Lean.Expr) (newBody : Lean.Expr) : Lean.Expr

def Lean.Expr.updateFn : Lean.Expr → Lean.Expr → Lean.Expr

Equations

• Lean.Expr.updateFn (Lean.Expr.app f a) x = Lean.Expr.updateApp! (Lean.Expr.app f a) (Lean.Expr.updateFn f x) a
• Lean.Expr.updateFn x x = x

partial def Lean.Expr.eta (e : Lean.Expr) : Lean.Expr

Eta reduction. If e is of the form (fun x => f x), then return f.

def Lean.Expr.setOption {α : Type} (e : Lean.Expr) (optionName : Lake.Name) [Lean.KVMap.Value α] (val : α) : Lean.Expr

Annotate e with the given option. The information is stored using metadata around e.

def Lean.Expr.setPPExplicit (e : Lean.Expr) (flag : Bool) : Lean.Expr

Annotate e with pp.explicit := flag The delaborator uses pp options.

def Lean.Expr.setPPUniverses (e : Lean.Expr) (flag : Bool) : Lean.Expr

Annotate e with pp.universes := flag The delaborator uses pp options.

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

If e is an application f a_1 ... a_n annotate f, a_1 ... a_n with pp.explicit := false, and annotate e with pp.explicit := true.

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

Similar for setAppPPExplicit, but only annotate children with pp.explicit := false if e does not contain metavariables.

def Lean.mkAnnotation (kind : Lake.Name) (e : Lean.Expr) : Lean.Expr

Annotate e with the given annotation name kind. It uses metadata to store the annotation.

def Lean.annotation? (kind : Lake.Name) (e : Lean.Expr) : Option Lean.Expr

Return some e' if e = mkAnnotation kind e'

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

Annotate e with the let_fun annotation. This annotation is used as hint for the delaborator. If e is of the form (fun x : t => b) v, then mkLetFunAnnotation e is delaborated at let_fun x : t := v; b

def Lean.letFunAnnotation? (e : Lean.Expr) : Option Lean.Expr

Return some e' if e = mkLetFunAnnotation e'

def Lean.isLetFun (e : Lean.Expr) : Bool

Return true if e = mkLetFunAnnotation e', and e' is of the form (fun x : t => b) v

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

Auxiliary annotation used to mark terms marked with the "inaccessible" annotation .(t) and _ in patterns.

def Lean.inaccessible? (e : Lean.Expr) : Option Lean.Expr

Return some e' if e = mkInaccessible e'.

def Lean.patternWithRef? (p : Lean.Expr) : Option (Lean.Syntax × Lean.Expr)

During elaboration expressions corresponding to pattern matching terms are annotated with Syntax objects. This function returns some (stx, p') if p is the pattern p' annotated with stx

def Lean.isPatternWithRef (p : Lean.Expr) : Bool

def Lean.mkPatternWithRef (p : Lean.Expr) (stx : Lean.Syntax) : Lean.Expr

Annotate the pattern p with stx. This is an auxiliary annotation for producing better hover information.

def Lean.patternAnnotation? (e : Lean.Expr) : Option Lean.Expr

Return some p if e is an annotated pattern (inaccessible? or patternWithRef?)

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

Annotate e with the LHS annotation. The delaborator displays expressions of the form lhs = rhs as lhs when they have this annotation. This is used to implement the infoview for the conv mode.

This version of mkLHSGoal does not check that the argument is an equality.

def Lean.isLHSGoal? (e : Lean.Expr) : Option Lean.Expr

Return some lhs if e = mkLHSGoal e', where e' is of the form lhs = rhs.

def Lean.mkFreshFVarId {m : Type → Type} [Monad m] [Lean.MonadNameGenerator m] : m Lean.FVarId

Polymorphic operation for generating unique/fresh free variable identifiers. It is available in any monad m that implements the inferface MonadNameGenerator.

def Lean.mkFreshMVarId {m : Type → Type} [Monad m] [Lean.MonadNameGenerator m] : m Lean.MVarId

Polymorphic operation for generating unique/fresh metavariable identifiers. It is available in any monad m that implements the inferface MonadNameGenerator.

def Lean.mkFreshLMVarId {m : Type → Type} [Monad m] [Lean.MonadNameGenerator m] : m Lean.LMVarId

Polymorphic operation for generating unique/fresh universe metavariable identifiers. It is available in any monad m that implements the inferface MonadNameGenerator.

def Lean.mkNot (p : Lean.Expr) : Lean.Expr

Return Not p

def Lean.mkOr (p : Lean.Expr) (q : Lean.Expr) : Lean.Expr

Return p ∨ q

def Lean.mkAnd (p : Lean.Expr) (q : Lean.Expr) : Lean.Expr

Return p ∧ q

def Lean.mkEM (p : Lean.Expr) : Lean.Expr

Return Classical.em p