def Lean.Compiler.LCNF.ToLCNF.isLCProof (e : Expr) : Bool

Return true if e is a lcProof application. Recall that we use lcProof to erase all nested proofs.

def Lean.Compiler.LCNF.ToLCNF.mkLcProof (p : Expr) : Expr

Create the temporary lcProof

inductive Lean.Compiler.LCNF.ToLCNF.Element : Type

Auxiliary inductive datatype for constructing LCNF Code objects. The toLCNF function maintains a sequence of elements that is eventually converted into Code.

• jp (decl : FunDecl) : Element
• fun (decl : FunDecl) : Element
• let (decl : LetDecl) : Element
• cases (p : Param) (cases : Cases) : Element
• unreach (p : Param) : Element

instance Lean.Compiler.LCNF.ToLCNF.instInhabitedElement : Inhabited Element

@[reducible, inline]

abbrev Lean.Compiler.LCNF.ToLCNF.BindCasesM.State : Type

State for BindCasesM monad Mapping from _alt.<idx> variables to new join points

@[reducible, inline]

abbrev Lean.Compiler.LCNF.ToLCNF.BindCasesM (α : Type) : Type

Auxiliary monad for implementing bindCases

def Lean.Compiler.LCNF.ToLCNF.bindCases (jpDecl : FunDecl) (cases : Cases) : CompilerM Code

This method returns code that at each exit point of cases, it jumps to jpDecl. It is similar to Code.bind, but we add special support for inlineMatcher. The inlineMatcher function inlines the auxiliary _match_<idx> declarations. To make sure there is no code duplication, inlineMatcher creates auxiliary declarations _alt.<idx>. We can say the _alt.<idx> declarations are pre join points. For each auxiliary declaration used at an exit point of cases, this method creates an new auxiliary join point that invokes _alt.<idx>, and then jumps to jpDecl. The goal is to make sure the auxiliary join point is the only occurrence of _alt.<idx>, then simp will inline it. That is, our goal is to try to promote the pre join points _alt.<idx> into a proper join point.

def Lean.Compiler.LCNF.ToLCNF.bindCases.visitAlts (jpDecl : FunDecl) (alts : Array Alt) : BindCasesM (Array Alt)

partial def Lean.Compiler.LCNF.ToLCNF.bindCases.findFun? (f : FVarId) : CompilerM (Option FunDecl)

partial def Lean.Compiler.LCNF.ToLCNF.bindCases.go (jpDecl : FunDecl) (code : Code) : BindCasesM Code

def Lean.Compiler.LCNF.ToLCNF.seqToCode (seq : Array Element) (k : Code) : CompilerM Code

@[irreducible]

def Lean.Compiler.LCNF.ToLCNF.seqToCode.go (seq : Array Element) (i : Nat) (c : Code) : CompilerM Code

structure Lean.Compiler.LCNF.ToLCNF.State : Type

• lctx : LocalContext

  Local context containing the original Lean types (not LCNF ones).

• cache : PHashMap Expr Arg

  Cache from Lean regular expression to LCNF argument.

• typeCache : Std.HashMap Expr Expr

  toLCNFType cache

• isTypeFormerTypeCache : Std.HashMap Expr Bool

  isTypeFormerType cache

• seq : Array Element

  LCNF sequence, we chain it to create a LCNF Code object.

• toAny : FVarIdSet

  Fields that are type formers must be replaced with ◾ in the resulting code. Otherwise, we have data occurring in types. When converting a casesOn into LCNF, we add constructor fields that are types and type formers into this set. See visitCases.

@[reducible, inline]

abbrev Lean.Compiler.LCNF.ToLCNF.M (α : Type) : Type

@[inline]

def Lean.Compiler.LCNF.ToLCNF.liftMetaM {α : Type} (x : MetaM α) : M α

def Lean.Compiler.LCNF.ToLCNF.pushElement (elem : Element) : M Unit

Add LCNF element to the current sequence

def Lean.Compiler.LCNF.ToLCNF.mkUnreachable (type : Expr) : M Arg

def Lean.Compiler.LCNF.ToLCNF.mkAuxLetDecl (e : LetValue) (prefixName : Name := `_x) : M FVarId

def Lean.Compiler.LCNF.ToLCNF.letValueToArg (e : LetValue) (prefixName : Name := `_x) : M Arg

def Lean.Compiler.LCNF.ToLCNF.toCode (result : Arg) : M Code

Create Code that executes the current seq and then returns result

def Lean.Compiler.LCNF.ToLCNF.run {α : Type} (x : M α) : CompilerM α

def Lean.Compiler.LCNF.ToLCNF.withNewScope {α : Type} (x : M α) : M α

def Lean.Compiler.LCNF.ToLCNF.applyToAny (type : Expr) : M Expr

def Lean.Compiler.LCNF.ToLCNF.toLCNFType (type : Expr) : M Expr

def Lean.Compiler.LCNF.ToLCNF.cleanupBinderName (binderName : Name) : CompilerM Name

def Lean.Compiler.LCNF.ToLCNF.mkParam (binderName : Name) (type : Expr) : M Param

Create a new local declaration using a Lean regular type.

def Lean.Compiler.LCNF.ToLCNF.mkLetDecl (binderName : Name) (type value type' : Expr) (arg : Arg) : M LetDecl

def Lean.Compiler.LCNF.ToLCNF.visitLambda (e : Expr) : M (Array Param × Expr)

def Lean.Compiler.LCNF.ToLCNF.visitLambda.go (e : Expr) (xs : Array Expr) (ps : Array Param) : M (Array Param × Expr)

def Lean.Compiler.LCNF.ToLCNF.visitBoundedLambda (e : Expr) (n : Nat) : M (Array Param × Expr)

def Lean.Compiler.LCNF.ToLCNF.visitBoundedLambda.go (e : Expr) (n : Nat) (xs : Array Expr) (ps : Array Param) : M (Array Param × Expr)

def Lean.Compiler.LCNF.ToLCNF.mustEtaExpand (env : Environment) (e : Expr) : Bool

def Lean.Compiler.LCNF.ToLCNF.etaExpandN (e : Expr) (n : Nat) : M Expr

Eta-expand with n lambdas.

partial def Lean.Compiler.LCNF.ToLCNF.etaReduceImplicit (e : Expr) : Expr

Eta reduce implicits. We use this function to eliminate introduced by the implicit lambda feature, where it generates terms such as fun {α} => ReaderT.pure

def Lean.Compiler.LCNF.ToLCNF.litToValue (lit : Literal) : LitValue

def Lean.Compiler.LCNF.ToLCNF.toLCNF (e : Expr) : CompilerM Code

Put the given expression in LCNF.

• Nested proofs are replaced with lcProof-applications.
• Eta-expand applications of declarations that satisfy shouldEtaExpand.
• Put computationally relevant expressions in A-normal form.

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitCore (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visit (e : Expr) : M Arg

def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitLit (lit : Literal) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitAppArg (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitAppDefaultConst (f : Expr) (args : Array Expr) : M Arg

Giving f a constant .const declName us, convert args into args', and return .const declName us args'

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.etaIfUnderApplied (e : Expr) (arity : Nat) (k : M Arg) : M Arg

Eta expand if under applied, otherwise apply k

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.mkOverApplication (app : Arg) (args : Array Expr) (arity : Nat) : M Arg

If args.size == arity, then just return app. Otherwise return

let k := app
k args[arity:]

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitAlt (ctorName : Name) (numParams : Nat) (e : Expr) : M (Expr × Alt)

Visit a matcher/casesOn alternative.

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitCases (casesInfo : CasesInfo) (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitCasesImplementedBy (casesInfo : CasesInfo) (f : Expr) (args : Array Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitCtor (arity : Nat) (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitQuotLift (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitEqRec (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitHEqRec (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitFalseRec (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitAndIffRecCore (e : Expr) (minorPos : Nat) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitNoConfusion (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.expandNoConfusionMajor (major : Expr) (numFields : Nat) : M Expr

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitProjFn (projInfo : ProjectionFunctionInfo) (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitApp (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitLambda (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitMData (_mdata : MData) (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitProj (s : Name) (i : Nat) (e : Expr) : M Arg

partial def Lean.Compiler.LCNF.ToLCNF.toLCNF.visitLet (e : Expr) (xs : Array Expr) : M Arg