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.

Equations

• Lean.Compiler.LCNF.ToLCNF.isLCProof e = e.isAppOfArity `lcProof 1

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

Create the temporary lcProof

Equations

• Lean.Compiler.LCNF.ToLCNF.mkLcProof p = Lean.mkApp (Lean.mkConst `lcProof) p

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

Equations

• Lean.Compiler.LCNF.ToLCNF.instInhabitedElement = { default := Lean.Compiler.LCNF.ToLCNF.Element.jp default }

@[reducible, inline]

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

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

Equations

• Lean.Compiler.LCNF.ToLCNF.BindCasesM.State = Lean.FVarIdMap Lean.Compiler.LCNF.FunDecl

@[reducible, inline]

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

Auxiliary monad for implementing bindCases

Equations

• Lean.Compiler.LCNF.ToLCNF.BindCasesM = StateRefT' IO.RealWorld Lean.Compiler.LCNF.ToLCNF.BindCasesM.State Lean.Compiler.LCNF.CompilerM

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.

Equations

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

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

Equations

• Lean.Compiler.LCNF.ToLCNF.seqToCode seq k = Lean.Compiler.LCNF.ToLCNF.seqToCode.go✝ seq seq.size k

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.

• shouldCache : Bool

  Determines whether caching has been disabled due to finding a use of a constant marked with never_extract.

• 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

Equations

• Lean.Compiler.LCNF.ToLCNF.M = StateRefT' IO.RealWorld Lean.Compiler.LCNF.ToLCNF.State Lean.Compiler.LCNF.CompilerM

@[inline]

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

Equations

• Lean.Compiler.LCNF.ToLCNF.liftMetaM x = do let __do_lift ← get liftM (x.run' { lctx := __do_lift.lctx })

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

Add LCNF element to the current sequence

Equations

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

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

Equations

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

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

Equations

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

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

Equations

• Lean.Compiler.LCNF.ToLCNF.letValueToArg e prefixName = do let __do_lift ← Lean.Compiler.LCNF.ToLCNF.mkAuxLetDecl e prefixName pure (Lean.Compiler.LCNF.Arg.fvar __do_lift)

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

Create Code that executes the current seq and then returns result

Equations

• One or more equations did not get rendered due to their size.
• Lean.Compiler.LCNF.ToLCNF.toCode (Lean.Compiler.LCNF.Arg.fvar fvarId) = do let __do_lift ← get liftM (Lean.Compiler.LCNF.ToLCNF.seqToCode __do_lift.seq (Lean.Compiler.LCNF.Code.return fvarId))

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

Equations

• Lean.Compiler.LCNF.ToLCNF.run x = StateRefT'.run' x { }

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

Equations

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

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

Equations

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

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

Equations

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

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

Equations

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

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

Create a new local declaration using a Lean regular type.

Equations

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

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

Equations

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

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

Equations

• Lean.Compiler.LCNF.ToLCNF.visitLambda e = Lean.Compiler.LCNF.ToLCNF.visitLambda.go✝ e #[] #[]

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

Equations

• Lean.Compiler.LCNF.ToLCNF.visitBoundedLambda e n = Lean.Compiler.LCNF.ToLCNF.visitBoundedLambda.go✝ e n #[] #[]

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

Equations

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

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

Eta-expand with n lambdas.

Equations

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

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

Equations

• Lean.Compiler.LCNF.ToLCNF.litToValue (Lean.Literal.natVal val) = Lean.Compiler.LCNF.LitValue.nat val
• Lean.Compiler.LCNF.ToLCNF.litToValue (Lean.Literal.strVal val) = Lean.Compiler.LCNF.LitValue.str val

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.

Equations

• Lean.Compiler.LCNF.toLCNF e = Lean.Compiler.LCNF.ToLCNF.run do let __do_lift ← Lean.Compiler.LCNF.ToLCNF.toLCNF.visit✝ e Lean.Compiler.LCNF.ToLCNF.toCode __do_lift