Type inference for LCNF

@[reducible, inline]

abbrev Lean.Compiler.LCNF.InferType.Pure.InferTypeM (α : Type) : Type

We use a regular local context to store temporary local declarations created during type inference.

def Lean.Compiler.LCNF.InferType.Pure.getBinderName (fvarId : FVarId) : InferTypeM Name

def Lean.Compiler.LCNF.InferType.Pure.getType (fvarId : FVarId) : InferTypeM Expr

def Lean.Compiler.LCNF.InferType.Pure.mkForallFVars (xs : Array Expr) (type : Expr) : InferTypeM Expr

def Lean.Compiler.LCNF.InferType.Pure.mkForallParams (params : Array (Param Purity.pure)) (type : Expr) : InferTypeM Expr

@[inline]

def Lean.Compiler.LCNF.InferType.Pure.withLocalDecl {α : Type} (binderName : Name) (type : Expr) (binderInfo : BinderInfo) (k : Expr → InferTypeM α) : InferTypeM α

def Lean.Compiler.LCNF.InferType.Pure.inferConstType (declName : Name) (us : List Level) : CompilerM Expr

def Lean.Compiler.LCNF.InferType.Pure.inferLitValueType (value : LitValue) : Expr

def Lean.Compiler.LCNF.InferType.Pure.inferArgType (arg : Arg Purity.pure) : InferTypeM Expr

partial def Lean.Compiler.LCNF.InferType.Pure.inferType (e : Expr) : InferTypeM Expr

def Lean.Compiler.LCNF.InferType.Pure.inferLetValueType (e : LetValue Purity.pure) : InferTypeM Expr

def Lean.Compiler.LCNF.InferType.Pure.inferAppTypeCore (fType : Expr) (args : Array (Arg Purity.pure)) : InferTypeM Expr

partial def Lean.Compiler.LCNF.InferType.Pure.inferAppType (e : Expr) : InferTypeM Expr

def Lean.Compiler.LCNF.InferType.Pure.inferProjType (structName : Name) (idx : Nat) (s : FVarId) : InferTypeM Expr

partial def Lean.Compiler.LCNF.InferType.Pure.getLevel? (type : Expr) : InferTypeM (Option Level)

partial def Lean.Compiler.LCNF.InferType.Pure.inferForallType (e : Expr) : InferTypeM Expr

partial def Lean.Compiler.LCNF.InferType.Pure.inferLambdaType (e : Expr) : InferTypeM Expr

def Lean.Compiler.LCNF.inferType (e : Expr) : CompilerM Expr

def Lean.Compiler.LCNF.inferAppType {pu : Purity} (fnType : Expr) (args : Array (Arg pu)) : CompilerM Expr

def Lean.Compiler.LCNF.Arg.inferType {pu : Purity} (arg : Arg pu) : CompilerM Expr

def Lean.Compiler.LCNF.LetValue.inferType {pu : Purity} (e : LetValue pu) : CompilerM Expr

@[irreducible]

def Lean.Compiler.LCNF.Code.inferType {pu : Purity} (code : Code pu) : CompilerM Expr

def Lean.Compiler.LCNF.Code.inferParamType {pu : Purity} (params : Array (Param pu)) (code : Code pu) : CompilerM Expr

def Lean.Compiler.LCNF.Alt.inferType {pu : Purity} (alt : Alt pu) : CompilerM Expr

def Lean.Compiler.LCNF.mkAuxLetDecl {pu : Purity} (e : LetValue pu) (prefixName : Name := `_x) : CompilerM (LetDecl pu)

def Lean.Compiler.LCNF.mkForallParams {pu : Purity} (params : Array (Param pu)) (type : Expr) : CompilerM Expr

def Lean.Compiler.LCNF.mkAuxFunDecl (params : Array (Param Purity.pure)) (code : Code Purity.pure) (prefixName : Name := `_f) : CompilerM (FunDecl Purity.pure)

def Lean.Compiler.LCNF.mkAuxJpDecl {pu : Purity} (params : Array (Param pu)) (code : Code pu) (prefixName : Name := `_jp) : CompilerM (FunDecl pu)

def Lean.Compiler.LCNF.mkAuxJpDecl' {pu : Purity} (param : Param pu) (code : Code pu) (prefixName : Name := `_jp) : CompilerM (FunDecl pu)

def Lean.Compiler.LCNF.mkCasesResultType {pu : Purity} (alts : Array (Alt pu)) : CompilerM Expr

def Lean.Compiler.LCNF.isErasedCompatible (type : Expr) (predVars : Array Bool := #[]) : CompilerM Bool

Return true if type should be erased. See item 1 in the note above where x ◾ ◾ is a proposition and should be erased when the universe level parameter is set to 0.

Remark: predVars is a bitmask that indicates whether de-bruijn variables are predicates or not. That is, #i is a predicate if predVars[predVars.size - i - 1] = true

partial def Lean.Compiler.LCNF.eqvTypes (a b : Expr) : Bool

Return true if the given LCNF are equivalent. List Nat and (fun x => List x) Nat are both equivalent.