Lean Compiler Normal Form (LCNF) #
It is based on the A-normal form, and the approach described in the paper Compiling without continuations.
- fvarId : Lean.FVarId
- binderName : Lake.Name
- type : Lean.Expr
- borrow : Bool
Instances For
- alt: {Code : Type} → Lake.Name → Array Lean.Compiler.LCNF.Param → Code → Lean.Compiler.LCNF.AltCore Code
- default: {Code : Type} → Code → Lean.Compiler.LCNF.AltCore Code
Instances For
- natVal: Nat → Lean.Compiler.LCNF.LitValue
- strVal: String → Lean.Compiler.LCNF.LitValue
Instances For
- erased: Lean.Compiler.LCNF.Arg
- fvar: Lean.FVarId → Lean.Compiler.LCNF.Arg
- type: Lean.Expr → Lean.Compiler.LCNF.Arg
Instances For
Instances For
- value: Lean.Compiler.LCNF.LitValue → Lean.Compiler.LCNF.LetValue
- erased: Lean.Compiler.LCNF.LetValue
- proj: Lake.Name → Nat → Lean.FVarId → Lean.Compiler.LCNF.LetValue
- const: Lake.Name → List Lean.Level → Array Lean.Compiler.LCNF.Arg → Lean.Compiler.LCNF.LetValue
- fvar: Lean.FVarId → Array Lean.Compiler.LCNF.Arg → Lean.Compiler.LCNF.LetValue
Instances For
Instances For
Instances For
- fvarId : Lean.FVarId
- binderName : Lake.Name
- type : Lean.Expr
- value : Lean.Compiler.LCNF.LetValue
Instances For
- fvarId : Lean.FVarId
- binderName : Lake.Name
- params : Array Lean.Compiler.LCNF.Param
- type : Lean.Expr
- value : Code
Instances For
Instances For
- typeName : Lake.Name
- resultType : Lean.Expr
- discr : Lean.FVarId
- alts : Array (Lean.Compiler.LCNF.AltCore Code)
Instances For
- let: Lean.Compiler.LCNF.LetDecl → Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code
- fun: Lean.Compiler.LCNF.FunDeclCore Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code
- jp: Lean.Compiler.LCNF.FunDeclCore Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code
- jmp: Lean.FVarId → Array Lean.Compiler.LCNF.Arg → Lean.Compiler.LCNF.Code
- cases: Lean.Compiler.LCNF.CasesCore Lean.Compiler.LCNF.Code → Lean.Compiler.LCNF.Code
- return: Lean.FVarId → Lean.Compiler.LCNF.Code
- unreach: Lean.Expr → Lean.Compiler.LCNF.Code
Instances For
Return the constructor names that have an explicit (non-default) alternative.
Instances For
Instances For
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Instances For
Instances For
Low-level update Param
function. It does not update the local context.
Consider using Param.update : Param → Expr → CompilerM Param
if you want the local context
to be updated.
Low-level update LetDecl
function. It does not update the local context.
Consider using LetDecl.update : LetDecl → Expr → Expr → CompilerM LetDecl
if you want the local context
to be updated.
Low-level update FunDecl
function. It does not update the local context.
Consider using FunDecl.update : LetDecl → Expr → Array Param → Code → CompilerM FunDecl
if you want the local context
to be updated.
Instances For
Instances For
Instances For
Return true iff c.size ≤ n
Instances For
Instances For
- name : Lake.Name
The name of the declaration from the
Environment
it came from Universe level parameter names.
- type : Lean.Expr
The type of the declaration. Note that this is an erased LCNF type instead of the fully dependent one that might have been the original type of the declaration in the
Environment
. - params : Array Lean.Compiler.LCNF.Param
Parameters.
- value : Lean.Compiler.LCNF.Code
The body of the declaration, usually changes as it progresses through compiler passes.
- recursive : Bool
We set this flag to true during LCNF conversion. When we receive a block of functions to be compiled, we set this flag to
true
if there is an application to the function in the block containing it. This is an approximation, but it should be good enough because in the frontend, we invoke the compiler with blocks of strongly connected components only. We use this information to control inlining. - safe : Bool
We set this flag to false during LCNF conversion if the Lean function associated with this function was tagged as partial or unsafe. This information affects how static analyzers treat function applications of this kind. See
DefinitionSafety
.partial
andunsafe
functions may not be terminating, but Lean functions terminate, and some static analyzers exploit this fact. So, we use the following semantics. Suppose whe hav a (large) natural numberC
. We consider a nondeterministic model for computation of Lean expressions as follows: Each call to a partial/unsafe function uses up one "recursion token". Prior to consumingC
recursion tokens all partial functions must be called as normal. Once the model has used upC
recursion tokens, a subsequent call to a partial function has the following nondeterministic options: it can either call the function again, or return any value of the target type (even a noncomputable one). Larger values ofC
yield less nondeterminism in the model, but even the intersection of all choices ofC
yields nondeterminism wheredef loop : A := loop
returns any value of typeA
. The compiler fixes a choice forC
. This is a fixed constant greater than 2^2^64, which is allowed to be compiler and architecture dependent, and promises that it will produce an execution consistent with every possible nondeterministic outcome of theC
-model. In the event that different nondeterministic executions disagree, the compiler is required to exhaust resources or output a looping computation. - inlineAttr? : Option Lean.Compiler.InlineAttributeKind
We store the inline attribute at LCNF declarations to make sure we can set them for auxliary declarations created during compilation.
Declaration being processed by the Lean to Lean compiler passes.
Instances For
Instances For
Instances For
Return true
if the given declaration has been annotated with [inline]
, [inline_if_reduce]
, [macro_inline]
, or [always_inline]
Instances For
Equations
- Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl (Lean.Compiler.LCNF.Code.let decl_1 k) = Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl k
- Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl (Lean.Compiler.LCNF.Code.jp decl_1 k) = Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl k
- Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl (Lean.Compiler.LCNF.Code.fun decl_1 k) = Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl k
- Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl (Lean.Compiler.LCNF.Code.cases c) = Array.findIdx? decl.params fun param => param.fvarId == c.discr
- Lean.Compiler.LCNF.Decl.isCasesOnParam?.go decl code = none
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Instances For
Return true
if the arrow type contains an instance implicit argument.
Equations
- Lean.Compiler.LCNF.hasLocalInst (Lean.Expr.forallE binderName binderType b bi) = (Lean.BinderInfo.isInstImplicit bi || Lean.Compiler.LCNF.hasLocalInst b)
- Lean.Compiler.LCNF.hasLocalInst type = false
Instances For
Return true
if decl
is supposed to be inlined/specialized.
Instances For
Instances For
Traverse the given block of potentially mutually recursive functions
and mark a declaration f
as recursive if there is an application
f ...
in the block.
This is an overapproximation, and relies on the fact that our frontend
computes strongly connected components.
See comment at recursive
field.