chore: update stage0

stage0/src/Init/Control/Except.lean

@@ -181,7 +181,8 @@ instance (ε m out) [MonadRun out m] : MonadRun (fun α => out (Except ε α)) (
 ⟨fun α => run⟩
 
 /-- Execute `x` and then execute `finalizer` even if `x` threw an exception -/
-@[inline] def finally {ε α : Type u} {m : Type u → Type v} [Monad m] [MonadExcept ε m] (x : m α) (finalizer : m PUnit) : m α :=
-catch
-  (do a ← x; finalizer; pure a)
-  (fun e => do finalizer; throw e)
+@[inline] def finally {ε α : Type u} {m : Type u → Type v} [Monad m] [MonadExcept ε m] (x : m α) (finalizer : m PUnit) : m α := do
+r ← catch (Except.ok <$> x) (fun ex => @pure m _ _ $ Except.error ex);
+match r with
+| Except.ok a => finalizer *> pure a
+| Except.error e => finalizer *> throw e

stage0/src/Lean/Elab/CollectFVars.lean

@@ -0,0 +1,41 @@
+/-
+Copyright (c) 2020 Microsoft Corporation. All rights reserved.
+Released under Apache 2.0 license as described in the file LICENSE.
+Authors: Leonardo de Moura, Sebastian Ullrich
+-/
+import Lean.Util.CollectFVars
+import Lean.Elab.Term
+
+namespace Lean
+namespace Elab
+namespace Term
+
+def collectUsedFVars (ref : Syntax) (used : CollectFVars.State) (e : Expr) : TermElabM CollectFVars.State := do
+e ← Term.instantiateMVars ref e;
+pure $ collectFVars used e
+
+def collectUsedFVarsAtFVars (ref : Syntax) (used : CollectFVars.State) (fvars : Array Expr) : TermElabM CollectFVars.State :=
+fvars.foldlM
+  (fun used fvar => do
+    fvarType ← Term.inferType ref fvar;
+    collectUsedFVars ref used fvarType)
+  used
+
+def removeUnused (ref : Syntax) (vars : Array Expr) (used : CollectFVars.State) : TermElabM (LocalContext × LocalInstances × Array Expr) := do
+localInsts ← Term.getLocalInsts;
+lctx ← Term.getLCtx;
+(lctx, localInsts, newVars, _) ← vars.foldrM
+  (fun var (result : LocalContext × LocalInstances × Array Expr × CollectFVars.State) =>
+    let (lctx, localInsts, newVars, used) := result;
+    if used.fvarSet.contains var.fvarId! then do
+      varType ← Term.inferType ref var;
+      used ← Term.collectUsedFVars ref used varType;
+      pure (lctx, localInsts, newVars.push var, used)
+    else
+      pure (lctx.erase var.fvarId!, localInsts.erase var.fvarId!, newVars, used))
+  (lctx, localInsts, #[], used);
+pure (lctx, localInsts, newVars.reverse)
+
+end Term
+end Elab
+end Lean

stage0/src/Lean/Elab/Command.lean

@@ -249,6 +249,9 @@ _root_.dbgTrace (toString a) $ fun _ => pure ()
 def setEnv (newEnv : Environment) : CommandElabM Unit :=
 modify $ fun s => { s with env := newEnv }
 
+@[inline] def modifyEnv (f : Environment → Environment) : CommandElabM Unit :=
+modify $ fun s => { s with env := f s.env }
+
 def getCurrNamespace : CommandElabM Name := do
 scope ← getScope; pure scope.currNamespace
 
@@ -636,7 +639,7 @@ else
   let optUnivDeclStx := declId.getArg 1;
   (id, optUnivDeclStx)
 
-@[inline] def withDeclId (declId : Syntax) (f : Name → CommandElabM Unit) : CommandElabM Unit := do
+def withDeclId {α} (declId : Syntax) (f : Name → CommandElabM α) : CommandElabM α := do
 -- ident >> optional (".{" >> sepBy1 ident ", " >> "}")
 let (id, optUnivDeclStx) := expandDeclId declId;
 savedLevelNames ← getLevelNames;
@@ -669,15 +672,23 @@ match scpView.name with
 
 /--
   Sort the given list of `usedParams` using the following order:
-  - If it is an explicit level `explicitParams`, then use user given order.
+  - If it is an explicit level `allUserParams`, then use user given order.
   - Otherwise, use lexicographical.
 
+  Remark: `scopeParams` are the universe params introduced using the `universe` command. `allUserParams` contains
+  the universe params introduced using the `universe` command *and* the `.{...}` notation.
+
+  Remark: this function return an exception if there is an `u` not in `usedParams`, that is in `allUserParams` but not in `scopeParams`.
+
   Remark: `explicitParams` are in reverse declaration order. That is, the head is the last declared parameter. -/
-def sortDeclLevelParams (explicitParams : List Name) (usedParams : Array Name) : List Name :=
-let result := explicitParams.foldl (fun result levelName => if usedParams.elem levelName then levelName :: result else result) [];
-let remaining := usedParams.filter (fun levelParam => !explicitParams.elem levelParam);
-let remaining := remaining.qsort Name.lt;
-result ++ remaining.toList
+def sortDeclLevelParams (scopeParams : List Name) (allUserParams : List Name) (usedParams : Array Name) : Except String (List Name) :=
+match allUserParams.find? $ fun u => !usedParams.contains u && !scopeParams.elem u with
+| some u => throw ("unused universe parameter '" ++ toString u ++ "'")
+| none   =>
+  let result := allUserParams.foldl (fun result levelName => if usedParams.elem levelName then levelName :: result else result) [];
+  let remaining := usedParams.filter (fun levelParam => !allUserParams.elem levelParam);
+  let remaining := remaining.qsort Name.lt;
+  pure $ result ++ remaining.toList
 
 end Command
 end Elab

stage0/src/Lean/Elab/DeclModifiers.lean

@@ -15,6 +15,8 @@ structure Attribute :=
 instance Attribute.hasFormat : HasFormat Attribute :=
 ⟨fun attr => Format.bracket "@[" (toString attr.name ++ (if attr.args.isMissing then "" else toString attr.args)) "]"⟩
 
+instance Attribute.inhabited : Inhabited Attribute := ⟨{ name := arbitrary _ }⟩
+
 inductive Visibility
 | regular | «protected» | «private»
 
@@ -32,6 +34,14 @@ structure Modifiers :=
 (isUnsafe        : Bool := false)
 (attrs           : Array Attribute := #[])
 
+def Modifiers.isPrivate : Modifiers → Bool
+| { visibility := Visibility.private, .. } => true
+| _                                        => false
+
+def Modifiers.isProtected : Modifiers → Bool
+| { visibility := Visibility.protected, .. } => true
+| _                                          => false
+
 def Modifiers.addAttribute (modifiers : Modifiers) (attr : Attribute) : Modifiers :=
 { modifiers with attrs := modifiers.attrs.push attr }
 
@@ -105,15 +115,6 @@ pure {
   attrs           := attrs
 }
 
-def mkDeclName (modifiers : Modifiers) (atomicName : Name) : CommandElabM Name := do
-currNamespace ← getCurrNamespace;
-let declName := currNamespace ++ atomicName;
-match modifiers.visibility with
-| Visibility.private => do
-  env ← getEnv;
-  pure $ mkPrivateName env declName
-| _                  => pure declName
-
 def checkNotAlreadyDeclared (ref : Syntax) (declName : Name) : CommandElabM Unit := do
 env ← getEnv;
 when (env.contains declName) $
@@ -128,6 +129,28 @@ match privateToUserName? declName with
   when (env.contains declName) $
     throwError ref ("a non-private declaration '" ++ declName ++ "' has already been declared")
 
+def applyVisibility (ref : Syntax) (visibility : Visibility) (declName : Name) : CommandElabM Name :=
+match visibility with
+| Visibility.private => do
+  env ← getEnv;
+  let declName := mkPrivateName env declName;
+  checkNotAlreadyDeclared ref declName;
+  pure declName
+| Visibility.protected => do
+  checkNotAlreadyDeclared ref declName;
+  env ← getEnv;
+  let env := addProtected env declName;
+  setEnv env;
+  pure declName
+| _                  => do
+  checkNotAlreadyDeclared ref declName;
+  pure declName
+
+def mkDeclName (ref : Syntax) (modifiers : Modifiers) (atomicName : Name) : CommandElabM Name := do
+currNamespace ← getCurrNamespace;
+let declName := currNamespace ++ atomicName;
+applyVisibility ref modifiers.visibility declName
+
 def applyAttributes (ref : Syntax) (declName : Name) (attrs : Array Attribute) (applicationTime : AttributeApplicationTime) : CommandElabM Unit :=
 attrs.forM $ fun attr => do
  env ← getEnv;

stage0/src/Lean/Elab/Declaration.lean

@@ -89,57 +89,107 @@ elabDefLike {
   declId := declId, binders := binders, type? := some type, val := stx.getArg 2
 }
 
-def elabAxiom (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit :=
+def elabAxiom (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit := do
 -- parser! "axiom " >> declId >> declSig
 let declId             := stx.getArg 1;
 let (binders, typeStx) := expandDeclSig (stx.getArg 2);
+scopeLevelNames ← getLevelNames;
 withDeclId declId $ fun name => do
-  declName          ← mkDeclName modifiers name;
+  declName          ← mkDeclName declId modifiers name;
   applyAttributes stx declName modifiers.attrs AttributeApplicationTime.beforeElaboration;
-  explictLevelNames ← getLevelNames;
+  allUserLevelNames ← getLevelNames;
   decl ← runTermElabM declName $ fun vars => Term.elabBinders binders.getArgs $ fun xs => do {
     type ← Term.elabType typeStx;
     Term.synthesizeSyntheticMVars false;
     type ← Term.instantiateMVars typeStx type;
     type ← Term.mkForall typeStx xs type;
     (type, _) ← Term.mkForallUsedOnly typeStx vars type;
-    type ← Term.levelMVarToParam type;
+    (type, _) ← Term.levelMVarToParam type;
     let usedParams  := (collectLevelParams {} type).params;
-    let levelParams := sortDeclLevelParams explictLevelNames usedParams;
-    pure $ Declaration.axiomDecl {
-      name     := declName,
-      lparams  := levelParams,
-      type     := type,
-      isUnsafe := modifiers.isUnsafe
-    }
-  };
+    match sortDeclLevelParams scopeLevelNames allUserLevelNames usedParams with
+    | Except.error msg      => Term.throwError stx msg
+    | Except.ok levelParams =>
+      pure $ Declaration.axiomDecl {
+        name     := declName,
+        lparams  := levelParams,
+        type     := type,
+        isUnsafe := modifiers.isUnsafe
+      }
+    };
   addDecl stx decl;
   applyAttributes stx declName modifiers.attrs AttributeApplicationTime.afterTypeChecking;
   applyAttributes stx declName modifiers.attrs AttributeApplicationTime.afterCompilation
 
+private def checkValidInductiveModifier (ref : Syntax) (modifiers : Modifiers) : CommandElabM Unit := do
+when modifiers.isNoncomputable $
+  throwError ref "invalid use of 'noncomputable' in inductive declaration";
+when modifiers.isPartial $
+  throwError ref "invalid use of 'partial' in inductive declaration";
+unless (modifiers.attrs.size == 0 || (modifiers.attrs.size == 1 && (modifiers.attrs.get! 0).name == `class)) $
+  throwError ref "invalid use of attributes in inductive declaration";
+pure ()
+
+private def checkValidCtorModifier (ref : Syntax) (modifiers : Modifiers) : CommandElabM Unit := do
+when modifiers.isNoncomputable $
+  throwError ref "invalid use of 'noncomputable' in constructor declaration";
+when modifiers.isPartial $
+  throwError ref "invalid use of 'partial' in constructor declaration";
+when modifiers.isUnsafe $
+  throwError ref "invalid use of 'unsafe' in constructor declaration";
+when (modifiers.attrs.size != 0) $
+  throwError ref "invalid use of attributes in constructor declaration";
+pure ()
+
 /-
-parser! "inductive " >> declId >> optDeclSig >> many introRule
-parser! try ("class " >> "inductive ") >> declId >> optDeclSig >> many introRule
+parser! "inductive " >> declId >> optDeclSig >> many ctor
+parser! try ("class " >> "inductive ") >> declId >> optDeclSig >> many ctor
 
 Remark: numTokens == 1 for regular `inductive` and 2 for `class inductive`.
 -/
-private def inductiveSyntaxToView (modifiers : Modifiers) (decl : Syntax) (numTokens := 1) : InductiveView :=
+private def inductiveSyntaxToView (modifiers : Modifiers) (decl : Syntax) (numTokens := 1) : CommandElabM InductiveView := do
+checkValidInductiveModifier decl modifiers;
 let (binders, type?) := expandOptDeclSig (decl.getArg (numTokens + 1));
-{ ref        := decl,
-  modifiers  := modifiers,
-  declId     := decl.getArg numTokens,
-  binders    := binders,
-  type?      := type?,
-  introRules := (decl.getArg (numTokens + 2)).getArgs }
+let declId           := decl.getArg numTokens;
+withDeclId declId fun name => do
+  levelNames ← getLevelNames;
+  declName   ← mkDeclName declId modifiers name;
+  ctors      ← (decl.getArg (numTokens + 2)).getArgs.mapM fun ctor => do {
+    -- def ctor := parser! " | " >> declModifiers >> ident >> optional inferMod >> optDeclSig
+    ctorModifiers ← elabModifiers (ctor.getArg 1);
+    when (ctorModifiers.isPrivate && modifiers.isPrivate) $
+      throwError ctor "invalid 'private' constructor in a 'private' inductive datatype";
+    when (ctorModifiers.isProtected && modifiers.isPrivate) $
+      throwError ctor "invalid 'protected' constructor in a 'private' inductive datatype";
+    checkValidCtorModifier ctor ctorModifiers;
+    let ctorName := ctor.getIdAt 2;
+    let ctorName := declName ++ ctorName;
+    ctorName ← applyVisibility (ctor.getArg 2) ctorModifiers.visibility ctorName;
+    let inferMod := !(ctor.getArg 3).isNone;
+    let (binders, type?) := expandOptDeclSig (ctor.getArg 4);
+    pure { ref := ctor, modifiers := ctorModifiers, declName := ctorName, inferMod := inferMod, binders := binders, type? := type? : CtorView }
+  };
+  pure {
+    ref           := decl,
+    modifiers     := modifiers,
+    shortDeclName := name,
+    declName      := declName,
+    levelNames    := levelNames,
+    binders       := binders,
+    type?         := type?,
+    ctors         := ctors
+  }
 
-private def classInductiveSyntaxToView (modifiers : Modifiers) (decl : Syntax) : InductiveView :=
+private def classInductiveSyntaxToView (modifiers : Modifiers) (decl : Syntax) : CommandElabM InductiveView :=
 inductiveSyntaxToView modifiers decl 2
 
-def elabInductive (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit :=
-elabInductiveCore #[inductiveSyntaxToView modifiers stx]
+def elabInductive (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit := do
+v ← inductiveSyntaxToView modifiers stx;
+elabInductiveCore #[v]
 
-def elabClassInductive (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit :=
-elabInductiveCore #[classInductiveSyntaxToView modifiers stx]
+def elabClassInductive (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit := do
+let modifiers := modifiers.addAttribute { name := `class };
+v ← classInductiveSyntaxToView modifiers stx;
+elabInductiveCore #[v]
 
 def elabStructure (modifiers : Modifiers) (stx : Syntax) : CommandElabM Unit :=
 pure () -- TODO
@@ -183,7 +233,7 @@ private def isMutualInductive (stx : Syntax) : Bool :=
 private def elabMutualInductive (elems : Array Syntax) : CommandElabM Unit := do
 views ← elems.mapM $ fun stx => do {
    modifiers ← elabModifiers (stx.getArg 0);
-   pure $ inductiveSyntaxToView modifiers (stx.getArg 1)
+   inductiveSyntaxToView modifiers (stx.getArg 1)
 };
 elabInductiveCore views
 

stage0/src/Lean/Elab/Definition.lean

@@ -6,7 +6,7 @@ Authors: Leonardo de Moura, Sebastian Ullrich
 import Std.ShareCommon
 import Lean.Util.CollectLevelParams
 import Lean.Util.FoldConsts
-import Lean.Util.CollectFVars
+import Lean.Elab.CollectFVars
 import Lean.Elab.DeclModifiers
 import Lean.Elab.Binders
 
@@ -40,49 +40,26 @@ structure DefView :=
 (type?         : Option Syntax)
 (val           : Syntax)
 
-def collectUsedFVars (ref : Syntax) (used : CollectFVars.State) (e : Expr) : TermElabM CollectFVars.State := do
-e ← Term.instantiateMVars ref e;
-pure $ collectFVars used e
-
-def collectUsedFVarsAtFVars (ref : Syntax) (used : CollectFVars.State) (fvars : Array Expr) : TermElabM CollectFVars.State :=
-fvars.foldlM
-  (fun used fvar => do
-    fvarType ← Term.inferType ref fvar;
-    collectUsedFVars ref used fvarType)
-  used
-
-def removeUnused (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (eType : Expr)
+private def removeUnused (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (eType : Expr)
     : TermElabM (LocalContext × LocalInstances × Array Expr) := do
 let used : CollectFVars.State := {};
-used ← collectUsedFVars ref used eType;
-used ← collectUsedFVars ref used e;
-used ← collectUsedFVarsAtFVars ref used xs;
-localInsts ← Term.getLocalInsts;
-lctx ← Term.getLCtx;
-(lctx, localInsts, newVars, _) ← vars.foldrM
-  (fun var (result : LocalContext × LocalInstances × Array Expr × CollectFVars.State) =>
-    let (lctx, localInsts, newVars, used) := result;
-    if used.fvarSet.contains var.fvarId! then do
-      varType ← Term.inferType ref var;
-      used ← collectUsedFVars ref used varType;
-      pure (lctx, localInsts, newVars.push var, used)
-    else
-      pure (lctx.erase var.fvarId!, localInsts.erase var.fvarId!, newVars, used))
-  (lctx, localInsts, #[], used);
-pure (lctx, localInsts, newVars.reverse)
+used ← Term.collectUsedFVars ref used eType;
+used ← Term.collectUsedFVars ref used e;
+used ← Term.collectUsedFVarsAtFVars ref used xs;
+Term.removeUnused ref vars used
 
-def withUsedWhen {α} (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (eType : Expr) (cond : Bool) (k : Array Expr → TermElabM α) : TermElabM α :=
+private def withUsedWhen {α} (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (eType : Expr) (cond : Bool) (k : Array Expr → TermElabM α) : TermElabM α :=
 if cond then do
  (lctx, localInsts, vars) ← removeUnused ref vars xs e eType;
  Term.withLCtx lctx localInsts $ k vars
 else
  k vars
 
-def withUsedWhen' {α} (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (cond : Bool) (k : Array Expr → TermElabM α) : TermElabM α :=
+private def withUsedWhen' {α} (ref : Syntax) (vars : Array Expr) (xs : Array Expr) (e : Expr) (cond : Bool) (k : Array Expr → TermElabM α) : TermElabM α :=
 let dummyExpr := mkSort levelOne;
 withUsedWhen ref vars xs e dummyExpr cond k
 
-def mkDef (view : DefView) (declName : Name) (explictLevelNames : List Name) (vars : Array Expr) (xs : Array Expr) (type : Expr) (val : Expr)
+def mkDef (view : DefView) (declName : Name) (scopeLevelNames allUserLevelNames : List Name) (vars : Array Expr) (xs : Array Expr) (type : Expr) (val : Expr)
     : TermElabM (Option Declaration) := do
 let ref := view.ref;
 Term.synthesizeSyntheticMVars;
@@ -96,8 +73,8 @@ else withUsedWhen ref vars xs val type view.kind.isDefOrAbbrevOrOpaque $ fun var
   type ← Term.mkForall ref vars type;
   val  ← Term.mkLambda ref xs val;
   val  ← Term.mkLambda ref vars val;
-  type ← Term.levelMVarToParam type;
-  val  ← Term.levelMVarToParam val;
+  (type, nextParamIdx) ← Term.levelMVarToParam type;
+  (val,  _) ← Term.levelMVarToParam val nextParamIdx;
   type ← Term.instantiateMVars ref type;
   val  ← Term.instantiateMVars view.val val;
   let shareCommonTypeVal : Std.ShareCommonM (Expr × Expr) := do {
@@ -110,25 +87,27 @@ else withUsedWhen ref vars xs val type view.kind.isDefOrAbbrevOrOpaque $ fun var
   let usedParams : CollectLevelParams.State := {};
   let usedParams  := collectLevelParams usedParams type;
   let usedParams  := collectLevelParams usedParams val;
-  let levelParams := sortDeclLevelParams explictLevelNames usedParams.params;
-  match view.kind with
-  | DefKind.theorem =>
-    -- TODO theorem elaboration in parallel
-    pure $ some $ Declaration.thmDecl { name := declName, lparams := levelParams, type := type, value := Task.pure val }
-  | DefKind.opaque  =>
-    pure $ some $ Declaration.opaqueDecl { name := declName, lparams := levelParams, type := type, value := val, isUnsafe := view.modifiers.isUnsafe }
-  | DefKind.abbrev =>
-    pure $ some $ Declaration.defnDecl {
-      name := declName, lparams := levelParams, type := type, value := val,
-      hints := ReducibilityHints.abbrev,
-      isUnsafe := view.modifiers.isUnsafe }
-  | DefKind.def => do
-    env ← Term.getEnv;
-    pure $ some $ Declaration.defnDecl {
-      name := declName, lparams := levelParams, type := type, value := val,
-      hints := ReducibilityHints.regular (getMaxHeight env val + 1),
-      isUnsafe := view.modifiers.isUnsafe }
-  | _ => unreachable!
+  match sortDeclLevelParams scopeLevelNames allUserLevelNames usedParams.params with
+  | Except.error msg      => Term.throwError ref msg
+  | Except.ok levelParams =>
+    match view.kind with
+    | DefKind.theorem =>
+      -- TODO theorem elaboration in parallel
+      pure $ some $ Declaration.thmDecl { name := declName, lparams := levelParams, type := type, value := Task.pure val }
+    | DefKind.opaque  =>
+      pure $ some $ Declaration.opaqueDecl { name := declName, lparams := levelParams, type := type, value := val, isUnsafe := view.modifiers.isUnsafe }
+    | DefKind.abbrev =>
+      pure $ some $ Declaration.defnDecl {
+        name := declName, lparams := levelParams, type := type, value := val,
+        hints := ReducibilityHints.abbrev,
+        isUnsafe := view.modifiers.isUnsafe }
+    | DefKind.def => do
+      env ← Term.getEnv;
+      pure $ some $ Declaration.defnDecl {
+        name := declName, lparams := levelParams, type := type, value := val,
+        hints := ReducibilityHints.regular (getMaxHeight env val + 1),
+        isUnsafe := view.modifiers.isUnsafe }
+    | _ => unreachable!
 
 def elabDefVal (defVal : Syntax) (expectedType : Expr) : TermElabM Expr := do
 let kind := defVal.getKind;
@@ -140,13 +119,13 @@ else if kind == `Lean.Parser.Command.declValEqns then
 else
   Term.throwUnsupportedSyntax
 
-def elabDefLike (view : DefView) : CommandElabM Unit :=
+def elabDefLike (view : DefView) : CommandElabM Unit := do
 let ref := view.ref;
+scopeLevelNames ← getLevelNames;
 withDeclId view.declId $ fun name => do
-  declName          ← mkDeclName view.modifiers name;
-  checkNotAlreadyDeclared ref declName;
+  declName          ← mkDeclName view.declId view.modifiers name;
   applyAttributes ref declName view.modifiers.attrs AttributeApplicationTime.beforeElaboration;
-  explictLevelNames ← getLevelNames;
+  allUserLevelNames ← getLevelNames;
   decl? ← runTermElabM declName $ fun vars => Term.elabBinders view.binders.getArgs $ fun xs =>
     match view.type? with
     | some typeStx => do
@@ -155,11 +134,11 @@ withDeclId view.declId $ fun name => do
       type ← Term.instantiateMVars typeStx type;
       withUsedWhen' ref vars xs type view.kind.isTheorem $ fun vars => do
         val  ← elabDefVal view.val type;
-        mkDef view declName explictLevelNames vars xs type val
+        mkDef view declName scopeLevelNames allUserLevelNames vars xs type val
     | none => do {
       type ← Term.mkFreshTypeMVar view.binders;
       val  ← elabDefVal view.val type;
-      mkDef view declName explictLevelNames vars xs type val
+      mkDef view declName scopeLevelNames allUserLevelNames vars xs type val
     };
   match decl? with
   | none      => pure ()

stage0/src/Lean/Elab/Inductive.lean

@@ -3,45 +3,476 @@ Copyright (c) 2020 Microsoft Corporation. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
 -/
+import Lean.Util.ReplaceLevel
+import Lean.Util.ReplaceExpr
+import Lean.Util.CollectLevelParams
+import Lean.Util.Constructions
 import Lean.Elab.Command
+import Lean.Elab.CollectFVars
 import Lean.Elab.Definition
 
 namespace Lean
 namespace Elab
 namespace Command
 
+structure CtorView :=
+(ref       : Syntax)
+(modifiers : Modifiers)
+(inferMod  : Bool)  -- true if `{}` is used in the constructor declaration
+(declName  : Name)
+(binders   : Syntax)
+(type?     : Option Syntax)
+
+instance CtorView.inhabited : Inhabited CtorView :=
+⟨{ ref := arbitrary _, modifiers := {}, inferMod := false, declName := arbitrary _, binders := arbitrary _, type? := none }⟩
+
 structure InductiveView :=
 (ref           : Syntax)
 (modifiers     : Modifiers)
-(declId        : Syntax)
+(shortDeclName : Name)
+(declName      : Name)
+(levelNames    : List Name)
 (binders       : Syntax)
 (type?         : Option Syntax)
-(introRules    : Array Syntax)
+(ctors         : Array CtorView)
 
 instance InductiveView.inhabited : Inhabited InductiveView :=
-⟨{ ref := arbitrary _, modifiers := {}, declId := arbitrary _, binders := arbitrary _, type? := none, introRules := #[] }⟩
+⟨{ ref := arbitrary _, modifiers := {}, shortDeclName := arbitrary _, declName := arbitrary _,
+   levelNames := [], binders := arbitrary _, type? := none, ctors := #[] }⟩
 
-def mkInductive (ref : Syntax) (declName : Name) (explictLevelNames : List Name) (vars : Array Expr) (xs : Array Expr) (type : Expr) (intros : Array Syntax)
-    : TermElabM Declaration := do
-Term.throwError ref ref
+structure ElabHeaderResult :=
+(view       : InductiveView)
+(lctx       : LocalContext)
+(localInsts : LocalInstances)
+(params     : Array Expr)
+(type       : Expr)
+
+instance ElabHeaderResult.inhabited : Inhabited ElabHeaderResult :=
+⟨{ view := arbitrary _, lctx := arbitrary _, localInsts := arbitrary _, params := #[], type := arbitrary _ }⟩
+
+private partial def elabHeaderAux (views : Array InductiveView)
+    : Nat → Array ElabHeaderResult → TermElabM (Array ElabHeaderResult)
+| i, acc =>
+  if h : i < views.size then
+    let view := views.get ⟨i, h⟩;
+    Term.elabBinders view.binders.getArgs fun params => do
+      lctx ← Term.getLCtx;
+      localInsts ← Term.getLocalInsts;
+      match view.type? with
+      | none         => do
+        u ← Term.mkFreshLevelMVar view.ref;
+        let type := mkSort (mkLevelSucc u);
+        elabHeaderAux (i+1) (acc.push { lctx := lctx, localInsts := localInsts, params := params, type := type, view := view })
+      | some typeStx => do
+        type ← Term.elabTerm typeStx none;
+        unlessM (Term.isTypeFormerType view.ref type) $
+          Term.throwError typeStx "invalid inductive type, resultant type is not a sort";
+        elabHeaderAux (i+1) (acc.push { lctx := lctx, localInsts := localInsts, params := params, type := type, view := view })
+  else
+    pure acc
+
+private def checkNumParams (rs : Array ElabHeaderResult) : TermElabM Nat := do
+let numParams := (rs.get! 0).params.size;
+rs.forM fun r => unless (r.params.size == numParams) $
+  Term.throwError r.view.ref "invalid inductive type, number of parameters mismatch in mutually inductive datatypes";
+pure numParams
+
+private def checkUnsafe (rs : Array ElabHeaderResult) : TermElabM Unit :=
+let isUnsafe := (rs.get! 0).view.modifiers.isUnsafe;
+rs.forM fun r => unless (r.view.modifiers.isUnsafe == isUnsafe) $
+  Term.throwError r.view.ref "invalid inductive type, cannot mix unsafe and safe declarations in a mutually inductive datatypes"
+
+private def checkLevelNames (views : Array InductiveView) : TermElabM Unit :=
+when (views.size > 1) do
+  let levelNames := (views.get! 0).levelNames;
+  views.forM fun view => unless (view.levelNames == levelNames) $
+    Term.throwError view.ref "invalid inductive type, universe parameters mismatch in mutually inductive datatypes"
+
+private def mkTypeFor (r : ElabHeaderResult) : TermElabM Expr := do
+Term.withLocalContext r.lctx r.localInsts do
+  Term.mkForall r.view.ref r.params r.type
+
+private def throwUnexpectedInductiveType {α} (ref : Syntax) : TermElabM α :=
+Term.throwError ref "unexpected inductive resulting type"
+
+-- Given `e` of the form `forall As, B`, return `B`.
+private def getResultingType (ref : Syntax) (e : Expr) : TermElabM Expr :=
+Term.liftMetaM ref $ Meta.forallTelescopeReducing e fun _ r => pure r
+
+private def eqvFirstTypeResult (firstType type : Expr) : MetaM Bool :=
+Meta.forallTelescopeReducing firstType fun _ firstTypeResult => Meta.isDefEq firstTypeResult type
+
+-- Auxiliary function for checking whether the types in mutually inductive declaration are compatible.
+private partial def checkParamsAndResultType (ref : Syntax) (numParams : Nat) : Nat → Expr → Expr → TermElabM Unit
+| i, type, firstType => do
+  type ← Term.whnf ref type;
+  if i < numParams then do
+    firstType ← Term.whnf ref firstType;
+    match type, firstType with
+    | Expr.forallE n₁ d₁ b₁ c₁, Expr.forallE n₂ d₂ b₂ c₂ => do
+      unless (n₁ == n₂) $
+        let msg : MessageData :=
+          "invalid mutually inductive types, parameter name mismatch '" ++ n₁ ++ "', expected '" ++ n₂ ++ "'";
+        Term.throwError ref msg;
+      unlessM (Term.isDefEq ref d₁ d₂) $
+        let msg : MessageData :=
+          "invalid mutually inductive types, type mismatch at parameter '" ++ n₁ ++ "'" ++ indentExpr d₁
+          ++ Format.line ++ "expected type" ++ indentExpr d₂;
+        Term.throwError ref msg;
+      unless (c₁.binderInfo == c₂.binderInfo) $
+        -- TODO: improve this error message?
+        Term.throwError ref ("invalid mutually inductive types, binder annotation mismatch at parameter '" ++ n₁ ++ "'");
+      Term.withLocalDecl ref n₁ c₁.binderInfo d₁ fun x =>
+        let type      := b₁.instantiate1 x;
+        let firstType := b₂.instantiate1 x;
+        checkParamsAndResultType (i+1) type firstType
+    | _, _ => throwUnexpectedInductiveType ref
+  else
+    match type with
+    | Expr.forallE n d b c =>
+      Term.withLocalDecl ref n c.binderInfo d fun x =>
+        let type      := b.instantiate1 x;
+        checkParamsAndResultType (i+1) type firstType
+    | Expr.sort _ _        =>
+      unlessM (Term.liftMetaM ref $ eqvFirstTypeResult firstType type) $
+        let msg : MessageData :=
+          "invalid mutually inductive types, resulting universe mismatch, given " ++ indentExpr type ++ Format.line ++ "expected type" ++ indentExpr firstType;
+        Term.throwError ref msg
+    | _ => throwUnexpectedInductiveType ref
+
+-- Auxiliary function for checking whether the types in mutually inductive declaration are compatible.
+private def checkHeader (r : ElabHeaderResult) (numParams : Nat) (firstType? : Option Expr) : TermElabM Expr := do
+type ← mkTypeFor r;
+match firstType? with
+| none           => pure type
+| some firstType => do
+  checkParamsAndResultType r.view.ref numParams 0 type firstType;
+  pure firstType
+
+-- Auxiliary function for checking whether the types in mutually inductive declaration are compatible.
+private partial def checkHeaders (rs : Array ElabHeaderResult) (numParams : Nat) : Nat → Option Expr → TermElabM Unit
+| i, firstType? => when (i < rs.size) do
+  type ← checkHeader (rs.get! i) numParams firstType?;
+  checkHeaders (i+1) type
+
+private def elabHeader (views : Array InductiveView) : TermElabM (Array ElabHeaderResult) := do
+rs ← elabHeaderAux views 0 #[];
+when (rs.size > 1) do {
+  checkUnsafe rs;
+  numParams ← checkNumParams rs;
+  checkHeaders rs numParams 0 none
+};
+pure rs
+
+private partial def withInductiveLocalDeclsAux {α} (ref : Syntax) (namesAndTypes : Array (Name × Expr)) (params : Array Expr)
+    (x : Array Expr → Array Expr → TermElabM α) : Nat → Array Expr → TermElabM α
+| i, indFVars =>
+  if h : i < namesAndTypes.size then do
+    let (id, type) := namesAndTypes.get ⟨i, h⟩;
+    type ← Term.liftMetaM ref (Meta.instantiateForall type params);
+    Term.withLocalDecl ref id BinderInfo.default type fun indFVar => withInductiveLocalDeclsAux (i+1) (indFVars.push indFVar)
+  else
+    x params indFVars
+
+/- Create a local declaration for each inductive type in `rs`, and execute `x params indFVars`, where `params` are the inductive type parameters and
+   `indFVars` are the new local declarations.
+   We use the the local context/instances and parameters of rs[0].
+   Note that this method is executed after we executed `checkHeaders` and established all
+   parameters are compatible. -/
+private def withInductiveLocalDecls {α} (rs : Array ElabHeaderResult) (x : Array Expr → Array Expr → TermElabM α) : TermElabM α := do
+namesAndTypes ← rs.mapM fun r => do {
+  type ← mkTypeFor r;
+  pure (r.view.shortDeclName, type)
+};
+let r0     := rs.get! 0;
+let params := r0.params;
+Term.withLocalContext r0.lctx r0.localInsts $
+  withInductiveLocalDeclsAux r0.view.ref namesAndTypes params x 0 #[]
+
+private def isInductiveFamily (ref : Syntax) (indFVar : Expr) : TermElabM Bool := do
+indFVarType ← Term.inferType ref indFVar;
+indFVarType ← Term.whnf ref indFVarType;
+pure !indFVarType.isSort
+
+/-
+  Elaborate constructor types.
+
+  Remark: we check whether the resulting type is correct, but
+  we do not check for:
+  - Positivity (it is a rare failure, and the kernel already checks for it).
+  - Universe constraints (the kernel checks for it). -/
+private def elabCtors (indFVar : Expr) (params : Array Expr) (r : ElabHeaderResult) : TermElabM (List Constructor) := do
+let ref := r.view.ref;
+indFamily ← isInductiveFamily ref indFVar;
+r.view.ctors.toList.mapM fun ctorView => Term.elabBinders ctorView.binders.getArgs fun ctorParams => do
+  let ref := ctorView.ref;
+  type ← match ctorView.type? with
+    | none          => do
+      when indFamily $
+        Term.throwError ref "constructor resulting type must be specified in inductive family declaration";
+      pure indFVar
+    | some ctorType => do {
+      type ← Term.elabTerm ctorType none;
+      resultingType ← getResultingType ref type;
+      unless (resultingType.getAppFn == indFVar) $
+        Term.throwError ref ("unexpected constructor resulting type" ++ indentExpr resultingType);
+      unlessM (Term.isType ref resultingType) $
+        Term.throwError ref ("unexpected constructor resulting type, type expected" ++ indentExpr resultingType);
+      pure type
+    };
+  type ← Term.mkForall ref ctorParams type;
+  type ← Term.mkForall ref params type;
+  pure { name := ctorView.declName, type := type }
+
+/- Convert universe metavariables occurring in the `indTypes` into new parameters.
+   Remark: if the resulting inductive datatype has universe metavariables, we will fix it later using
+   `inferResultingUniverse`. -/
+private def levelMVarToParamAux (ref : Syntax) (indTypes : List InductiveType) : StateT Nat TermElabM (List InductiveType) :=
+indTypes.mapM fun indType => do
+  type  ← liftM $ Term.instantiateMVars ref indType.type;
+  type  ← Term.levelMVarToParam' type;
+  ctors ← indType.ctors.mapM fun ctor => do {
+    ctorType ← liftM $ Term.instantiateMVars ref ctor.type;
+    ctorType ← Term.levelMVarToParam' ctorType;
+    pure { ctor with type := ctorType }
+  };
+  pure { indType with ctors := ctors, type := type }
+
+private def levelMVarToParam (ref : Syntax) (indTypes : List InductiveType) : TermElabM (List InductiveType) :=
+(levelMVarToParamAux ref indTypes).run' 1
+
+private def getResultingUniverse (ref : Syntax) : List InductiveType → TermElabM Level
+| []           => Term.throwError ref "unexpected empty inductive declaration"
+| indType :: _ => do
+  r ← getResultingType ref indType.type;
+  match r with
+  | Expr.sort u _ => pure u
+  | _             => Term.throwError ref "unexpected inductive type resulting type"
+
+private def tmpIndParam := mkLevelParam `_tmp_ind_univ_param
+
+/--
+  Return true if the resulting universe level is of the form `?m + k`.
+  Return false if the resulting universe level does not contain universe metavariables.
+  Throw exeception otherwise. -/
+private def shouldInferResultUniverse (ref : Syntax) (indTypes : List InductiveType) : TermElabM Bool := do
+u ← getResultingUniverse ref indTypes;
+u ← Term.instantiateLevelMVars ref u;
+if u.hasMVar then
+  match u.getLevelOffset with
+  | Level.mvar mvarId _ => do
+    Term.assignLevelMVar mvarId tmpIndParam;
+    pure true
+  | _ =>
+    Term.throwError ref $
+      "cannot infer resulting universe level of inductive datatype, given level contains metavariables " ++ mkSort u ++ ", provide universe explicitly"
+else
+  pure false
+
+/-
+  Auxiliary function for `updateResultingUniverse`
+  `addLevel u r rOffset us` add `u` components to `us` if they are not already there and it is different from the resulting universe level `r+rOffset`.
+  If `u` is a `max`, then its components are recursively processed.
+  If `u` is a `succ` and `rOffset > 0`, we process the `u`s child using `rOffset-1`.
+
+  This method is used to infer the resulting universe level of an inductive datatype. -/
+private def addLevel : Level → Level → Nat → Array Level → Except String (Array Level)
+| Level.max u v _, r, rOffset,   us => do us ← addLevel u r rOffset us; addLevel v r rOffset us
+| Level.zero _,    _, _,         us => pure us
+| Level.succ u _,  r, rOffset+1, us => addLevel u r rOffset us
+| u,               r, rOffset,   us =>
+  if rOffset == 0 && u == r then pure us
+  else if r.occurs u then throw "failed to compute resulting universe level of inductive datatype, provide universe explicitly"
+  else if us.contains u then pure us
+  else pure (us.push u)
+
+/- Auxiliary function for `updateResultingUniverse` -/
+private partial def collectUniversesFromCtorTypeAux (ref : Syntax) (r : Level) (rOffset : Nat) : Nat → Expr → Array Level → TermElabM (Array Level)
+| 0,   Expr.forallE n d b c, us => do
+  u ← Term.getLevel ref d;
+  u ← Term.instantiateLevelMVars ref u;
+  match addLevel u r rOffset us with
+  | Except.error msg => Term.throwError ref msg
+  | Except.ok us     => Term.withLocalDecl ref n c.binderInfo d $ fun x =>
+    let e := b.instantiate1 x;
+    collectUniversesFromCtorTypeAux 0 e us
+| i+1, Expr.forallE n d b c, us => do
+  Term.withLocalDecl ref n c.binderInfo d $ fun x =>
+    let e := b.instantiate1 x;
+    collectUniversesFromCtorTypeAux i e us
+| _, _, us => pure us
+
+/- Auxiliary function for `updateResultingUniverse` -/
+private partial def collectUniversesFromCtorType
+    (ref : Syntax) (r : Level) (rOffset : Nat) (ctorType : Expr) (numParams : Nat) (us : Array Level) : TermElabM (Array Level) :=
+collectUniversesFromCtorTypeAux ref r rOffset numParams ctorType us
+
+/- Auxiliary function for `updateResultingUniverse` -/
+private partial def collectUniverses (ref : Syntax) (r : Level) (rOffset : Nat) (numParams : Nat) (indTypes : List InductiveType) : TermElabM (Array Level) :=
+indTypes.foldlM
+  (fun us indType => indType.ctors.foldlM
+    (fun us ctor => collectUniversesFromCtorType ref r rOffset ctor.type numParams us)
+    us)
+  #[]
+
+private def updateResultingUniverse (ref : Syntax) (numParams : Nat) (indTypes : List InductiveType) : TermElabM (List InductiveType) := do
+r ← getResultingUniverse ref indTypes;
+let rOffset : Nat   := r.getOffset;
+let r       : Level := r.getLevelOffset;
+unless (r.isParam) $
+  Term.throwError ref "failed to compute resulting universe level of inductive datatype, provide universe explicitly";
+us ← collectUniverses ref r rOffset numParams indTypes;
+let rNew := Level.mkNaryMax us.toList;
+pure $ indTypes.map fun indType =>
+  let type := indType.type.replaceLevel fun u => if u == tmpIndParam then some rNew else none;
+  { indType with type := type }
+
+private def traceIndTypes (indTypes : List InductiveType) : TermElabM Unit :=
+indTypes.forM fun indType =>
+  indType.ctors.forM fun ctor => _root_.dbgTrace ("  >> " ++ toString ctor.name ++ " : " ++ toString ctor.type) fun _ => pure ()
+
+private def removeUnused (ref : Syntax) (vars : Array Expr) (indTypes : List InductiveType) : TermElabM (LocalContext × LocalInstances × Array Expr) := do
+used ← indTypes.foldlM
+  (fun (used : CollectFVars.State) indType => do
+    used ← Term.collectUsedFVars ref used indType.type;
+    indType.ctors.foldlM (fun (used : CollectFVars.State) ctor => Term.collectUsedFVars ref used ctor.type) used)
+  {};
+Term.removeUnused ref vars used
+
+private def withUsed {α} (ref : Syntax) (vars : Array Expr) (indTypes : List InductiveType) (k : Array Expr → TermElabM α) : TermElabM α := do
+(lctx, localInsts, vars) ← removeUnused ref vars indTypes;
+Term.withLCtx lctx localInsts $ k vars
+
+private def updateParams (ref : Syntax) (vars : Array Expr) (indTypes : List InductiveType) : TermElabM (List InductiveType) :=
+indTypes.mapM fun indType => do
+  type ← Term.mkForall ref vars indType.type;
+  ctors ← indType.ctors.mapM fun ctor => do {
+    ctorType ← Term.mkForall ref vars ctor.type;
+    pure { ctor with type := ctorType }
+  };
+  pure { indType with type := type, ctors := ctors }
+
+private def collectLevelParamsInInductive (indTypes : List InductiveType) : Array Name :=
+let usedParams := indTypes.foldl
+  (fun (usedParams : CollectLevelParams.State) indType =>
+    let usedParams := collectLevelParams usedParams indType.type;
+    indType.ctors.foldl
+      (fun (usedParams : CollectLevelParams.State) ctor => collectLevelParams usedParams ctor.type)
+      usedParams)
+  {};
+usedParams.params
+
+private def mkIndFVar2Const (views : Array InductiveView) (indFVars : Array Expr) (levelNames : List Name) : ExprMap Expr :=
+let levelParams := levelNames.map mkLevelParam;
+views.size.fold
+  (fun i (m : ExprMap Expr) =>
+    let view    := views.get! i;
+    let indFVar := indFVars.get! i;
+    m.insert indFVar (mkConst view.declName levelParams))
+  {}
+
+private def replaceIndFVarsWithConsts (views : Array InductiveView) (indFVars : Array Expr) (levelNames : List Name) (numParams : Nat) (indTypes : List InductiveType)
+    : TermElabM (List InductiveType) :=
+let ref           := (views.get! 0).ref;
+let indFVar2Const := mkIndFVar2Const views indFVars levelNames;
+indTypes.mapM fun indType => do
+  ctors ← indType.ctors.mapM fun ctor => do {
+    type ← Term.liftMetaM ref $ Meta.forallBoundedTelescope ctor.type numParams fun params type => do {
+      let type := type.replace fun e => if !e.isFVar then none else
+        match indFVar2Const.find? e with
+        | some c => some $ mkAppN c params
+        | none   => none;
+      Meta.mkForall params type
+    };
+    pure { ctor with type := type }
+  };
+  pure { indType with ctors := ctors }
+
+abbrev Ctor2InferMod := Std.HashMap Name Bool
+
+private def mkCtor2InferMod (views : Array InductiveView) : Ctor2InferMod :=
+views.foldl
+  (fun (m : Ctor2InferMod) view => view.ctors.foldl
+    (fun (m : Ctor2InferMod) ctorView => m.insert ctorView.declName ctorView.inferMod)
+    m)
+  {}
+
+private def applyInferMod (views : Array InductiveView) (numParams : Nat) (indTypes : List InductiveType) : List InductiveType :=
+let ctor2InferMod := mkCtor2InferMod views;
+indTypes.map fun indType =>
+  let ctors := indType.ctors.map fun ctor =>
+    let inferMod := ctor2InferMod.find! ctor.name; -- true if `{}` was used
+    let ctorType := ctor.type.inferImplicit numParams !inferMod;
+    { ctor with type := ctorType };
+  { indType with ctors := ctors }
+
+private def mkInductiveDecl (vars : Array Expr) (views : Array InductiveView) : TermElabM Declaration := do
+let view0             := views.get! 0;
+scopeLevelNames ← Term.getLevelNames;
+checkLevelNames views;
+let allUserLevelNames := view0.levelNames;
+let isUnsafe          := view0.modifiers.isUnsafe;
+let ref               := view0.ref;
+adaptReader (fun (ctx : Term.Context) => { ctx with levelNames := allUserLevelNames }) do
+  rs ← elabHeader views;
+  withInductiveLocalDecls rs fun params indFVars => do
+    let numExplicitParams := params.size;
+    indTypes ← views.size.foldM
+      (fun i (indTypes : List InductiveType) => do
+        let indFVar := indFVars.get! i;
+        let r       := rs.get! i;
+        type  ← Term.mkForall ref params r.type;
+        ctors ← elabCtors indFVar params r;
+        let indType := { name := r.view.declName, type := type, ctors := ctors : InductiveType };
+        pure (indType :: indTypes))
+      [];
+    let indTypes := indTypes.reverse;
+    Term.synthesizeSyntheticMVars false;  -- resolve pending
+    inferLevel ← shouldInferResultUniverse ref indTypes;
+    withUsed ref vars indTypes $ fun vars => do
+      let numParams := vars.size + numExplicitParams;
+      indTypes ← updateParams ref vars indTypes;
+      indTypes ← levelMVarToParam ref indTypes;
+      indTypes ← if inferLevel then updateResultingUniverse ref numParams indTypes else pure indTypes;
+      let usedLevelNames := collectLevelParamsInInductive indTypes;
+      match sortDeclLevelParams scopeLevelNames allUserLevelNames usedLevelNames with
+      | Except.error msg      => Term.throwError ref msg
+      | Except.ok levelParams => do
+        indTypes ← replaceIndFVarsWithConsts views indFVars levelParams numParams indTypes;
+        let indTypes := applyInferMod views numParams indTypes;
+        pure $ Declaration.inductDecl levelParams numParams indTypes isUnsafe
+
+private def mkAuxConstructions (views : Array InductiveView) : CommandElabM Unit := do
+env ← getEnv;
+let hasEq   := env.contains `Eq;
+let hasHEq  := env.contains `HEq;
+let hasUnit := env.contains `PUnit;
+let hasProd := env.contains `Prod;
+views.forM fun view => do {
+  let n := view.declName;
+  modifyEnv fun env => mkRecOn env n;
+  when hasUnit $ modifyEnv fun env => mkCasesOn env n;
+  when (hasUnit && hasEq && hasHEq) $ modifyEnv fun env => mkNoConfusion env n;
+  when (hasUnit && hasProd) $ modifyEnv fun env => mkBelow env n;
+  when (hasUnit && hasProd) $ modifyEnv fun env => mkIBelow env n;
+  pure ()
+};
+views.forM fun view => do {
+  let n := view.declName;
+  when (hasUnit && hasProd) $ modifyEnv fun env => mkBRecOn env n;
+  when (hasUnit && hasProd) $ modifyEnv fun env => mkBInductionOn env n;
+  pure ()
+}
 
 def elabInductiveCore (views : Array InductiveView) : CommandElabM Unit := do
-let ref := (views.get! 0).ref;
-throwError ref ("WIP\n" ++ toString (views.map (fun (v : InductiveView) => v.ref)))
--- pure ()
-/-
-withDeclId declId $ fun name => do
-  declName          ← mkDeclName modifiers name;
-  checkNotAlreadyDeclared ref declName;
-  applyAttributes ref declName modifiers.attrs AttributeApplicationTime.beforeElaboration;
-  explictLevelNames ← getLevelNames;
-  decl ← runTermElabM declName $ fun vars => Term.elabBinders binders.getArgs $ fun xs => do {
-    -- TODO
-    pure ()
-  };
-
-  throwError ref (ref ++ "\n" ++ toString explictLevelNames)
--/
+let view0 := views.get! 0;
+let ref   := view0.ref;
+decl ← runTermElabM view0.declName $ fun vars => mkInductiveDecl vars views;
+addDecl ref decl;
+mkAuxConstructions views;
+-- We need to invoke `applyAttributes` because `class` is implemented as an attribute.
+views.forM fun view => applyAttributes ref view.declName view.modifiers.attrs AttributeApplicationTime.afterTypeChecking;
+pure ()
 
 end Command
 end Elab

stage0/src/Lean/Elab/Term.lean

@@ -123,6 +123,7 @@ def getMCtx : TermElabM MetavarContext := do s ← get; pure s.mctx
 def getLCtx : TermElabM LocalContext := do ctx ← read; pure ctx.lctx
 def getLocalInsts : TermElabM LocalInstances := do ctx ← read; pure ctx.localInstances
 def getOptions : TermElabM Options := do ctx ← read; pure ctx.config.opts
+def getLevelNames : TermElabM (List Name) := do ctx ← read; pure ctx.levelNames
 def setEnv (env : Environment) : TermElabM Unit := modify $ fun s => { s with env := env }
 def setMCtx (mctx : MetavarContext) : TermElabM Unit := modify $ fun s => { s with mctx := mctx }
 
@@ -194,6 +195,7 @@ def setTraceState (traceState : TraceState) : TermElabM Unit := modify $ fun s =
 def isExprMVarAssigned (mvarId : MVarId) : TermElabM Bool := do mctx ← getMCtx; pure $ mctx.isExprAssigned mvarId
 def getMVarDecl (mvarId : MVarId) : TermElabM MetavarDecl := do mctx ← getMCtx; pure $ mctx.getDecl mvarId
 def assignExprMVar (mvarId : MVarId) (val : Expr) : TermElabM Unit := modify $ fun s => { s with mctx := s.mctx.assignExpr mvarId val }
+def assignLevelMVar (mvarId : MVarId) (val : Level) : TermElabM Unit := modify $ fun s => { s with mctx := s.mctx.assignLevel mvarId val }
 
 def logTrace (cls : Name) (ref : Syntax) (msg : MessageData) : TermElabM Unit := do
 ctx ← read;
@@ -247,14 +249,17 @@ fun ctx s =>
 def ppGoal (ref : Syntax) (mvarId : MVarId) : TermElabM Format := liftMetaM ref $ Meta.ppGoal mvarId
 def isType (ref : Syntax) (e : Expr) : TermElabM Bool := liftMetaM ref $ Meta.isType e
 def isTypeFormer (ref : Syntax) (e : Expr) : TermElabM Bool := liftMetaM ref $ Meta.isTypeFormer e
+def isTypeFormerType (ref : Syntax) (e : Expr) : TermElabM Bool := liftMetaM ref $ Meta.isTypeFormerType e
 def isDefEqNoConstantApprox (ref : Syntax) (t s : Expr) : TermElabM Bool := liftMetaM ref $ Meta.approxDefEq $ Meta.isDefEq t s
 def isDefEq (ref : Syntax) (t s : Expr) : TermElabM Bool := liftMetaM ref $ Meta.fullApproxDefEq $ Meta.isDefEq t s
+def isLevelDefEq (ref : Syntax) (u v : Level) : TermElabM Bool := liftMetaM ref $ Meta.isLevelDefEq u v
 def inferType (ref : Syntax) (e : Expr) : TermElabM Expr := liftMetaM ref $ Meta.inferType e
 def whnf (ref : Syntax) (e : Expr) : TermElabM Expr := liftMetaM ref $ Meta.whnf e
 def whnfForall (ref : Syntax) (e : Expr) : TermElabM Expr := liftMetaM ref $ Meta.whnfForall e
 def whnfCore (ref : Syntax) (e : Expr) : TermElabM Expr := liftMetaM ref $ Meta.whnfCore e
 def unfoldDefinition? (ref : Syntax) (e : Expr) : TermElabM (Option Expr) := liftMetaM ref $ Meta.unfoldDefinition? e
 def instantiateMVars (ref : Syntax) (e : Expr) : TermElabM Expr := liftMetaM ref $ Meta.instantiateMVars e
+def instantiateLevelMVars (ref : Syntax) (u : Level) : TermElabM Level := liftMetaM ref $ Meta.instantiateLevelMVars u
 def isClass (ref : Syntax) (t : Expr) : TermElabM (Option Name) := liftMetaM ref $ Meta.isClass t
 def mkFreshLevelMVar (ref : Syntax) : TermElabM Level := liftMetaM ref $ Meta.mkFreshLevelMVar
 def mkFreshExprMVar (ref : Syntax) (type? : Option Expr := none) (kind : MetavarKind := MetavarKind.natural) (userName? : Name := Name.anonymous) : TermElabM Expr :=
@@ -329,13 +334,25 @@ adaptReader (fun (ctx : Context) => { ctx with mayPostpone := false }) x
 def mkExplicitBinder (ident : Syntax) (type : Syntax) : Syntax :=
 mkNode `Lean.Parser.Term.explicitBinder #[mkAtom "(", mkNullNode #[ident], mkNullNode #[mkAtom ":", type], mkNullNode, mkAtom ")"]
 
-/-- Convert unassigned universe level metavariables into parameters. -/
-def levelMVarToParam (e : Expr) : TermElabM Expr := do
+/--
+  Convert unassigned universe level metavariables into parameters.
+  The new parameter names are of the form `u_i` where `i >= nextParamIdx`.
+  The method returns the updated expression and new `nextParamIdx`.
+
+  Remark: we make sure the generated parameter names do not clash with the universes at `ctx.levelNames`. -/
+def levelMVarToParam (e : Expr) (nextParamIdx : Nat := 1) : TermElabM (Expr × Nat) := do
 ctx ← read;
 mctx ← getMCtx;
-let r := mctx.levelMVarToParam (fun n => ctx.levelNames.elem n) e;
+let r := mctx.levelMVarToParam (fun n => ctx.levelNames.elem n) e `u nextParamIdx;
 modify $ fun s => { s with mctx := r.mctx };
-pure r.expr
+pure (r.expr, r.nextParamIdx)
+
+/-- Variant of `levelMVarToParam` where `nextParamIdx` is stored in a state monad. -/
+def levelMVarToParam' (e : Expr) : StateT Nat TermElabM Expr := do
+nextParamIdx ← get;
+(e, nextParamIdx) ← liftM $ levelMVarToParam e nextParamIdx;
+set nextParamIdx;
+pure e
 
 /--
   Auxiliary method for creating fresh binder names.
@@ -887,6 +904,14 @@ finally x (modify $ fun s => { s with cache := { s.cache with synthInstance := s
 @[inline] def resettingSynthInstanceCacheWhen {α} (b : Bool) (x : TermElabM α) : TermElabM α :=
 if b then resettingSynthInstanceCache x else x
 
+def withLocalContext {α} (lctx : LocalContext) (localInsts : LocalInstances) (x : TermElabM α) : TermElabM α := do
+localInstsCurr ← getLocalInsts;
+adaptReader (fun (ctx : Context) => { ctx with lctx := lctx, localInstances := localInsts }) $
+  if localInsts == localInstsCurr then
+    x
+  else
+    resettingSynthInstanceCache x
+
 /--
   Execute `x` using the given metavariable's `LocalContext` and `LocalInstances`.
   The type class resolution cache is flushed when executing `x` if its `LocalInstances` are

stage0/src/Lean/Environment.lean

@@ -29,13 +29,24 @@ structure Import :=
 instance : HasToString Import :=
 ⟨fun imp => toString imp.module ++ if imp.runtimeOnly then " (runtime)" else ""⟩
 
+/--
+  A compacted region holds multiple Lean objects in a contiguous memory region, which can be read/written to/from disk.
+  Objects inside the region do not have reference counters and cannot be freed individually. The contents of .olean
+  files are compacted regions. -/
+def CompactedRegion := USize
+
+/-- Free a compacted region and its contents. No live references to the contents may exist at the time of invocation. -/
+@[extern 2 "lean_compacted_region_free"]
+unsafe constant CompactedRegion.free : CompactedRegion → IO Unit := arbitrary _
+
 /- Environment fields that are not used often. -/
 structure EnvironmentHeader :=
 (trustLevel   : UInt32       := 0)
 (quotInit     : Bool         := false)
 (mainModule   : Name         := arbitrary _)
 (imports      : Array Import := #[]) -- direct imports
-(moduleNames  : NameSet      := {})  -- all imported .lean modules
+(regions      : Array CompactedRegion := #[]) -- compacted regions of all imported modules
+(moduleNames  : NameSet      := {})  -- names of all imported modules
 
 open Std (HashMap)
 
@@ -447,7 +458,29 @@ instance ModuleData.inhabited : Inhabited ModuleData :=
 @[extern 3 "lean_save_module_data"]
 constant saveModuleData (fname : @& String) (m : ModuleData) : IO Unit := arbitrary _
 @[extern 2 "lean_read_module_data"]
-constant readModuleData (fname : @& String) : IO ModuleData := arbitrary _
+constant readModuleData (fname : @& String) : IO (ModuleData × CompactedRegion) := arbitrary _
+
+/--
+  Free compacted regions of imports. No live references to imported objects may exist at the time of invocation; in
+  particular, `env` should be the last reference to any `Environment` derived from these imports. -/
+@[noinline, export lean_environment_free_regions]
+unsafe def Environment.freeRegions (env : Environment) : IO Unit :=
+/-
+  NOTE: This assumes `env` is not inferred as a borrowed parameter, and is freed after extracting the `header` field.
+  Otherwise, we would encounter undefined behavior when the constant map in `env`, which may reference objects in
+  compacted regions, is freed after the regions.
+
+  In the currently produced IR, we indeed see:
+  ```
+    def Lean.Environment.freeRegions (x_1 : obj) (x_2 : obj) : obj :=
+      let x_3 : obj := proj[3] x_1;
+      inc x_3;
+      dec x_1;
+      ...
+  ```
+
+  TODO: statically check for this. -/
+env.header.regions.forM CompactedRegion.free
 
 def mkModuleData (env : Environment) : IO ModuleData := do
 pExts ← persistentEnvExtensionsRef.get;
@@ -470,20 +503,21 @@ pure {
 def writeModule (env : Environment) (fname : String) : IO Unit := do
 modData ← mkModuleData env; saveModuleData fname modData
 
-partial def importModulesAux : List Import → (NameSet × Array ModuleData) → IO (NameSet × Array ModuleData)
+partial def importModulesAux : List Import → (NameSet × Array ModuleData × Array CompactedRegion) → IO (NameSet × Array ModuleData × Array CompactedRegion)
 | [],    r         => pure r
-| i::is, (s, mods) =>
+| i::is, (s, mods, regions) =>
   if i.runtimeOnly || s.contains i.module then
-    importModulesAux is (s, mods)
+    importModulesAux is (s, mods, regions)
   else do
     let s := s.insert i.module;
     mFile ← findOLean i.module;
     unlessM (IO.fileExists mFile) $
       throw $ IO.userError $ "object file '" ++ mFile ++ "' of module " ++ toString i.module ++ " does not exist";
-    mod ← readModuleData mFile;
-    (s, mods) ← importModulesAux mod.imports.toList (s, mods);
+    (mod, region) ← readModuleData mFile;
+    (s, mods, regions) ← importModulesAux mod.imports.toList (s, mods, regions);
     let mods := mods.push mod;
-    importModulesAux is (s, mods)
+    let regions := regions.push region;
+    importModulesAux is (s, mods, regions)
 
 private partial def getEntriesFor (mod : ModuleData) (extId : Name) : Nat → Array EnvExtensionState
 | i =>
@@ -510,7 +544,7 @@ pExtDescrs.iterateM env $ fun _ extDescr env => do
 
 @[export lean_import_modules]
 def importModules (imports : List Import) (trustLevel : UInt32 := 0) : IO Environment := do
-(moduleNames, mods) ← importModulesAux imports ({}, #[]);
+(moduleNames, mods, regions) ← importModulesAux imports ({}, #[], #[]);
 let const2ModIdx := mods.iterate {} $ fun (modIdx) (mod : ModuleData) (m : HashMap Name ModuleIdx) =>
   mod.constants.iterate m $ fun _ cinfo m =>
     m.insert cinfo.name modIdx.val;
@@ -529,6 +563,7 @@ let env : Environment := {
     quotInit     := !imports.isEmpty, -- We assume `core.lean` initializes quotient module
     trustLevel   := trustLevel,
     imports      := imports.toArray,
+    regions      := regions,
     moduleNames  := moduleNames
   }
 };
@@ -537,6 +572,13 @@ env ← finalizePersistentExtensions env;
 env ← mods.iterateM env $ fun _ mod env => performModifications env mod.serialized;
 pure env
 
+/--
+  Create environment object from imports and free compacted regions after calling `act`. No live references to the
+  environment object or imported objects may exist after `act` finishes. -/
+unsafe def withImportModules {α : Type} (imports : List Import) (trustLevel : UInt32 := 0) (x : Environment → IO α) : IO α := do
+env ← importModules imports trustLevel;
+finally (x env) env.freeRegions
+
 def regNamespacesExtension : IO (SimplePersistentEnvExtension Name NameSet) :=
 registerSimplePersistentEnvExtension {
   name            := `namespaces,

stage0/src/Lean/Expr.lean

@@ -551,6 +551,11 @@ def bindingBody! : Expr → Expr
 | lam _ _ b _     => b
 | _               => panic! "binding expected"
 
+def bindingInfo! : Expr → BinderInfo
+| forallE _ _ _ c => c.binderInfo
+| lam _ _ _ c     => c.binderInfo
+| _               => panic! "binding expected"
+
 def letName! : Expr → Name
 | letE n _ _ _ _ => n
 | _              => panic! "let expression expected"
@@ -565,6 +570,11 @@ e.looseBVarRange > 0
 @[extern "lean_expr_has_loose_bvar"]
 constant hasLooseBVar (e : @& Expr) (bvarIdx : @& Nat) : Bool := arbitrary _
 
+/-- Return true if `e` contains the loose bound variable `bvarIdx` in an explicit parameter, or in the range if `tryRange == true`. -/
+def hasLooseBVarInExplicitDomain : Expr → Nat → Bool → Bool
+| Expr.forallE _ d b c, bvarIdx, tryRange => (c.binderInfo.isExplicit && hasLooseBVar d bvarIdx) || hasLooseBVarInExplicitDomain b (bvarIdx+1) tryRange
+| e, bvarIdx, tryRange                    => tryRange && hasLooseBVar e bvarIdx
+
 /--
   Lower the loose bound variables `>= s` in `e` by `d`.
   That is, a loose bound variable `bvar i`.
@@ -579,6 +589,22 @@ constant lowerLooseBVars (e : @& Expr) (s d : @& Nat) : Expr := arbitrary _
 @[extern "lean_expr_lift_loose_bvars"]
 constant liftLooseBVars (e : @& Expr) (s d : @& Nat) : Expr := arbitrary _
 
+/--
+  `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`.
+-/
+def inferImplicit : Expr → Nat → Bool → Expr
+| Expr.forallE n d b c, i+1, considerRange =>
+  let b       := inferImplicit b i considerRange;
+  let newInfo := if c.binderInfo.isExplicit && hasLooseBVarInExplicitDomain b 0 considerRange then BinderInfo.implicit else c.binderInfo;
+  mkForall n newInfo d b
+| e, 0, _ => e
+| e, _, _ => e
+
 /-- Instantiate the loose bound variables in `e` using `subst`.
     That is, a loose `Expr.bvar i` is replaced with `subst[i]`. -/
 @[extern "lean_expr_instantiate"]

stage0/src/Lean/Level.lean

@@ -360,6 +360,7 @@ def dec : Level → Option Level
    If `dec l₂` succeeds, then `imax l₁ l₂` is equivalent to `max l₁ l₂`. -/
 | imax l₁ l₂ _ => mkLevelMax <$> dec l₁ <*> dec l₂
 
+
 /- Level to Format -/
 namespace LevelToFormat
 inductive Result
@@ -452,6 +453,13 @@ match lvl with
 | imax lhs rhs d => updateIMax (imax lhs rhs d) newLhs newRhs rfl
 | _              => panic! "imax level expected"
 
+def mkNaryMax : List Level → Level
+| []    => levelZero
+| [u]   => u
+| u::us => mkLevelMax u (mkNaryMax us)
+
+/- Level to Format -/
+
 @[specialize] def instantiateParams (s : Name → Option Level) : Level → Level
 | u@(zero _)       => u
 | u@(succ v _)     => if u.hasParam then u.updateSucc (instantiateParams v) rfl else u

stage0/src/Lean/Meta/Basic.lean

@@ -834,6 +834,21 @@ type ← inferType value;
 let type := type.headBeta;
 mkAuxDefinition name type value
 
+private partial def instantiateForallAux (ps : Array Expr) : Nat → Expr → MetaM Expr
+| i, e =>
+  if h : i < ps.size then do
+    let p := ps.get ⟨i, h⟩;
+    e ← whnf e;
+    match e with
+    | Expr.forallE _ _ b _ => instantiateForallAux (i+1) (b.instantiate1 p)
+    | _                    => throw (Exception.other "invalid instantiateForall, too many parameters")
+  else
+    pure e
+
+/- Given `e` of the form `forall (a_1 : A_1) ... (a_n : A_n), B[a_1, ..., a_n]` and `p_1 : A_1, ... p_n : A_n`, return `B[p_1, ..., p_n]`. -/
+def instantiateForall (e : Expr) (ps : Array Expr) : MetaM Expr :=
+instantiateForallAux ps 0 e
+
 @[init] private def regTraceClasses : IO Unit := do
 registerTraceClass `Meta;
 registerTraceClass `Meta.debug

stage0/src/Lean/Meta/InferType.lean

@@ -326,14 +326,14 @@ match r with
   | Expr.sort _ _ => pure true
   | _             => pure false
 
-partial def isTypeFormerAux : Expr → MetaM Bool
+partial def isTypeFormerType : Expr → MetaM Bool
 | type => do
   type ← whnfD type;
   match type with
   | Expr.sort _ _ => pure true
   | Expr.forallE n d b c =>
     withLocalDecl n d c.binderInfo $ fun fvar =>
-    isTypeFormerAux (b.instantiate1 fvar)
+    isTypeFormerType (b.instantiate1 fvar)
   | _ => pure false
 
 /--
@@ -341,7 +341,7 @@ partial def isTypeFormerAux : Expr → MetaM Bool
   Remark: it subsumes `isType` -/
 def isTypeFormer (e : Expr) : MetaM Bool := do
 type ← inferType e;
-isTypeFormerAux type
+isTypeFormerType type
 
 end Meta
 end Lean

stage0/src/Lean/MetavarContext.lean

@@ -1035,7 +1035,7 @@ structure UnivMVarParamResult :=
 def levelMVarToParam (mctx : MetavarContext) (alreadyUsedPred : Name → Bool) (e : Expr) (paramNamePrefix : Name := `u) (nextParamIdx : Nat := 1)
     : UnivMVarParamResult :=
 let (e, s) := LevelMVarToParam.main e { paramNamePrefix := paramNamePrefix, alreadyUsedPred := alreadyUsedPred } { mctx := mctx, nextParamIdx := nextParamIdx };
-{ mctx          := mctx,
+{ mctx          := s.mctx,
   newParamNames := s.paramNames,
   nextParamIdx  := s.nextParamIdx,
   expr          := e }

stage0/src/Lean/Parser/Command.lean

@@ -54,9 +54,9 @@ def «instance»       := parser! "instance " >> optional declId >> declSig >> d
 def «axiom»          := parser! "axiom " >> declId >> declSig
 def «example»        := parser! "example " >> declSig >> declVal
 def inferMod         := parser! try ("{" >> "}")
-def introRule        := parser! " | " >> ident >> optional inferMod >> optDeclSig
-def «inductive»      := parser! "inductive " >> declId >> optDeclSig >> many introRule
-def classInductive   := parser! try ("class " >> "inductive ") >> declId >> optDeclSig >> many introRule
+def ctor             := parser! " | " >> declModifiers >> ident >> optional inferMod >> optDeclSig
+def «inductive»      := parser! "inductive " >> declId >> optDeclSig >> many ctor
+def classInductive   := parser! try ("class " >> "inductive ") >> declId >> optDeclSig >> many ctor
 def structExplicitBinder := parser! "(" >> many ident >> optional inferMod >> optDeclSig >> optional Term.binderDefault >> ")"
 def structImplicitBinder := parser! "{" >> many ident >> optional inferMod >> optDeclSig >> "}"
 def structInstBinder     := parser! "[" >> many ident >> optional inferMod >> optDeclSig >> "]"

stage0/src/Lean/Util.lean

@@ -18,4 +18,6 @@ import Lean.Util.Trace
 import Lean.Util.WHNF
 import Lean.Util.FindExpr
 import Lean.Util.ReplaceExpr
+import Lean.Util.ReplaceLevel
 import Lean.Util.FoldConsts
+import Lean.Util.Constructions

stage0/src/Lean/Util/Constructions.lean

@@ -0,0 +1,18 @@
+/-
+Copyright (c) 2020 Microsoft Corporation. All rights reserved.
+Released under Apache 2.0 license as described in the file LICENSE.
+Authors: Leonardo de Moura
+-/
+import Lean.Environment
+
+namespace Lean
+
+@[extern "lean_mk_cases_on"] constant mkCasesOn (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_rec_on"] constant mkRecOn (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_no_confusion"] constant mkNoConfusion (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_below"] constant mkBelow (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_ibelow"] constant mkIBelow (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_brec_on"] constant mkBRecOn (env : Environment) (name : @& Name) : Environment := env
+@[extern "lean_mk_binduction_on"] constant mkBInductionOn (env : Environment) (name : @& Name) : Environment := env
+
+end Lean

stage0/src/Lean/Util/ReplaceLevel.lean

@@ -0,0 +1,80 @@
+/-
+Copyright (c) 2020 Microsoft Corporation. All rights reserved.
+Released under Apache 2.0 license as described in the file LICENSE.
+Authors: Leonardo de Moura
+-/
+import Lean.Expr
+
+namespace Lean
+namespace Level
+
+partial def replace (f? : Level → Option Level) : Level → Level
+| u =>
+  match f? u with
+  | some v => v
+  | none   => match u with
+    | max v₁ v₂  _ => mkLevelMax (replace v₁) (replace v₂)
+    | imax v₁ v₂ _ => mkLevelIMax (replace v₁) (replace v₂)
+    | succ v _     => mkLevelSucc (replace v)
+    | _            => u
+
+end Level
+
+namespace Expr
+
+namespace ReplaceLevelImpl
+
+abbrev cacheSize : USize := 8192
+
+structure State :=
+(keys    : Array Expr) -- Remark: our "unsafe" implementation relies on the fact that `()` is not a valid Expr
+(results : Array Expr)
+
+abbrev ReplaceM := StateM State
+
+@[inline] unsafe def cache (i : USize) (key : Expr) (result : Expr) : ReplaceM Expr := do
+modify $ fun s => { keys := s.keys.uset i key lcProof, results := s.results.uset i result lcProof };
+pure result
+
+@[specialize] unsafe def replaceUnsafeM (f? : Level → Option Level) (size : USize) : Expr → ReplaceM Expr
+| e => do
+  c ← get;
+  let h := ptrAddrUnsafe e;
+  let i := h % size;
+  if ptrAddrUnsafe (c.keys.uget i lcProof) == h then
+    pure $ c.results.uget i lcProof
+  else match e with
+      | Expr.forallE _ d b _   => do d ← replaceUnsafeM d; b ← replaceUnsafeM b; cache i e $ e.updateForallE! d b
+      | Expr.lam _ d b _       => do d ← replaceUnsafeM d; b ← replaceUnsafeM b; cache i e $ e.updateLambdaE! d b
+      | Expr.mdata _ b _       => do b ← replaceUnsafeM b; cache i e $ e.updateMData! b
+      | Expr.letE _ t v b _    => do t ← replaceUnsafeM t; v ← replaceUnsafeM v; b ← replaceUnsafeM b; cache i e $ e.updateLet! t v b
+      | Expr.app f a _         => do f ← replaceUnsafeM f; a ← replaceUnsafeM a; cache i e $ e.updateApp! f a
+      | Expr.proj _ _ b _      => do b ← replaceUnsafeM b; cache i e $ e.updateProj! b
+      | Expr.sort u _          => cache i e $ e.updateSort! (u.replace f?)
+      | Expr.const n us _      => cache i e $ e.updateConst! (us.map (Level.replace f?))
+      | Expr.localE _ _ _ _    => unreachable!
+      | e                      => pure e
+
+unsafe def initCache : State :=
+{ keys    := mkArray cacheSize.toNat (cast lcProof ()), -- `()` is not a valid `Expr`
+  results := mkArray cacheSize.toNat (arbitrary _) }
+
+@[inline] unsafe def replaceUnsafe (f? : Level → Option Level) (e : Expr) : Expr :=
+(replaceUnsafeM f? cacheSize e).run' initCache
+
+end ReplaceLevelImpl
+
+@[implementedBy ReplaceLevelImpl.replaceUnsafe]
+partial def replaceLevel (f? : Level → Option Level) : Expr → Expr
+| e@(Expr.forallE _ d b _)   => let d := replaceLevel d; let b := replaceLevel b; e.updateForallE! d b
+| e@(Expr.lam _ d b _)       => let d := replaceLevel d; let b := replaceLevel b; e.updateLambdaE! d b
+| e@(Expr.mdata _ b _)       => let b := replaceLevel b; e.updateMData! b
+| e@(Expr.letE _ t v b _)    => let t := replaceLevel t; let v := replaceLevel v; let b := replaceLevel b; e.updateLet! t v b
+| e@(Expr.app f a _)         => let f := replaceLevel f; let a := replaceLevel a; e.updateApp! f a
+| e@(Expr.proj _ _ b _)      => let b := replaceLevel b; e.updateProj! b
+| e@(Expr.sort u _)          => e.updateSort! (u.replace f?)
+| e@(Expr.const n us _)      => e.updateConst! (us.map (Level.replace f?))
+| e                          => e
+
+end Expr
+end Lean

stage0/src/lean.mk.in

@@ -19,6 +19,7 @@ BIN_NAME = $(PKG)
 STATIC_LIB_NAME = lib$(PKG).a
 LEAN_OPTS = @LEAN_EXTRA_MAKE_OPTS@
 LEANC_OPTS = -O3 -DNDEBUG
+LINK_OPTS =
 
 SRCS = $(shell find $(PKG) -name '*.lean' 2> /dev/null || true; find $(PKG).lean 2> /dev/null)
 DEPS = $(addprefix $(TEMP_OUT)/,$(SRCS:.lean=.depend))
@@ -73,7 +74,7 @@ $(BIN_OUT)/$(BIN_NAME): $(addprefix $(TEMP_OUT)/,$(SRCS:.lean=.o)) | $(BIN_OUT)
 ifdef CMAKE_LIKE_OUTPUT
 	@echo "[    ] Linking $@"
 endif
-	leanc -o "$@" -x none $^
+	leanc -o "$@" -x none $^ $(LINK_OPTS)
 
 $(LIB_OUT)/$(STATIC_LIB_NAME): $(addprefix $(TEMP_OUT)/,$(SRCS:.lean=.o)) | $(LIB_OUT)
 	@rm -f $@

stage0/src/library/constructions/brec_on.cpp

@@ -354,4 +354,38 @@ environment mk_brec_on(environment const & env, name const & n) {
 
 environment mk_binduction_on(environment const & env, name const & n) {
     return mk_brec_on(env, n, true);
-}}
+}
+
+extern "C" object * lean_mk_below(object * env, object * n) {
+    try {
+        return mk_below(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
+
+extern "C" object * lean_mk_ibelow(object * env, object * n) {
+    try {
+        return mk_ibelow(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
+
+extern "C" object * lean_mk_brec_on(object * env, object * n) {
+    try {
+        return mk_brec_on(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
+
+extern "C" object * lean_mk_binduction_on(object * env, object * n) {
+    try {
+        return mk_binduction_on(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
+
+}

stage0/src/library/constructions/cases_on.cpp

@@ -186,4 +186,12 @@ environment mk_cases_on(environment const & env, name const & n) {
     new_env = add_aux_recursor(new_env, cases_on_name);
     return add_protected(new_env, cases_on_name);
 }
+
+extern "C" object * lean_mk_cases_on(object * env, object * n) {
+    try {
+        return mk_cases_on(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
 }

stage0/src/library/constructions/no_confusion.cpp

@@ -235,4 +235,12 @@ environment mk_no_confusion(environment const & env, name const & n) {
     new_env = add_no_confusion(new_env, no_confusion_name);
     return add_protected(new_env, no_confusion_name);
 }
+
+extern "C" object * lean_mk_no_confusion(object * env, object * n) {
+    try {
+        return mk_no_confusion(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
 }

stage0/src/library/constructions/rec_on.cpp

@@ -60,4 +60,12 @@ environment mk_rec_on(environment const & env, name const & n) {
     new_env = add_aux_recursor(new_env, rec_on_name);
     return add_protected(new_env, rec_on_name);
 }
+
+extern "C" object * lean_mk_rec_on(object * env, object * n) {
+    try {
+        return mk_rec_on(environment(env), name(n, true)).steal();
+    } catch (exception &) {
+        return env;
+    }
+}
 }

stage0/src/library/module.cpp

@@ -79,22 +79,19 @@ extern "C" object * lean_read_module_data(object * fname, object *) {
             return set_io_error((sstream() << "failed to read file '" << olean_fn << "', invalid header").str());
         }
         delete[] header;
-        char * buffer = new char[size - header_size];
+        // use `malloc` here as expected by `compacted_region`
+        char * buffer = static_cast<char *>(malloc(size - header_size));
         in.read(buffer, size - header_size);
         if (!in) {
             return set_io_error((sstream() << "failed to read file '" << olean_fn << "'").str());
         }
         in.close();
-        /* We don't free compacted_region objects */
         compacted_region * region = new compacted_region(size - header_size, buffer);
-#if defined(__has_feature)
-#if __has_feature(address_sanitizer)
-        // do not report as leak
-        __lsan_ignore_object(region);
-#endif
-#endif
         object * mod = region->read();
-        return set_io_result(mod);
+        object * mod_region = alloc_cnstr(0, 2, 0);
+        cnstr_set(mod_region, 0, mod);
+        cnstr_set(mod_region, 1, box_size_t(reinterpret_cast<size_t>(region)));
+        return set_io_result(mod_region);
     } catch (exception & ex) {
         return set_io_error((sstream() << "failed to read '" << olean_fn << "': " << ex.what()).str());
     }

stage0/src/library/print.cpp

@@ -147,6 +147,10 @@ struct print_expr_fn {
         print_child(app_arg(e));
     }
 
+    static bool is_arrow(expr const & t) {
+        return lean::is_arrow(t) && binding_info(t) == binder_info::Default;
+    }
+
     void print_arrow_body(expr const & a) {
         if (is_atomic(a) || is_arrow(a))
             return print(a);

stage0/src/runtime/compact.cpp

@@ -482,4 +482,9 @@ object * compacted_region::read() {
         }
     }
 }
+
+extern "C" obj_res lean_compacted_region_free(usize region, object *) {
+    delete reinterpret_cast<compacted_region *>(region);
+    return lean_mk_io_result(lean_box(0));
+}
 }

stage0/src/shell/lean.cpp

@@ -373,6 +373,11 @@ extern "C" object* lean_print_deps(object* deps, object* w);
 void print_deps(object_ref const & deps) {
     consume_io_result(lean_print_deps(deps.to_obj_arg(), io_mk_world()));
 }
+
+extern "C" object* lean_environment_free_regions(object * env, object * w);
+void environment_free_regions(environment && env) {
+    consume_io_result(lean_environment_free_regions(env.steal(), io_mk_world()));
+}
 }
 
 void check_optarg(char const * option_name) {
@@ -656,7 +661,9 @@ int main(int argc, char ** argv) {
         }
 
         if (run && ok) {
-            return ir::run_main(env, argc - optind, argv + optind);
+            uint32 ret = ir::run_main(env, argc - optind, argv + optind);
+            environment_free_regions(std::move(env));
+            return ret;
         }
         if (olean_fn && ok) {
             time_task t(".olean serialization",
@@ -681,6 +688,7 @@ int main(int argc, char ** argv) {
         if (!json_output)
             display_cumulative_profiling_times(std::cerr);
 
+        environment_free_regions(std::move(env));
         return ok ? 0 : 1;
     } catch (lean::throwable & ex) {
         std::cerr << lean::message_builder(env, ios, mod_fn, lean::pos_info(1, 1), lean::ERROR).set_exception(

stage0/stdlib/Init/Control/Except.c

@@ -75,7 +75,7 @@ lean_object* l_ExceptT_Monad___rarg___lambda__7(lean_object*, lean_object*, lean
 lean_object* l_monadExceptAdapterTrans___rarg(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Except_Monad___closed__7;
 lean_object* l_ExceptT_lift(lean_object*, lean_object*);
-lean_object* l_finally___rarg___lambda__1(lean_object*, lean_object*, lean_object*);
+lean_object* l_finally___rarg___lambda__1(lean_object*, lean_object*);
 lean_object* l_ExceptT_pure___rarg(lean_object*, lean_object*, lean_object*);
 lean_object* l_Except_MonadExcept___lambda__1(lean_object*, lean_object*);
 lean_object* l_ExceptT_Monad___rarg___lambda__4(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
@@ -2123,61 +2123,84 @@ x_4 = lean_alloc_closure((void*)(l_ExceptT_MonadRun___rarg), 3, 0);
 return x_4;
 }
 }
-lean_object* l_finally___rarg___lambda__1(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+lean_object* l_finally___rarg___lambda__1(lean_object* x_1, lean_object* x_2) {
 _start:
 {
-lean_object* x_4; lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; 
-x_4 = lean_ctor_get(x_1, 0);
-lean_inc(x_4);
+lean_object* x_3; lean_object* x_4; lean_object* x_5; 
+x_3 = lean_ctor_get(x_1, 1);
+lean_inc(x_3);
 lean_dec(x_1);
-x_5 = lean_ctor_get(x_4, 4);
-lean_inc(x_5);
-x_6 = lean_ctor_get(x_4, 1);
-lean_inc(x_6);
-lean_dec(x_4);
-x_7 = lean_apply_2(x_6, lean_box(0), x_3);
-x_8 = lean_apply_3(x_5, lean_box(0), x_2, x_7);
-return x_8;
+x_4 = lean_alloc_ctor(0, 1, 0);
+lean_ctor_set(x_4, 0, x_2);
+x_5 = lean_apply_2(x_3, lean_box(0), x_4);
+return x_5;
 }
 }
 lean_object* l_finally___rarg___lambda__2(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
 _start:
 {
+if (lean_obj_tag(x_4) == 0)
+{
 lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; 
-x_5 = lean_ctor_get(x_1, 0);
+x_5 = lean_ctor_get(x_4, 0);
 lean_inc(x_5);
-lean_dec(x_1);
-x_6 = lean_ctor_get(x_5, 4);
+lean_dec(x_4);
+x_6 = lean_ctor_get(x_1, 4);
 lean_inc(x_6);
-lean_dec(x_5);
+lean_dec(x_1);
 x_7 = lean_ctor_get(x_2, 0);
 lean_inc(x_7);
 lean_dec(x_2);
-x_8 = lean_apply_2(x_7, lean_box(0), x_4);
+x_8 = lean_apply_2(x_7, lean_box(0), x_5);
 x_9 = lean_apply_3(x_6, lean_box(0), x_3, x_8);
 return x_9;
 }
+else
+{
+lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; 
+lean_dec(x_2);
+x_10 = lean_ctor_get(x_4, 0);
+lean_inc(x_10);
+lean_dec(x_4);
+x_11 = lean_ctor_get(x_1, 4);
+lean_inc(x_11);
+x_12 = lean_ctor_get(x_1, 1);
+lean_inc(x_12);
+lean_dec(x_1);
+x_13 = lean_apply_2(x_12, lean_box(0), x_10);
+x_14 = lean_apply_3(x_11, lean_box(0), x_3, x_13);
+return x_14;
+}
+}
 }
 lean_object* l_finally___rarg(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
 _start:
 {
-lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; 
-x_5 = lean_ctor_get(x_2, 1);
+lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; 
+x_5 = lean_ctor_get(x_1, 1);
 lean_inc(x_5);
-x_6 = lean_ctor_get(x_1, 1);
+x_6 = lean_ctor_get(x_2, 1);
 lean_inc(x_6);
-lean_inc(x_4);
-lean_inc(x_1);
-x_7 = lean_alloc_closure((void*)(l_finally___rarg___lambda__1), 3, 2);
-lean_closure_set(x_7, 0, x_1);
-lean_closure_set(x_7, 1, x_4);
-x_8 = lean_apply_4(x_6, lean_box(0), lean_box(0), x_3, x_7);
-x_9 = lean_alloc_closure((void*)(l_finally___rarg___lambda__2), 4, 3);
-lean_closure_set(x_9, 0, x_1);
-lean_closure_set(x_9, 1, x_2);
-lean_closure_set(x_9, 2, x_4);
-x_10 = lean_apply_3(x_5, lean_box(0), x_8, x_9);
-return x_10;
+x_7 = lean_ctor_get(x_1, 0);
+lean_inc(x_7);
+lean_dec(x_1);
+x_8 = lean_ctor_get(x_7, 0);
+lean_inc(x_8);
+x_9 = lean_ctor_get(x_8, 0);
+lean_inc(x_9);
+lean_dec(x_8);
+x_10 = l_ExceptT_lift___rarg___closed__1;
+x_11 = lean_apply_4(x_9, lean_box(0), lean_box(0), x_10, x_3);
+lean_inc(x_7);
+x_12 = lean_alloc_closure((void*)(l_finally___rarg___lambda__1), 2, 1);
+lean_closure_set(x_12, 0, x_7);
+x_13 = lean_apply_3(x_6, lean_box(0), x_11, x_12);
+x_14 = lean_alloc_closure((void*)(l_finally___rarg___lambda__2), 4, 3);
+lean_closure_set(x_14, 0, x_7);
+lean_closure_set(x_14, 1, x_2);
+lean_closure_set(x_14, 2, x_4);
+x_15 = lean_apply_4(x_5, lean_box(0), lean_box(0), x_13, x_14);
+return x_15;
 }
 }
 lean_object* l_finally(lean_object* x_1, lean_object* x_2, lean_object* x_3) {

stage0/stdlib/Lean/Compiler/IR/Boxing.c

@@ -94,6 +94,7 @@ lean_object* l_Lean_IR_explicitBoxing(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_IR_ExplicitBoxing_getJPParams___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_IR_ExplicitBoxing_withParams___rarg___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_IR_ExplicitBoxing_getScrutineeType___boxed(lean_object*);
+extern lean_object* l_Lean_importModules___closed__1;
 lean_object* l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_visitVDeclExpr___spec__2___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at_Array_append___spec__1___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_addBoxedVersions___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
@@ -136,7 +137,6 @@ lean_object* l_Lean_IR_ExplicitBoxing_getDecl(lean_object*, lean_object*, lean_o
 lean_object* l_unsafeCast(lean_object*, lean_object*, lean_object*);
 extern lean_object* l_Lean_IR_Decl_Inhabited___closed__1;
 lean_object* l_Lean_IR_ExplicitBoxing_castVarIfNeeded(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
-lean_object* l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
 lean_object* l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_addBoxedVersions___spec__1(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_IR_ExplicitBoxing_mkCast___closed__3;
 lean_object* l_Lean_IR_Decl_params(lean_object*);
@@ -613,17 +613,6 @@ return x_73;
 }
 }
 }
-lean_object* _init_l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1() {
-_start:
-{
-lean_object* x_1; lean_object* x_2; 
-x_1 = l_Array_empty___closed__1;
-x_2 = lean_alloc_ctor(0, 2, 0);
-lean_ctor_set(x_2, 0, x_1);
-lean_ctor_set(x_2, 1, x_1);
-return x_2;
-}
-}
 lean_object* l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux(lean_object* x_1, lean_object* x_2) {
 _start:
 {
@@ -643,7 +632,7 @@ x_10 = lean_ctor_get(x_8, 1);
 lean_inc(x_10);
 lean_dec(x_8);
 x_11 = lean_array_get_size(x_9);
-x_12 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_12 = l_Lean_importModules___closed__1;
 lean_inc(x_11);
 x_13 = l_Nat_foldMAux___main___at_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___spec__2(x_3, x_9, x_11, x_11, x_12, x_10);
 lean_dec(x_11);
@@ -2993,7 +2982,7 @@ x_5 = lean_alloc_closure((void*)(l_Lean_IR_ExplicitBoxing_castArgsIfNeededAux___
 lean_closure_set(x_5, 0, x_2);
 x_6 = l_Lean_IR_ExplicitBoxing_castArgsIfNeededAux___closed__2;
 x_7 = lean_unsigned_to_nat(0u);
-x_8 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_8 = l_Lean_importModules___closed__1;
 x_9 = l_Array_iterateMAux___main___rarg(x_6, lean_box(0), x_1, x_5, x_7, x_8);
 x_10 = lean_apply_2(x_9, x_3, x_4);
 return x_10;
@@ -3307,7 +3296,7 @@ _start:
 {
 lean_object* x_5; lean_object* x_6; lean_object* x_7; 
 x_5 = lean_unsigned_to_nat(0u);
-x_6 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_6 = l_Lean_importModules___closed__1;
 x_7 = l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_castArgsIfNeeded___spec__2(x_1, x_2, x_2, x_5, x_6, x_3, x_4);
 return x_7;
 }
@@ -3676,7 +3665,7 @@ _start:
 {
 lean_object* x_4; lean_object* x_5; lean_object* x_6; 
 x_4 = lean_unsigned_to_nat(0u);
-x_5 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_5 = l_Lean_importModules___closed__1;
 x_6 = l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_boxArgsIfNeeded___spec__2(x_1, x_1, x_4, x_5, x_2, x_3);
 return x_6;
 }
@@ -4219,7 +4208,7 @@ _start:
 {
 lean_object* x_5; lean_object* x_6; lean_object* x_7; 
 x_5 = lean_unsigned_to_nat(0u);
-x_6 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_6 = l_Lean_importModules___closed__1;
 x_7 = l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_visitVDeclExpr___spec__2(x_1, x_2, x_2, x_5, x_6, x_3, x_4);
 return x_7;
 }
@@ -5500,7 +5489,7 @@ _start:
 {
 lean_object* x_5; lean_object* x_6; lean_object* x_7; 
 x_5 = lean_unsigned_to_nat(0u);
-x_6 = l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1;
+x_6 = l_Lean_importModules___closed__1;
 x_7 = l_Array_iterateMAux___main___at_Lean_IR_ExplicitBoxing_visitFnBody___main___spec__3(x_1, x_2, x_2, x_5, x_6, x_3, x_4);
 return x_7;
 }
@@ -7419,8 +7408,6 @@ if (lean_io_result_is_error(res)) return res;
 lean_dec_ref(res);
 l_Lean_IR_ExplicitBoxing_mkBoxedName___closed__1 = _init_l_Lean_IR_ExplicitBoxing_mkBoxedName___closed__1();
 lean_mark_persistent(l_Lean_IR_ExplicitBoxing_mkBoxedName___closed__1);
-l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1 = _init_l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1();
-lean_mark_persistent(l_Lean_IR_ExplicitBoxing_mkBoxedVersionAux___closed__1);
 l_Lean_IR_ExplicitBoxing_mkCast___closed__1 = _init_l_Lean_IR_ExplicitBoxing_mkCast___closed__1();
 lean_mark_persistent(l_Lean_IR_ExplicitBoxing_mkCast___closed__1);
 l_Lean_IR_ExplicitBoxing_mkCast___closed__2 = _init_l_Lean_IR_ExplicitBoxing_mkCast___closed__2();

stage0/stdlib/Lean/Elab/App.c

@@ -96,7 +96,6 @@ lean_object* l_Lean_Expr_getOptParamDefault_x3f(lean_object*);
 lean_object* l_Lean_Expr_getAppFn___main(lean_object*);
 lean_object* l___private_Lean_Elab_App_23__toMessageData___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Elab_App_13__resolveLValAux___closed__27;
-lean_object* l___private_Lean_Elab_App_26__expandApp___closed__1;
 lean_object* l___private_Lean_Elab_App_26__expandApp___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Elab_App_3__mkArrow___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Term_isTypeFormer(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -244,6 +243,7 @@ lean_object* l_Lean_Elab_Term_elabChoice(lean_object*, lean_object*, lean_object
 lean_object* l___private_Lean_Elab_App_2__elabArg(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Elab_App_4__tryCoeFun___closed__1;
 extern lean_object* l___private_Lean_Elab_Util_4__regTraceClasses___closed__1;
+extern lean_object* l_Lean_importModules___closed__1;
 extern lean_object* l_Lean_formatEntry___closed__1;
 lean_object* l___private_Lean_Elab_App_15__resolveLVal(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at_Array_append___spec__1___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -17556,17 +17556,6 @@ return x_61;
 }
 }
 }
-lean_object* _init_l___private_Lean_Elab_App_26__expandApp___closed__1() {
-_start:
-{
-lean_object* x_1; lean_object* x_2; 
-x_1 = l_Array_empty___closed__1;
-x_2 = lean_alloc_ctor(0, 2, 0);
-lean_ctor_set(x_2, 0, x_1);
-lean_ctor_set(x_2, 1, x_1);
-return x_2;
-}
-}
 lean_object* l___private_Lean_Elab_App_26__expandApp(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
 _start:
 {
@@ -17577,7 +17566,7 @@ x_6 = lean_unsigned_to_nat(1u);
 x_7 = l_Lean_Syntax_getArg(x_1, x_6);
 x_8 = l_Lean_Syntax_getArgs(x_7);
 lean_dec(x_7);
-x_9 = l___private_Lean_Elab_App_26__expandApp___closed__1;
+x_9 = l_Lean_importModules___closed__1;
 x_10 = l_Array_iterateMAux___main___at___private_Lean_Elab_App_26__expandApp___spec__1(x_1, x_8, x_4, x_9, x_2, x_3);
 lean_dec(x_8);
 if (lean_obj_tag(x_10) == 0)
@@ -18349,8 +18338,6 @@ l___private_Lean_Elab_App_25__elabAppAux___closed__2 = _init_l___private_Lean_El
 lean_mark_persistent(l___private_Lean_Elab_App_25__elabAppAux___closed__2);
 l___private_Lean_Elab_App_25__elabAppAux___closed__3 = _init_l___private_Lean_Elab_App_25__elabAppAux___closed__3();
 lean_mark_persistent(l___private_Lean_Elab_App_25__elabAppAux___closed__3);
-l___private_Lean_Elab_App_26__expandApp___closed__1 = _init_l___private_Lean_Elab_App_26__expandApp___closed__1();
-lean_mark_persistent(l___private_Lean_Elab_App_26__expandApp___closed__1);
 l___regBuiltin_Lean_Elab_Term_elabApp___closed__1 = _init_l___regBuiltin_Lean_Elab_Term_elabApp___closed__1();
 lean_mark_persistent(l___regBuiltin_Lean_Elab_Term_elabApp___closed__1);
 res = l___regBuiltin_Lean_Elab_Term_elabApp(lean_io_mk_world());

stage0/stdlib/Lean/Elab/CollectFVars.c

@@ -0,0 +1,885 @@
+// Lean compiler output
+// Module: Lean.Elab.CollectFVars
+// Imports: Init Lean.Util.CollectFVars Lean.Elab.Term
+#include <lean/lean.h>
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#pragma clang diagnostic ignored "-Wunused-label"
+#elif defined(__GNUC__) && !defined(__CLANG__)
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#pragma GCC diagnostic ignored "-Wunused-label"
+#pragma GCC diagnostic ignored "-Wunused-but-set-variable"
+#endif
+#ifdef __cplusplus
+extern "C" {
+#endif
+lean_object* l_Lean_Elab_Term_removeUnused(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_instantiateMVars(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_inferType(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_collectUsedFVarsAtFVars___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* lean_local_ctx_erase(lean_object*, lean_object*);
+extern lean_object* l_Array_empty___closed__1;
+lean_object* l_Array_reverseAux___main___rarg(lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_removeUnused___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* lean_array_push(lean_object*, lean_object*);
+lean_object* lean_array_get_size(lean_object*);
+lean_object* lean_nat_add(lean_object*, lean_object*);
+lean_object* lean_array_fget(lean_object*, lean_object*);
+uint8_t lean_nat_dec_eq(lean_object*, lean_object*);
+lean_object* lean_nat_sub(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_fvarId_x21(lean_object*);
+lean_object* l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_collectUsedFVars___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_LocalInstances_erase(lean_object*, lean_object*);
+lean_object* l_Lean_CollectFVars_main___main(lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_collectUsedFVarsAtFVars(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_getLocalInsts(lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_collectUsedFVars(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_getLCtx(lean_object*, lean_object*);
+lean_object* l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+uint8_t l_Lean_NameSet_contains(lean_object*, lean_object*);
+uint8_t lean_nat_dec_lt(lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Term_collectUsedFVars(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; uint8_t x_7; 
+x_6 = l_Lean_Elab_Term_instantiateMVars(x_1, x_3, x_4, x_5);
+x_7 = !lean_is_exclusive(x_6);
+if (x_7 == 0)
+{
+lean_object* x_8; lean_object* x_9; 
+x_8 = lean_ctor_get(x_6, 0);
+x_9 = l_Lean_CollectFVars_main___main(x_8, x_2);
+lean_ctor_set(x_6, 0, x_9);
+return x_6;
+}
+else
+{
+lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; 
+x_10 = lean_ctor_get(x_6, 0);
+x_11 = lean_ctor_get(x_6, 1);
+lean_inc(x_11);
+lean_inc(x_10);
+lean_dec(x_6);
+x_12 = l_Lean_CollectFVars_main___main(x_10, x_2);
+x_13 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_13, 0, x_12);
+lean_ctor_set(x_13, 1, x_11);
+return x_13;
+}
+}
+}
+lean_object* l_Lean_Elab_Term_collectUsedFVars___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; 
+x_6 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_2, x_3, x_4, x_5);
+lean_dec(x_1);
+return x_6;
+}
+}
+lean_object* l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5, lean_object* x_6, lean_object* x_7) {
+_start:
+{
+lean_object* x_8; uint8_t x_9; 
+x_8 = lean_array_get_size(x_3);
+x_9 = lean_nat_dec_lt(x_4, x_8);
+lean_dec(x_8);
+if (x_9 == 0)
+{
+lean_object* x_10; 
+lean_dec(x_6);
+lean_dec(x_4);
+x_10 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_10, 0, x_5);
+lean_ctor_set(x_10, 1, x_7);
+return x_10;
+}
+else
+{
+lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; 
+x_11 = lean_array_fget(x_3, x_4);
+x_12 = lean_unsigned_to_nat(1u);
+x_13 = lean_nat_add(x_4, x_12);
+lean_dec(x_4);
+lean_inc(x_6);
+x_14 = l_Lean_Elab_Term_inferType(x_1, x_11, x_6, x_7);
+if (lean_obj_tag(x_14) == 0)
+{
+lean_object* x_15; lean_object* x_16; lean_object* x_17; lean_object* x_18; lean_object* x_19; 
+x_15 = lean_ctor_get(x_14, 0);
+lean_inc(x_15);
+x_16 = lean_ctor_get(x_14, 1);
+lean_inc(x_16);
+lean_dec(x_14);
+lean_inc(x_6);
+x_17 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_5, x_15, x_6, x_16);
+x_18 = lean_ctor_get(x_17, 0);
+lean_inc(x_18);
+x_19 = lean_ctor_get(x_17, 1);
+lean_inc(x_19);
+lean_dec(x_17);
+x_4 = x_13;
+x_5 = x_18;
+x_7 = x_19;
+goto _start;
+}
+else
+{
+uint8_t x_21; 
+lean_dec(x_13);
+lean_dec(x_6);
+lean_dec(x_5);
+x_21 = !lean_is_exclusive(x_14);
+if (x_21 == 0)
+{
+return x_14;
+}
+else
+{
+lean_object* x_22; lean_object* x_23; lean_object* x_24; 
+x_22 = lean_ctor_get(x_14, 0);
+x_23 = lean_ctor_get(x_14, 1);
+lean_inc(x_23);
+lean_inc(x_22);
+lean_dec(x_14);
+x_24 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_24, 0, x_22);
+lean_ctor_set(x_24, 1, x_23);
+return x_24;
+}
+}
+}
+}
+}
+lean_object* l_Lean_Elab_Term_collectUsedFVarsAtFVars(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; lean_object* x_7; 
+x_6 = lean_unsigned_to_nat(0u);
+x_7 = l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1(x_1, x_3, x_3, x_6, x_2, x_4, x_5);
+return x_7;
+}
+}
+lean_object* l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5, lean_object* x_6, lean_object* x_7) {
+_start:
+{
+lean_object* x_8; 
+x_8 = l_Array_iterateMAux___main___at_Lean_Elab_Term_collectUsedFVarsAtFVars___spec__1(x_1, x_2, x_3, x_4, x_5, x_6, x_7);
+lean_dec(x_3);
+lean_dec(x_2);
+lean_dec(x_1);
+return x_8;
+}
+}
+lean_object* l_Lean_Elab_Term_collectUsedFVarsAtFVars___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; 
+x_6 = l_Lean_Elab_Term_collectUsedFVarsAtFVars(x_1, x_2, x_3, x_4, x_5);
+lean_dec(x_3);
+lean_dec(x_1);
+return x_6;
+}
+}
+lean_object* l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5, lean_object* x_6, lean_object* x_7, lean_object* x_8) {
+_start:
+{
+lean_object* x_9; uint8_t x_10; 
+x_9 = lean_unsigned_to_nat(0u);
+x_10 = lean_nat_dec_eq(x_4, x_9);
+if (x_10 == 0)
+{
+lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; uint8_t x_16; 
+x_11 = lean_unsigned_to_nat(1u);
+x_12 = lean_nat_sub(x_4, x_11);
+lean_dec(x_4);
+x_13 = lean_array_fget(x_3, x_12);
+x_14 = lean_ctor_get(x_6, 1);
+lean_inc(x_14);
+x_15 = lean_ctor_get(x_14, 1);
+lean_inc(x_15);
+x_16 = !lean_is_exclusive(x_6);
+if (x_16 == 0)
+{
+lean_object* x_17; lean_object* x_18; uint8_t x_19; 
+x_17 = lean_ctor_get(x_6, 0);
+x_18 = lean_ctor_get(x_6, 1);
+lean_dec(x_18);
+x_19 = !lean_is_exclusive(x_14);
+if (x_19 == 0)
+{
+lean_object* x_20; lean_object* x_21; lean_object* x_22; lean_object* x_23; lean_object* x_24; lean_object* x_25; uint8_t x_26; 
+x_20 = lean_ctor_get(x_14, 0);
+x_21 = lean_ctor_get(x_14, 1);
+lean_dec(x_21);
+x_22 = lean_ctor_get(x_15, 0);
+lean_inc(x_22);
+x_23 = lean_ctor_get(x_15, 1);
+lean_inc(x_23);
+x_24 = lean_ctor_get(x_23, 1);
+lean_inc(x_24);
+x_25 = l_Lean_Expr_fvarId_x21(x_13);
+x_26 = l_Lean_NameSet_contains(x_24, x_25);
+lean_dec(x_24);
+if (x_26 == 0)
+{
+lean_object* x_27; lean_object* x_28; 
+lean_dec(x_23);
+lean_dec(x_22);
+lean_dec(x_13);
+lean_inc(x_25);
+x_27 = lean_local_ctx_erase(x_17, x_25);
+x_28 = l_Lean_LocalInstances_erase(x_20, x_25);
+lean_dec(x_25);
+lean_ctor_set(x_14, 0, x_28);
+lean_ctor_set(x_6, 0, x_27);
+x_4 = x_12;
+x_5 = lean_box(0);
+goto _start;
+}
+else
+{
+uint8_t x_30; 
+lean_dec(x_25);
+x_30 = !lean_is_exclusive(x_15);
+if (x_30 == 0)
+{
+lean_object* x_31; lean_object* x_32; lean_object* x_33; 
+x_31 = lean_ctor_get(x_15, 1);
+lean_dec(x_31);
+x_32 = lean_ctor_get(x_15, 0);
+lean_dec(x_32);
+lean_inc(x_7);
+lean_inc(x_13);
+x_33 = l_Lean_Elab_Term_inferType(x_1, x_13, x_7, x_8);
+if (lean_obj_tag(x_33) == 0)
+{
+lean_object* x_34; lean_object* x_35; lean_object* x_36; lean_object* x_37; lean_object* x_38; lean_object* x_39; 
+x_34 = lean_ctor_get(x_33, 0);
+lean_inc(x_34);
+x_35 = lean_ctor_get(x_33, 1);
+lean_inc(x_35);
+lean_dec(x_33);
+lean_inc(x_7);
+x_36 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_23, x_34, x_7, x_35);
+x_37 = lean_ctor_get(x_36, 0);
+lean_inc(x_37);
+x_38 = lean_ctor_get(x_36, 1);
+lean_inc(x_38);
+lean_dec(x_36);
+x_39 = lean_array_push(x_22, x_13);
+lean_ctor_set(x_15, 1, x_37);
+lean_ctor_set(x_15, 0, x_39);
+x_4 = x_12;
+x_5 = lean_box(0);
+x_8 = x_38;
+goto _start;
+}
+else
+{
+uint8_t x_41; 
+lean_free_object(x_15);
+lean_dec(x_23);
+lean_dec(x_22);
+lean_free_object(x_14);
+lean_dec(x_20);
+lean_free_object(x_6);
+lean_dec(x_17);
+lean_dec(x_13);
+lean_dec(x_12);
+lean_dec(x_7);
+x_41 = !lean_is_exclusive(x_33);
+if (x_41 == 0)
+{
+return x_33;
+}
+else
+{
+lean_object* x_42; lean_object* x_43; lean_object* x_44; 
+x_42 = lean_ctor_get(x_33, 0);
+x_43 = lean_ctor_get(x_33, 1);
+lean_inc(x_43);
+lean_inc(x_42);
+lean_dec(x_33);
+x_44 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_44, 0, x_42);
+lean_ctor_set(x_44, 1, x_43);
+return x_44;
+}
+}
+}
+else
+{
+lean_object* x_45; 
+lean_dec(x_15);
+lean_inc(x_7);
+lean_inc(x_13);
+x_45 = l_Lean_Elab_Term_inferType(x_1, x_13, x_7, x_8);
+if (lean_obj_tag(x_45) == 0)
+{
+lean_object* x_46; lean_object* x_47; lean_object* x_48; lean_object* x_49; lean_object* x_50; lean_object* x_51; lean_object* x_52; 
+x_46 = lean_ctor_get(x_45, 0);
+lean_inc(x_46);
+x_47 = lean_ctor_get(x_45, 1);
+lean_inc(x_47);
+lean_dec(x_45);
+lean_inc(x_7);
+x_48 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_23, x_46, x_7, x_47);
+x_49 = lean_ctor_get(x_48, 0);
+lean_inc(x_49);
+x_50 = lean_ctor_get(x_48, 1);
+lean_inc(x_50);
+lean_dec(x_48);
+x_51 = lean_array_push(x_22, x_13);
+x_52 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_52, 0, x_51);
+lean_ctor_set(x_52, 1, x_49);
+lean_ctor_set(x_14, 1, x_52);
+x_4 = x_12;
+x_5 = lean_box(0);
+x_8 = x_50;
+goto _start;
+}
+else
+{
+lean_object* x_54; lean_object* x_55; lean_object* x_56; lean_object* x_57; 
+lean_dec(x_23);
+lean_dec(x_22);
+lean_free_object(x_14);
+lean_dec(x_20);
+lean_free_object(x_6);
+lean_dec(x_17);
+lean_dec(x_13);
+lean_dec(x_12);
+lean_dec(x_7);
+x_54 = lean_ctor_get(x_45, 0);
+lean_inc(x_54);
+x_55 = lean_ctor_get(x_45, 1);
+lean_inc(x_55);
+if (lean_is_exclusive(x_45)) {
+ lean_ctor_release(x_45, 0);
+ lean_ctor_release(x_45, 1);
+ x_56 = x_45;
+} else {
+ lean_dec_ref(x_45);
+ x_56 = lean_box(0);
+}
+if (lean_is_scalar(x_56)) {
+ x_57 = lean_alloc_ctor(1, 2, 0);
+} else {
+ x_57 = x_56;
+}
+lean_ctor_set(x_57, 0, x_54);
+lean_ctor_set(x_57, 1, x_55);
+return x_57;
+}
+}
+}
+}
+else
+{
+lean_object* x_58; lean_object* x_59; lean_object* x_60; lean_object* x_61; lean_object* x_62; uint8_t x_63; 
+x_58 = lean_ctor_get(x_14, 0);
+lean_inc(x_58);
+lean_dec(x_14);
+x_59 = lean_ctor_get(x_15, 0);
+lean_inc(x_59);
+x_60 = lean_ctor_get(x_15, 1);
+lean_inc(x_60);
+x_61 = lean_ctor_get(x_60, 1);
+lean_inc(x_61);
+x_62 = l_Lean_Expr_fvarId_x21(x_13);
+x_63 = l_Lean_NameSet_contains(x_61, x_62);
+lean_dec(x_61);
+if (x_63 == 0)
+{
+lean_object* x_64; lean_object* x_65; lean_object* x_66; 
+lean_dec(x_60);
+lean_dec(x_59);
+lean_dec(x_13);
+lean_inc(x_62);
+x_64 = lean_local_ctx_erase(x_17, x_62);
+x_65 = l_Lean_LocalInstances_erase(x_58, x_62);
+lean_dec(x_62);
+x_66 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_66, 0, x_65);
+lean_ctor_set(x_66, 1, x_15);
+lean_ctor_set(x_6, 1, x_66);
+lean_ctor_set(x_6, 0, x_64);
+x_4 = x_12;
+x_5 = lean_box(0);
+goto _start;
+}
+else
+{
+lean_object* x_68; lean_object* x_69; 
+lean_dec(x_62);
+if (lean_is_exclusive(x_15)) {
+ lean_ctor_release(x_15, 0);
+ lean_ctor_release(x_15, 1);
+ x_68 = x_15;
+} else {
+ lean_dec_ref(x_15);
+ x_68 = lean_box(0);
+}
+lean_inc(x_7);
+lean_inc(x_13);
+x_69 = l_Lean_Elab_Term_inferType(x_1, x_13, x_7, x_8);
+if (lean_obj_tag(x_69) == 0)
+{
+lean_object* x_70; lean_object* x_71; lean_object* x_72; lean_object* x_73; lean_object* x_74; lean_object* x_75; lean_object* x_76; lean_object* x_77; 
+x_70 = lean_ctor_get(x_69, 0);
+lean_inc(x_70);
+x_71 = lean_ctor_get(x_69, 1);
+lean_inc(x_71);
+lean_dec(x_69);
+lean_inc(x_7);
+x_72 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_60, x_70, x_7, x_71);
+x_73 = lean_ctor_get(x_72, 0);
+lean_inc(x_73);
+x_74 = lean_ctor_get(x_72, 1);
+lean_inc(x_74);
+lean_dec(x_72);
+x_75 = lean_array_push(x_59, x_13);
+if (lean_is_scalar(x_68)) {
+ x_76 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_76 = x_68;
+}
+lean_ctor_set(x_76, 0, x_75);
+lean_ctor_set(x_76, 1, x_73);
+x_77 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_77, 0, x_58);
+lean_ctor_set(x_77, 1, x_76);
+lean_ctor_set(x_6, 1, x_77);
+x_4 = x_12;
+x_5 = lean_box(0);
+x_8 = x_74;
+goto _start;
+}
+else
+{
+lean_object* x_79; lean_object* x_80; lean_object* x_81; lean_object* x_82; 
+lean_dec(x_68);
+lean_dec(x_60);
+lean_dec(x_59);
+lean_dec(x_58);
+lean_free_object(x_6);
+lean_dec(x_17);
+lean_dec(x_13);
+lean_dec(x_12);
+lean_dec(x_7);
+x_79 = lean_ctor_get(x_69, 0);
+lean_inc(x_79);
+x_80 = lean_ctor_get(x_69, 1);
+lean_inc(x_80);
+if (lean_is_exclusive(x_69)) {
+ lean_ctor_release(x_69, 0);
+ lean_ctor_release(x_69, 1);
+ x_81 = x_69;
+} else {
+ lean_dec_ref(x_69);
+ x_81 = lean_box(0);
+}
+if (lean_is_scalar(x_81)) {
+ x_82 = lean_alloc_ctor(1, 2, 0);
+} else {
+ x_82 = x_81;
+}
+lean_ctor_set(x_82, 0, x_79);
+lean_ctor_set(x_82, 1, x_80);
+return x_82;
+}
+}
+}
+}
+else
+{
+lean_object* x_83; lean_object* x_84; lean_object* x_85; lean_object* x_86; lean_object* x_87; lean_object* x_88; lean_object* x_89; uint8_t x_90; 
+x_83 = lean_ctor_get(x_6, 0);
+lean_inc(x_83);
+lean_dec(x_6);
+x_84 = lean_ctor_get(x_14, 0);
+lean_inc(x_84);
+if (lean_is_exclusive(x_14)) {
+ lean_ctor_release(x_14, 0);
+ lean_ctor_release(x_14, 1);
+ x_85 = x_14;
+} else {
+ lean_dec_ref(x_14);
+ x_85 = lean_box(0);
+}
+x_86 = lean_ctor_get(x_15, 0);
+lean_inc(x_86);
+x_87 = lean_ctor_get(x_15, 1);
+lean_inc(x_87);
+x_88 = lean_ctor_get(x_87, 1);
+lean_inc(x_88);
+x_89 = l_Lean_Expr_fvarId_x21(x_13);
+x_90 = l_Lean_NameSet_contains(x_88, x_89);
+lean_dec(x_88);
+if (x_90 == 0)
+{
+lean_object* x_91; lean_object* x_92; lean_object* x_93; lean_object* x_94; 
+lean_dec(x_87);
+lean_dec(x_86);
+lean_dec(x_13);
+lean_inc(x_89);
+x_91 = lean_local_ctx_erase(x_83, x_89);
+x_92 = l_Lean_LocalInstances_erase(x_84, x_89);
+lean_dec(x_89);
+if (lean_is_scalar(x_85)) {
+ x_93 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_93 = x_85;
+}
+lean_ctor_set(x_93, 0, x_92);
+lean_ctor_set(x_93, 1, x_15);
+x_94 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_94, 0, x_91);
+lean_ctor_set(x_94, 1, x_93);
+x_4 = x_12;
+x_5 = lean_box(0);
+x_6 = x_94;
+goto _start;
+}
+else
+{
+lean_object* x_96; lean_object* x_97; 
+lean_dec(x_89);
+if (lean_is_exclusive(x_15)) {
+ lean_ctor_release(x_15, 0);
+ lean_ctor_release(x_15, 1);
+ x_96 = x_15;
+} else {
+ lean_dec_ref(x_15);
+ x_96 = lean_box(0);
+}
+lean_inc(x_7);
+lean_inc(x_13);
+x_97 = l_Lean_Elab_Term_inferType(x_1, x_13, x_7, x_8);
+if (lean_obj_tag(x_97) == 0)
+{
+lean_object* x_98; lean_object* x_99; lean_object* x_100; lean_object* x_101; lean_object* x_102; lean_object* x_103; lean_object* x_104; lean_object* x_105; lean_object* x_106; 
+x_98 = lean_ctor_get(x_97, 0);
+lean_inc(x_98);
+x_99 = lean_ctor_get(x_97, 1);
+lean_inc(x_99);
+lean_dec(x_97);
+lean_inc(x_7);
+x_100 = l_Lean_Elab_Term_collectUsedFVars(x_1, x_87, x_98, x_7, x_99);
+x_101 = lean_ctor_get(x_100, 0);
+lean_inc(x_101);
+x_102 = lean_ctor_get(x_100, 1);
+lean_inc(x_102);
+lean_dec(x_100);
+x_103 = lean_array_push(x_86, x_13);
+if (lean_is_scalar(x_96)) {
+ x_104 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_104 = x_96;
+}
+lean_ctor_set(x_104, 0, x_103);
+lean_ctor_set(x_104, 1, x_101);
+if (lean_is_scalar(x_85)) {
+ x_105 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_105 = x_85;
+}
+lean_ctor_set(x_105, 0, x_84);
+lean_ctor_set(x_105, 1, x_104);
+x_106 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_106, 0, x_83);
+lean_ctor_set(x_106, 1, x_105);
+x_4 = x_12;
+x_5 = lean_box(0);
+x_6 = x_106;
+x_8 = x_102;
+goto _start;
+}
+else
+{
+lean_object* x_108; lean_object* x_109; lean_object* x_110; lean_object* x_111; 
+lean_dec(x_96);
+lean_dec(x_87);
+lean_dec(x_86);
+lean_dec(x_85);
+lean_dec(x_84);
+lean_dec(x_83);
+lean_dec(x_13);
+lean_dec(x_12);
+lean_dec(x_7);
+x_108 = lean_ctor_get(x_97, 0);
+lean_inc(x_108);
+x_109 = lean_ctor_get(x_97, 1);
+lean_inc(x_109);
+if (lean_is_exclusive(x_97)) {
+ lean_ctor_release(x_97, 0);
+ lean_ctor_release(x_97, 1);
+ x_110 = x_97;
+} else {
+ lean_dec_ref(x_97);
+ x_110 = lean_box(0);
+}
+if (lean_is_scalar(x_110)) {
+ x_111 = lean_alloc_ctor(1, 2, 0);
+} else {
+ x_111 = x_110;
+}
+lean_ctor_set(x_111, 0, x_108);
+lean_ctor_set(x_111, 1, x_109);
+return x_111;
+}
+}
+}
+}
+else
+{
+lean_object* x_112; 
+lean_dec(x_7);
+lean_dec(x_4);
+x_112 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_112, 0, x_6);
+lean_ctor_set(x_112, 1, x_8);
+return x_112;
+}
+}
+}
+lean_object* l_Lean_Elab_Term_removeUnused(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; lean_object* x_16; lean_object* x_17; 
+x_6 = l_Lean_Elab_Term_getLocalInsts(x_4, x_5);
+x_7 = lean_ctor_get(x_6, 0);
+lean_inc(x_7);
+x_8 = lean_ctor_get(x_6, 1);
+lean_inc(x_8);
+lean_dec(x_6);
+x_9 = l_Lean_Elab_Term_getLCtx(x_4, x_8);
+x_10 = lean_ctor_get(x_9, 0);
+lean_inc(x_10);
+x_11 = lean_ctor_get(x_9, 1);
+lean_inc(x_11);
+lean_dec(x_9);
+x_12 = l_Array_empty___closed__1;
+x_13 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_13, 0, x_12);
+lean_ctor_set(x_13, 1, x_3);
+x_14 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_14, 0, x_7);
+lean_ctor_set(x_14, 1, x_13);
+x_15 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_15, 0, x_10);
+lean_ctor_set(x_15, 1, x_14);
+x_16 = lean_array_get_size(x_2);
+x_17 = l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1(x_1, x_2, x_2, x_16, lean_box(0), x_15, x_4, x_11);
+if (lean_obj_tag(x_17) == 0)
+{
+lean_object* x_18; lean_object* x_19; lean_object* x_20; uint8_t x_21; 
+x_18 = lean_ctor_get(x_17, 0);
+lean_inc(x_18);
+x_19 = lean_ctor_get(x_18, 1);
+lean_inc(x_19);
+x_20 = lean_ctor_get(x_19, 1);
+lean_inc(x_20);
+x_21 = !lean_is_exclusive(x_17);
+if (x_21 == 0)
+{
+lean_object* x_22; lean_object* x_23; uint8_t x_24; 
+x_22 = lean_ctor_get(x_17, 0);
+lean_dec(x_22);
+x_23 = lean_ctor_get(x_18, 0);
+lean_inc(x_23);
+lean_dec(x_18);
+x_24 = !lean_is_exclusive(x_19);
+if (x_24 == 0)
+{
+lean_object* x_25; lean_object* x_26; uint8_t x_27; 
+x_25 = lean_ctor_get(x_19, 0);
+x_26 = lean_ctor_get(x_19, 1);
+lean_dec(x_26);
+x_27 = !lean_is_exclusive(x_20);
+if (x_27 == 0)
+{
+lean_object* x_28; lean_object* x_29; lean_object* x_30; lean_object* x_31; 
+x_28 = lean_ctor_get(x_20, 0);
+x_29 = lean_ctor_get(x_20, 1);
+lean_dec(x_29);
+x_30 = lean_unsigned_to_nat(0u);
+x_31 = l_Array_reverseAux___main___rarg(x_28, x_30);
+lean_ctor_set(x_20, 1, x_31);
+lean_ctor_set(x_20, 0, x_25);
+lean_ctor_set(x_19, 0, x_23);
+lean_ctor_set(x_17, 0, x_19);
+return x_17;
+}
+else
+{
+lean_object* x_32; lean_object* x_33; lean_object* x_34; lean_object* x_35; 
+x_32 = lean_ctor_get(x_20, 0);
+lean_inc(x_32);
+lean_dec(x_20);
+x_33 = lean_unsigned_to_nat(0u);
+x_34 = l_Array_reverseAux___main___rarg(x_32, x_33);
+x_35 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_35, 0, x_25);
+lean_ctor_set(x_35, 1, x_34);
+lean_ctor_set(x_19, 1, x_35);
+lean_ctor_set(x_19, 0, x_23);
+lean_ctor_set(x_17, 0, x_19);
+return x_17;
+}
+}
+else
+{
+lean_object* x_36; lean_object* x_37; lean_object* x_38; lean_object* x_39; lean_object* x_40; lean_object* x_41; lean_object* x_42; 
+x_36 = lean_ctor_get(x_19, 0);
+lean_inc(x_36);
+lean_dec(x_19);
+x_37 = lean_ctor_get(x_20, 0);
+lean_inc(x_37);
+if (lean_is_exclusive(x_20)) {
+ lean_ctor_release(x_20, 0);
+ lean_ctor_release(x_20, 1);
+ x_38 = x_20;
+} else {
+ lean_dec_ref(x_20);
+ x_38 = lean_box(0);
+}
+x_39 = lean_unsigned_to_nat(0u);
+x_40 = l_Array_reverseAux___main___rarg(x_37, x_39);
+if (lean_is_scalar(x_38)) {
+ x_41 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_41 = x_38;
+}
+lean_ctor_set(x_41, 0, x_36);
+lean_ctor_set(x_41, 1, x_40);
+x_42 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_42, 0, x_23);
+lean_ctor_set(x_42, 1, x_41);
+lean_ctor_set(x_17, 0, x_42);
+return x_17;
+}
+}
+else
+{
+lean_object* x_43; lean_object* x_44; lean_object* x_45; lean_object* x_46; lean_object* x_47; lean_object* x_48; lean_object* x_49; lean_object* x_50; lean_object* x_51; lean_object* x_52; lean_object* x_53; 
+x_43 = lean_ctor_get(x_17, 1);
+lean_inc(x_43);
+lean_dec(x_17);
+x_44 = lean_ctor_get(x_18, 0);
+lean_inc(x_44);
+lean_dec(x_18);
+x_45 = lean_ctor_get(x_19, 0);
+lean_inc(x_45);
+if (lean_is_exclusive(x_19)) {
+ lean_ctor_release(x_19, 0);
+ lean_ctor_release(x_19, 1);
+ x_46 = x_19;
+} else {
+ lean_dec_ref(x_19);
+ x_46 = lean_box(0);
+}
+x_47 = lean_ctor_get(x_20, 0);
+lean_inc(x_47);
+if (lean_is_exclusive(x_20)) {
+ lean_ctor_release(x_20, 0);
+ lean_ctor_release(x_20, 1);
+ x_48 = x_20;
+} else {
+ lean_dec_ref(x_20);
+ x_48 = lean_box(0);
+}
+x_49 = lean_unsigned_to_nat(0u);
+x_50 = l_Array_reverseAux___main___rarg(x_47, x_49);
+if (lean_is_scalar(x_48)) {
+ x_51 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_51 = x_48;
+}
+lean_ctor_set(x_51, 0, x_45);
+lean_ctor_set(x_51, 1, x_50);
+if (lean_is_scalar(x_46)) {
+ x_52 = lean_alloc_ctor(0, 2, 0);
+} else {
+ x_52 = x_46;
+}
+lean_ctor_set(x_52, 0, x_44);
+lean_ctor_set(x_52, 1, x_51);
+x_53 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_53, 0, x_52);
+lean_ctor_set(x_53, 1, x_43);
+return x_53;
+}
+}
+else
+{
+uint8_t x_54; 
+x_54 = !lean_is_exclusive(x_17);
+if (x_54 == 0)
+{
+return x_17;
+}
+else
+{
+lean_object* x_55; lean_object* x_56; lean_object* x_57; 
+x_55 = lean_ctor_get(x_17, 0);
+x_56 = lean_ctor_get(x_17, 1);
+lean_inc(x_56);
+lean_inc(x_55);
+lean_dec(x_17);
+x_57 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_57, 0, x_55);
+lean_ctor_set(x_57, 1, x_56);
+return x_57;
+}
+}
+}
+}
+lean_object* l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5, lean_object* x_6, lean_object* x_7, lean_object* x_8) {
+_start:
+{
+lean_object* x_9; 
+x_9 = l___private_Init_Data_Array_Basic_3__iterateRevMAux___main___at_Lean_Elab_Term_removeUnused___spec__1(x_1, x_2, x_3, x_4, x_5, x_6, x_7, x_8);
+lean_dec(x_3);
+lean_dec(x_2);
+lean_dec(x_1);
+return x_9;
+}
+}
+lean_object* l_Lean_Elab_Term_removeUnused___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; 
+x_6 = l_Lean_Elab_Term_removeUnused(x_1, x_2, x_3, x_4, x_5);
+lean_dec(x_2);
+lean_dec(x_1);
+return x_6;
+}
+}
+lean_object* initialize_Init(lean_object*);
+lean_object* initialize_Lean_Util_CollectFVars(lean_object*);
+lean_object* initialize_Lean_Elab_Term(lean_object*);
+static bool _G_initialized = false;
+lean_object* initialize_Lean_Elab_CollectFVars(lean_object* w) {
+lean_object * res;
+if (_G_initialized) return lean_mk_io_result(lean_box(0));
+_G_initialized = true;
+res = initialize_Init(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+res = initialize_Lean_Util_CollectFVars(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+res = initialize_Lean_Elab_Term(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+return lean_mk_io_result(lean_box(0));
+}
+#ifdef __cplusplus
+}
+#endif

stage0/stdlib/Lean/Elab/DeclModifiers.c

@@ -43,11 +43,13 @@ lean_object* lean_string_utf8_extract(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Command_applyAttributes(lean_object*, lean_object*, lean_object*, uint8_t, lean_object*, lean_object*);
 lean_object* lean_string_utf8_byte_size(lean_object*);
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat(lean_object*);
+lean_object* l_Lean_Elab_Command_applyVisibility(lean_object*, uint8_t, lean_object*, lean_object*, lean_object*);
 lean_object* lean_nat_add(lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__11;
+lean_object* l_Lean_Elab_Command_Attribute_inhabited___closed__1;
 extern lean_object* l_Array_forMAux___main___at_Lean_Meta_clear___spec__5___closed__8;
 lean_object* l_Lean_Elab_Command_checkNotAlreadyDeclared___closed__2;
-lean_object* l_Lean_Elab_Command_mkDeclName(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Command_mkDeclName(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 uint8_t l_Lean_AttributeApplicationTime_beq(uint8_t, uint8_t);
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__4;
 lean_object* lean_array_fget(lean_object*, lean_object*);
@@ -75,6 +77,7 @@ lean_object* l_Function_comp___rarg(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Command_throwError___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
 uint8_t l_Lean_Environment_contains(lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Command_checkNotAlreadyDeclared___closed__1;
+extern lean_object* l_Lean_protectedExt;
 extern lean_object* l_Lean_Parser_Command_docComment___elambda__1___closed__2;
 extern lean_object* l_Lean_Options_empty;
 extern lean_object* l_Lean_Parser_Command_attributes___elambda__1___closed__5;
@@ -89,6 +92,7 @@ lean_object* l_Lean_Elab_Command_elabAttr___boxed(lean_object*, lean_object*, le
 lean_object* l_Lean_Elab_Command_Modifiers_hasToString___closed__2;
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__12;
 lean_object* l_Lean_Elab_Command_Attribute_hasFormat___closed__1;
+lean_object* l_Lean_PersistentEnvExtension_addEntry___rarg(lean_object*, lean_object*, lean_object*);
 extern lean_object* l_Lean_Format_sbracket___closed__3;
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__10;
 uint8_t l_Lean_Syntax_isMissing(lean_object*);
@@ -107,6 +111,7 @@ extern lean_object* l_Lean_Parser_Command_private___elambda__1___closed__1;
 lean_object* l_Lean_mkPrivateName(lean_object*, lean_object*);
 lean_object* l_Lean_Syntax_getArgs(lean_object*);
 lean_object* l_Lean_Syntax_getKind(lean_object*);
+lean_object* l_Lean_Elab_Command_Attribute_inhabited;
 lean_object* l_Lean_Elab_Command_Modifiers_addAttribute(lean_object*, lean_object*);
 lean_object* lean_format_group(lean_object*);
 lean_object* l_Lean_Elab_Command_Attribute_hasFormat___closed__2;
@@ -123,9 +128,13 @@ lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__14;
 lean_object* l_Lean_Elab_Command_Modifiers_hasFormat___closed__5;
 lean_object* l_Lean_Elab_Command_checkNotAlreadyDeclared___closed__6;
 lean_object* l_Array_toList___rarg(lean_object*);
+lean_object* l_Lean_Elab_Command_applyVisibility___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 extern lean_object* l_Lean_Parser_Command_unsafe___elambda__1___closed__1;
 lean_object* l_Lean_Elab_Command_setEnv(lean_object*, lean_object*, lean_object*);
 lean_object* lean_string_length(lean_object*);
+uint8_t l_Lean_Elab_Command_Modifiers_isProtected(lean_object*);
+lean_object* l_Lean_Elab_Command_Modifiers_isPrivate___boxed(lean_object*);
+uint8_t l_Lean_Elab_Command_Modifiers_isPrivate(lean_object*);
 lean_object* l_Lean_Elab_Command_Attribute_hasFormat(lean_object*);
 extern lean_object* l_Lean_Parser_Command_private___elambda__1___closed__2;
 lean_object* l_Lean_Syntax_getArg(lean_object*, lean_object*);
@@ -140,7 +149,8 @@ lean_object* l_Lean_getAttributeImpl(lean_object*, lean_object*);
 lean_object* l_Lean_Elab_Command_elabModifiers___closed__5;
 extern lean_object* l_addParenHeuristic___closed__1;
 extern lean_object* l_Lean_Parser_Command_docComment___elambda__1___closed__7;
-lean_object* l_Lean_Elab_Command_mkDeclName___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Command_mkDeclName___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Elab_Command_Modifiers_isProtected___boxed(lean_object*);
 lean_object* l_Lean_Elab_Command_elabModifiers___closed__3;
 uint8_t lean_nat_dec_lt(lean_object*, lean_object*);
 extern lean_object* l_Lean_mkProtectedExtension___closed__1;
@@ -238,6 +248,26 @@ return x_32;
 }
 }
 }
+lean_object* _init_l_Lean_Elab_Command_Attribute_inhabited___closed__1() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; 
+x_1 = lean_box(0);
+x_2 = lean_box(0);
+x_3 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_3, 0, x_1);
+lean_ctor_set(x_3, 1, x_2);
+return x_3;
+}
+}
+lean_object* _init_l_Lean_Elab_Command_Attribute_inhabited() {
+_start:
+{
+lean_object* x_1; 
+x_1 = l_Lean_Elab_Command_Attribute_inhabited___closed__1;
+return x_1;
+}
+}
 lean_object* _init_l_Lean_Elab_Command_Visibility_hasToString___closed__1() {
 _start:
 {
@@ -281,6 +311,68 @@ x_3 = l_Lean_Elab_Command_Visibility_hasToString(x_2);
 return x_3;
 }
 }
+uint8_t l_Lean_Elab_Command_Modifiers_isPrivate(lean_object* x_1) {
+_start:
+{
+uint8_t x_2; lean_object* x_3; 
+x_2 = lean_ctor_get_uint8(x_1, sizeof(void*)*2);
+x_3 = lean_box(x_2);
+if (lean_obj_tag(x_3) == 2)
+{
+uint8_t x_4; 
+x_4 = 1;
+return x_4;
+}
+else
+{
+uint8_t x_5; 
+lean_dec(x_3);
+x_5 = 0;
+return x_5;
+}
+}
+}
+lean_object* l_Lean_Elab_Command_Modifiers_isPrivate___boxed(lean_object* x_1) {
+_start:
+{
+uint8_t x_2; lean_object* x_3; 
+x_2 = l_Lean_Elab_Command_Modifiers_isPrivate(x_1);
+lean_dec(x_1);
+x_3 = lean_box(x_2);
+return x_3;
+}
+}
+uint8_t l_Lean_Elab_Command_Modifiers_isProtected(lean_object* x_1) {
+_start:
+{
+uint8_t x_2; lean_object* x_3; 
+x_2 = lean_ctor_get_uint8(x_1, sizeof(void*)*2);
+x_3 = lean_box(x_2);
+if (lean_obj_tag(x_3) == 1)
+{
+uint8_t x_4; 
+x_4 = 1;
+return x_4;
+}
+else
+{
+uint8_t x_5; 
+lean_dec(x_3);
+x_5 = 0;
+return x_5;
+}
+}
+}
+lean_object* l_Lean_Elab_Command_Modifiers_isProtected___boxed(lean_object* x_1) {
+_start:
+{
+uint8_t x_2; lean_object* x_3; 
+x_2 = l_Lean_Elab_Command_Modifiers_isProtected(x_1);
+lean_dec(x_1);
+x_3 = lean_box(x_2);
+return x_3;
+}
+}
 lean_object* l_Lean_Elab_Command_Modifiers_addAttribute(lean_object* x_1, lean_object* x_2) {
 _start:
 {
@@ -2055,203 +2147,6 @@ lean_dec(x_1);
 return x_4;
 }
 }
-lean_object* l_Lean_Elab_Command_mkDeclName(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
-_start:
-{
-lean_object* x_5; 
-lean_inc(x_3);
-x_5 = l_Lean_Elab_Command_getCurrNamespace(x_3, x_4);
-if (lean_obj_tag(x_5) == 0)
-{
-uint8_t x_6; 
-x_6 = !lean_is_exclusive(x_5);
-if (x_6 == 0)
-{
-lean_object* x_7; lean_object* x_8; lean_object* x_9; uint8_t x_10; lean_object* x_11; 
-x_7 = lean_ctor_get(x_5, 0);
-x_8 = lean_ctor_get(x_5, 1);
-x_9 = l_Lean_Name_append___main(x_7, x_2);
-lean_dec(x_7);
-x_10 = lean_ctor_get_uint8(x_1, sizeof(void*)*2);
-x_11 = lean_box(x_10);
-if (lean_obj_tag(x_11) == 2)
-{
-lean_object* x_12; 
-lean_free_object(x_5);
-x_12 = l_Lean_Elab_Command_getEnv(x_3, x_8);
-if (lean_obj_tag(x_12) == 0)
-{
-uint8_t x_13; 
-x_13 = !lean_is_exclusive(x_12);
-if (x_13 == 0)
-{
-lean_object* x_14; lean_object* x_15; 
-x_14 = lean_ctor_get(x_12, 0);
-x_15 = l_Lean_mkPrivateName(x_14, x_9);
-lean_ctor_set(x_12, 0, x_15);
-return x_12;
-}
-else
-{
-lean_object* x_16; lean_object* x_17; lean_object* x_18; lean_object* x_19; 
-x_16 = lean_ctor_get(x_12, 0);
-x_17 = lean_ctor_get(x_12, 1);
-lean_inc(x_17);
-lean_inc(x_16);
-lean_dec(x_12);
-x_18 = l_Lean_mkPrivateName(x_16, x_9);
-x_19 = lean_alloc_ctor(0, 2, 0);
-lean_ctor_set(x_19, 0, x_18);
-lean_ctor_set(x_19, 1, x_17);
-return x_19;
-}
-}
-else
-{
-uint8_t x_20; 
-lean_dec(x_9);
-x_20 = !lean_is_exclusive(x_12);
-if (x_20 == 0)
-{
-return x_12;
-}
-else
-{
-lean_object* x_21; lean_object* x_22; lean_object* x_23; 
-x_21 = lean_ctor_get(x_12, 0);
-x_22 = lean_ctor_get(x_12, 1);
-lean_inc(x_22);
-lean_inc(x_21);
-lean_dec(x_12);
-x_23 = lean_alloc_ctor(1, 2, 0);
-lean_ctor_set(x_23, 0, x_21);
-lean_ctor_set(x_23, 1, x_22);
-return x_23;
-}
-}
-}
-else
-{
-lean_dec(x_11);
-lean_dec(x_3);
-lean_ctor_set(x_5, 0, x_9);
-return x_5;
-}
-}
-else
-{
-lean_object* x_24; lean_object* x_25; lean_object* x_26; uint8_t x_27; lean_object* x_28; 
-x_24 = lean_ctor_get(x_5, 0);
-x_25 = lean_ctor_get(x_5, 1);
-lean_inc(x_25);
-lean_inc(x_24);
-lean_dec(x_5);
-x_26 = l_Lean_Name_append___main(x_24, x_2);
-lean_dec(x_24);
-x_27 = lean_ctor_get_uint8(x_1, sizeof(void*)*2);
-x_28 = lean_box(x_27);
-if (lean_obj_tag(x_28) == 2)
-{
-lean_object* x_29; 
-x_29 = l_Lean_Elab_Command_getEnv(x_3, x_25);
-if (lean_obj_tag(x_29) == 0)
-{
-lean_object* x_30; lean_object* x_31; lean_object* x_32; lean_object* x_33; lean_object* x_34; 
-x_30 = lean_ctor_get(x_29, 0);
-lean_inc(x_30);
-x_31 = lean_ctor_get(x_29, 1);
-lean_inc(x_31);
-if (lean_is_exclusive(x_29)) {
- lean_ctor_release(x_29, 0);
- lean_ctor_release(x_29, 1);
- x_32 = x_29;
-} else {
- lean_dec_ref(x_29);
- x_32 = lean_box(0);
-}
-x_33 = l_Lean_mkPrivateName(x_30, x_26);
-if (lean_is_scalar(x_32)) {
- x_34 = lean_alloc_ctor(0, 2, 0);
-} else {
- x_34 = x_32;
-}
-lean_ctor_set(x_34, 0, x_33);
-lean_ctor_set(x_34, 1, x_31);
-return x_34;
-}
-else
-{
-lean_object* x_35; lean_object* x_36; lean_object* x_37; lean_object* x_38; 
-lean_dec(x_26);
-x_35 = lean_ctor_get(x_29, 0);
-lean_inc(x_35);
-x_36 = lean_ctor_get(x_29, 1);
-lean_inc(x_36);
-if (lean_is_exclusive(x_29)) {
- lean_ctor_release(x_29, 0);
- lean_ctor_release(x_29, 1);
- x_37 = x_29;
-} else {
- lean_dec_ref(x_29);
- x_37 = lean_box(0);
-}
-if (lean_is_scalar(x_37)) {
- x_38 = lean_alloc_ctor(1, 2, 0);
-} else {
- x_38 = x_37;
-}
-lean_ctor_set(x_38, 0, x_35);
-lean_ctor_set(x_38, 1, x_36);
-return x_38;
-}
-}
-else
-{
-lean_object* x_39; 
-lean_dec(x_28);
-lean_dec(x_3);
-x_39 = lean_alloc_ctor(0, 2, 0);
-lean_ctor_set(x_39, 0, x_26);
-lean_ctor_set(x_39, 1, x_25);
-return x_39;
-}
-}
-}
-else
-{
-uint8_t x_40; 
-lean_dec(x_3);
-lean_dec(x_2);
-x_40 = !lean_is_exclusive(x_5);
-if (x_40 == 0)
-{
-return x_5;
-}
-else
-{
-lean_object* x_41; lean_object* x_42; lean_object* x_43; 
-x_41 = lean_ctor_get(x_5, 0);
-x_42 = lean_ctor_get(x_5, 1);
-lean_inc(x_42);
-lean_inc(x_41);
-lean_dec(x_5);
-x_43 = lean_alloc_ctor(1, 2, 0);
-lean_ctor_set(x_43, 0, x_41);
-lean_ctor_set(x_43, 1, x_42);
-return x_43;
-}
-}
-}
-}
-lean_object* l_Lean_Elab_Command_mkDeclName___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
-_start:
-{
-lean_object* x_5; 
-x_5 = l_Lean_Elab_Command_mkDeclName(x_1, x_2, x_3, x_4);
-lean_dec(x_1);
-return x_5;
-}
-}
 lean_object* _init_l_Lean_Elab_Command_checkNotAlreadyDeclared___closed__1() {
 _start:
 {
@@ -2617,6 +2512,346 @@ lean_dec(x_1);
 return x_5;
 }
 }
+lean_object* l_Lean_Elab_Command_applyVisibility(lean_object* x_1, uint8_t x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+switch (x_2) {
+case 0:
+{
+lean_object* x_6; 
+lean_inc(x_3);
+x_6 = l_Lean_Elab_Command_checkNotAlreadyDeclared(x_1, x_3, x_4, x_5);
+if (lean_obj_tag(x_6) == 0)
+{
+uint8_t x_7; 
+x_7 = !lean_is_exclusive(x_6);
+if (x_7 == 0)
+{
+lean_object* x_8; 
+x_8 = lean_ctor_get(x_6, 0);
+lean_dec(x_8);
+lean_ctor_set(x_6, 0, x_3);
+return x_6;
+}
+else
+{
+lean_object* x_9; lean_object* x_10; 
+x_9 = lean_ctor_get(x_6, 1);
+lean_inc(x_9);
+lean_dec(x_6);
+x_10 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_10, 0, x_3);
+lean_ctor_set(x_10, 1, x_9);
+return x_10;
+}
+}
+else
+{
+uint8_t x_11; 
+lean_dec(x_3);
+x_11 = !lean_is_exclusive(x_6);
+if (x_11 == 0)
+{
+return x_6;
+}
+else
+{
+lean_object* x_12; lean_object* x_13; lean_object* x_14; 
+x_12 = lean_ctor_get(x_6, 0);
+x_13 = lean_ctor_get(x_6, 1);
+lean_inc(x_13);
+lean_inc(x_12);
+lean_dec(x_6);
+x_14 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_14, 0, x_12);
+lean_ctor_set(x_14, 1, x_13);
+return x_14;
+}
+}
+}
+case 1:
+{
+lean_object* x_15; 
+lean_inc(x_4);
+lean_inc(x_3);
+x_15 = l_Lean_Elab_Command_checkNotAlreadyDeclared(x_1, x_3, x_4, x_5);
+if (lean_obj_tag(x_15) == 0)
+{
+lean_object* x_16; lean_object* x_17; 
+x_16 = lean_ctor_get(x_15, 1);
+lean_inc(x_16);
+lean_dec(x_15);
+lean_inc(x_4);
+x_17 = l_Lean_Elab_Command_getEnv(x_4, x_16);
+if (lean_obj_tag(x_17) == 0)
+{
+lean_object* x_18; lean_object* x_19; lean_object* x_20; lean_object* x_21; lean_object* x_22; 
+x_18 = lean_ctor_get(x_17, 0);
+lean_inc(x_18);
+x_19 = lean_ctor_get(x_17, 1);
+lean_inc(x_19);
+lean_dec(x_17);
+x_20 = l_Lean_protectedExt;
+lean_inc(x_3);
+x_21 = l_Lean_PersistentEnvExtension_addEntry___rarg(x_20, x_18, x_3);
+x_22 = l_Lean_Elab_Command_setEnv(x_21, x_4, x_19);
+if (lean_obj_tag(x_22) == 0)
+{
+uint8_t x_23; 
+x_23 = !lean_is_exclusive(x_22);
+if (x_23 == 0)
+{
+lean_object* x_24; 
+x_24 = lean_ctor_get(x_22, 0);
+lean_dec(x_24);
+lean_ctor_set(x_22, 0, x_3);
+return x_22;
+}
+else
+{
+lean_object* x_25; lean_object* x_26; 
+x_25 = lean_ctor_get(x_22, 1);
+lean_inc(x_25);
+lean_dec(x_22);
+x_26 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_26, 0, x_3);
+lean_ctor_set(x_26, 1, x_25);
+return x_26;
+}
+}
+else
+{
+uint8_t x_27; 
+lean_dec(x_3);
+x_27 = !lean_is_exclusive(x_22);
+if (x_27 == 0)
+{
+return x_22;
+}
+else
+{
+lean_object* x_28; lean_object* x_29; lean_object* x_30; 
+x_28 = lean_ctor_get(x_22, 0);
+x_29 = lean_ctor_get(x_22, 1);
+lean_inc(x_29);
+lean_inc(x_28);
+lean_dec(x_22);
+x_30 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_30, 0, x_28);
+lean_ctor_set(x_30, 1, x_29);
+return x_30;
+}
+}
+}
+else
+{
+uint8_t x_31; 
+lean_dec(x_4);
+lean_dec(x_3);
+x_31 = !lean_is_exclusive(x_17);
+if (x_31 == 0)
+{
+return x_17;
+}
+else
+{
+lean_object* x_32; lean_object* x_33; lean_object* x_34; 
+x_32 = lean_ctor_get(x_17, 0);
+x_33 = lean_ctor_get(x_17, 1);
+lean_inc(x_33);
+lean_inc(x_32);
+lean_dec(x_17);
+x_34 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_34, 0, x_32);
+lean_ctor_set(x_34, 1, x_33);
+return x_34;
+}
+}
+}
+else
+{
+uint8_t x_35; 
+lean_dec(x_4);
+lean_dec(x_3);
+x_35 = !lean_is_exclusive(x_15);
+if (x_35 == 0)
+{
+return x_15;
+}
+else
+{
+lean_object* x_36; lean_object* x_37; lean_object* x_38; 
+x_36 = lean_ctor_get(x_15, 0);
+x_37 = lean_ctor_get(x_15, 1);
+lean_inc(x_37);
+lean_inc(x_36);
+lean_dec(x_15);
+x_38 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_38, 0, x_36);
+lean_ctor_set(x_38, 1, x_37);
+return x_38;
+}
+}
+}
+default: 
+{
+lean_object* x_39; 
+lean_inc(x_4);
+x_39 = l_Lean_Elab_Command_getEnv(x_4, x_5);
+if (lean_obj_tag(x_39) == 0)
+{
+lean_object* x_40; lean_object* x_41; lean_object* x_42; lean_object* x_43; 
+x_40 = lean_ctor_get(x_39, 0);
+lean_inc(x_40);
+x_41 = lean_ctor_get(x_39, 1);
+lean_inc(x_41);
+lean_dec(x_39);
+x_42 = l_Lean_mkPrivateName(x_40, x_3);
+lean_inc(x_42);
+x_43 = l_Lean_Elab_Command_checkNotAlreadyDeclared(x_1, x_42, x_4, x_41);
+if (lean_obj_tag(x_43) == 0)
+{
+uint8_t x_44; 
+x_44 = !lean_is_exclusive(x_43);
+if (x_44 == 0)
+{
+lean_object* x_45; 
+x_45 = lean_ctor_get(x_43, 0);
+lean_dec(x_45);
+lean_ctor_set(x_43, 0, x_42);
+return x_43;
+}
+else
+{
+lean_object* x_46; lean_object* x_47; 
+x_46 = lean_ctor_get(x_43, 1);
+lean_inc(x_46);
+lean_dec(x_43);
+x_47 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_47, 0, x_42);
+lean_ctor_set(x_47, 1, x_46);
+return x_47;
+}
+}
+else
+{
+uint8_t x_48; 
+lean_dec(x_42);
+x_48 = !lean_is_exclusive(x_43);
+if (x_48 == 0)
+{
+return x_43;
+}
+else
+{
+lean_object* x_49; lean_object* x_50; lean_object* x_51; 
+x_49 = lean_ctor_get(x_43, 0);
+x_50 = lean_ctor_get(x_43, 1);
+lean_inc(x_50);
+lean_inc(x_49);
+lean_dec(x_43);
+x_51 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_51, 0, x_49);
+lean_ctor_set(x_51, 1, x_50);
+return x_51;
+}
+}
+}
+else
+{
+uint8_t x_52; 
+lean_dec(x_4);
+lean_dec(x_3);
+x_52 = !lean_is_exclusive(x_39);
+if (x_52 == 0)
+{
+return x_39;
+}
+else
+{
+lean_object* x_53; lean_object* x_54; lean_object* x_55; 
+x_53 = lean_ctor_get(x_39, 0);
+x_54 = lean_ctor_get(x_39, 1);
+lean_inc(x_54);
+lean_inc(x_53);
+lean_dec(x_39);
+x_55 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_55, 0, x_53);
+lean_ctor_set(x_55, 1, x_54);
+return x_55;
+}
+}
+}
+}
+}
+}
+lean_object* l_Lean_Elab_Command_applyVisibility___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+uint8_t x_6; lean_object* x_7; 
+x_6 = lean_unbox(x_2);
+lean_dec(x_2);
+x_7 = l_Lean_Elab_Command_applyVisibility(x_1, x_6, x_3, x_4, x_5);
+lean_dec(x_1);
+return x_7;
+}
+}
+lean_object* l_Lean_Elab_Command_mkDeclName(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; 
+lean_inc(x_4);
+x_6 = l_Lean_Elab_Command_getCurrNamespace(x_4, x_5);
+if (lean_obj_tag(x_6) == 0)
+{
+lean_object* x_7; lean_object* x_8; lean_object* x_9; uint8_t x_10; lean_object* x_11; 
+x_7 = lean_ctor_get(x_6, 0);
+lean_inc(x_7);
+x_8 = lean_ctor_get(x_6, 1);
+lean_inc(x_8);
+lean_dec(x_6);
+x_9 = l_Lean_Name_append___main(x_7, x_3);
+lean_dec(x_7);
+x_10 = lean_ctor_get_uint8(x_2, sizeof(void*)*2);
+x_11 = l_Lean_Elab_Command_applyVisibility(x_1, x_10, x_9, x_4, x_8);
+return x_11;
+}
+else
+{
+uint8_t x_12; 
+lean_dec(x_4);
+lean_dec(x_3);
+x_12 = !lean_is_exclusive(x_6);
+if (x_12 == 0)
+{
+return x_6;
+}
+else
+{
+lean_object* x_13; lean_object* x_14; lean_object* x_15; 
+x_13 = lean_ctor_get(x_6, 0);
+x_14 = lean_ctor_get(x_6, 1);
+lean_inc(x_14);
+lean_inc(x_13);
+lean_dec(x_6);
+x_15 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_15, 0, x_13);
+lean_ctor_set(x_15, 1, x_14);
+return x_15;
+}
+}
+}
+}
+lean_object* l_Lean_Elab_Command_mkDeclName___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
+_start:
+{
+lean_object* x_6; 
+x_6 = l_Lean_Elab_Command_mkDeclName(x_1, x_2, x_3, x_4, x_5);
+lean_dec(x_2);
+lean_dec(x_1);
+return x_6;
+}
+}
 lean_object* l_Array_forMAux___main___at_Lean_Elab_Command_applyAttributes___spec__1(lean_object* x_1, lean_object* x_2, uint8_t x_3, lean_object* x_4, lean_object* x_5, lean_object* x_6, lean_object* x_7) {
 _start:
 {
@@ -2918,6 +3153,10 @@ l_Lean_Elab_Command_Attribute_hasFormat___closed__1 = _init_l_Lean_Elab_Command_
 lean_mark_persistent(l_Lean_Elab_Command_Attribute_hasFormat___closed__1);
 l_Lean_Elab_Command_Attribute_hasFormat___closed__2 = _init_l_Lean_Elab_Command_Attribute_hasFormat___closed__2();
 lean_mark_persistent(l_Lean_Elab_Command_Attribute_hasFormat___closed__2);
+l_Lean_Elab_Command_Attribute_inhabited___closed__1 = _init_l_Lean_Elab_Command_Attribute_inhabited___closed__1();
+lean_mark_persistent(l_Lean_Elab_Command_Attribute_inhabited___closed__1);
+l_Lean_Elab_Command_Attribute_inhabited = _init_l_Lean_Elab_Command_Attribute_inhabited();
+lean_mark_persistent(l_Lean_Elab_Command_Attribute_inhabited);
 l_Lean_Elab_Command_Visibility_hasToString___closed__1 = _init_l_Lean_Elab_Command_Visibility_hasToString___closed__1();
 lean_mark_persistent(l_Lean_Elab_Command_Visibility_hasToString___closed__1);
 l_Lean_Elab_Command_Modifiers_hasFormat___closed__1 = _init_l_Lean_Elab_Command_Modifiers_hasFormat___closed__1();

stage0/stdlib/Lean/Expr.c

@@ -16,6 +16,7 @@ extern "C" {
 lean_object* l_Lean_Expr_isBinding___boxed(lean_object*);
 lean_object* l_Lean_Expr_letName_x21___closed__2;
 lean_object* l___private_Lean_Expr_8__etaExpandedBody(lean_object*, lean_object*, lean_object*);
+uint8_t l_Lean_Expr_bindingInfo_x21(lean_object*);
 lean_object* l_Lean_Expr_updateSort___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* lean_expr_update_forall(lean_object*, uint8_t, lean_object*, lean_object*);
 lean_object* l_List_map___main___at_Lean_Expr_instantiateLevelParamsArray___spec__4___boxed(lean_object*, lean_object*, lean_object*);
@@ -64,6 +65,7 @@ lean_object* l_Lean_Expr_isLit___boxed(lean_object*);
 lean_object* l_Lean_Literal_hashable;
 uint64_t l_UInt64_add(uint64_t, uint64_t);
 lean_object* l_Lean_Expr_withAppAux___main___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_bindingInfo_x21___closed__1;
 uint64_t l_Bool_toUInt64(uint8_t);
 lean_object* l_Lean_Expr_updateMData_x21___closed__2;
 lean_object* l_Lean_Expr_instantiateLevelParamsArray___boxed(lean_object*, lean_object*, lean_object*);
@@ -108,6 +110,7 @@ lean_object* l_Lean_Expr_binderInfoEx___boxed(lean_object*);
 lean_object* l_Lean_Expr_InstantiateLevelParams_instantiate___main___at_Lean_Expr_instantiateLevelParams___spec__1(lean_object*, lean_object*, lean_object*);
 uint8_t l_Lean_Expr_isApp(lean_object*);
 lean_object* l_Lean_Expr_Data_binderInfo___boxed(lean_object*);
+uint8_t l_Lean_Expr_hasLooseBVarInExplicitDomain(lean_object*, lean_object*, uint8_t);
 lean_object* l_Lean_Expr_hasFVarEx___boxed(lean_object*);
 size_t l_Lean_Level_hash(lean_object*);
 lean_object* l_Lean_Expr_lt___boxed(lean_object*, lean_object*);
@@ -185,6 +188,7 @@ lean_object* lean_expr_lower_loose_bvars(lean_object*, lean_object*, lean_object
 lean_object* l_Lean_Expr_isMVar___boxed(lean_object*);
 uint8_t l_Lean_Expr_Data_hasExprMVar(uint64_t);
 lean_object* l_Lean_Literal_type(lean_object*);
+lean_object* l_Lean_Expr_hasLooseBVarInExplicitDomain___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Literal_beq___boxed(lean_object*, lean_object*);
 lean_object* l_Lean_Expr_isConstOf___boxed(lean_object*, lean_object*);
 lean_object* l___private_Lean_Expr_1__Expr_mkDataCore___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
@@ -413,6 +417,7 @@ lean_object* l_Lean_Expr_updateFn___main(lean_object*, lean_object*);
 lean_object* l_Lean_mkApp7(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Expr_updateLambda_x21___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* lean_expr_mk_proj(lean_object*, lean_object*, lean_object*);
+uint8_t l_Lean_Expr_hasLooseBVarInExplicitDomain___main(lean_object*, lean_object*, uint8_t);
 lean_object* l_Lean_Expr_appFn_x21___closed__2;
 lean_object* l_List_foldl___main___at_Lean_mkConst___spec__2___boxed(lean_object*, lean_object*);
 lean_object* l_Lean_Expr_Data_hasExprMVar___boxed(lean_object*);
@@ -430,6 +435,7 @@ lean_object* l_Lean_Expr_isStringLit___boxed(lean_object*);
 lean_object* l_Lean_Expr_withAppRev(lean_object*);
 lean_object* l_Lean_Expr_quickLt___boxed(lean_object*, lean_object*);
 uint64_t l_UInt32_toUInt64(uint32_t);
+lean_object* l_Lean_Expr_inferImplicit___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_BinderInfo_isAuxDecl___boxed(lean_object*);
 uint8_t l_Lean_Expr_isFVar(lean_object*);
 lean_object* l___private_Lean_Expr_2__mkAppRangeAux___main(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -477,8 +483,10 @@ lean_object* l_Lean_Expr_InstantiateLevelParams_instantiate___main___at_Lean_Exp
 uint8_t l_Lean_Expr_Data_hasBeq(uint64_t, uint64_t);
 lean_object* l___private_Lean_Expr_6__mkAppRevRangeAux___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 uint32_t lean_expr_loose_bvar_range(lean_object*);
+lean_object* l_Lean_Expr_inferImplicit(lean_object*, lean_object*, uint8_t);
 lean_object* l_Lean_Expr_mkAppRevRange___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Expr_updateForallE_x21(lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_inferImplicit___main___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Expr_HasToString;
 lean_object* l_Lean_BinderInfo_hashable;
 lean_object* l_Lean_Expr_InstantiateLevelParams_instantiate___main(lean_object*, lean_object*);
@@ -495,6 +503,7 @@ lean_object* l_Lean_Expr_isHeadBetaTarget___boxed(lean_object*);
 lean_object* l___private_Lean_Expr_6__mkAppRevRangeAux___main___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Expr_Data_nonDepLet___boxed(lean_object*);
 lean_object* l___private_Lean_Expr_7__betaRevAux___main___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_inferImplicit___main(lean_object*, lean_object*, uint8_t);
 lean_object* l_Lean_mkNatLit(lean_object*);
 lean_object* l_Lean_mkStrLit(lean_object*);
 lean_object* l_Lean_Expr_getArgD(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -531,6 +540,7 @@ lean_object* l_Lean_Expr_updateLet_x21(lean_object*, lean_object*, lean_object*,
 uint8_t l_Lean_Literal_lt(lean_object*, lean_object*);
 lean_object* l_Lean_Expr_updateForall___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_mkConst(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_bindingInfo_x21___boxed(lean_object*);
 lean_object* l_Lean_Expr_isLambda___boxed(lean_object*);
 lean_object* l_Lean_Expr_constName_x21(lean_object*);
 lean_object* lean_expr_instantiate_range(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -554,6 +564,7 @@ lean_object* l_Lean_mkLocal___boxed(lean_object*, lean_object*, lean_object*, le
 lean_object* l_Lean_mkApp3(lean_object*, lean_object*, lean_object*, lean_object*);
 uint8_t l_Lean_Expr_isSort(lean_object*);
 uint8_t l_Lean_Expr_isLet(lean_object*);
+lean_object* l_Lean_Expr_hasLooseBVarInExplicitDomain___main___boxed(lean_object*, lean_object*, lean_object*);
 uint8_t lean_string_dec_lt(lean_object*, lean_object*);
 lean_object* l_Lean_Expr_isLet___boxed(lean_object*);
 lean_object* l_Lean_ExprStructEq_hash___boxed(lean_object*);
@@ -6376,6 +6387,60 @@ lean_dec(x_1);
 return x_2;
 }
 }
+lean_object* _init_l_Lean_Expr_bindingInfo_x21___closed__1() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
+x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
+x_2 = lean_unsigned_to_nat(557u);
+x_3 = lean_unsigned_to_nat(21u);
+x_4 = l_Lean_Expr_bindingName_x21___closed__1;
+x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
+return x_5;
+}
+}
+uint8_t l_Lean_Expr_bindingInfo_x21(lean_object* x_1) {
+_start:
+{
+switch (lean_obj_tag(x_1)) {
+case 6:
+{
+uint64_t x_2; uint8_t x_3; 
+x_2 = lean_ctor_get_uint64(x_1, sizeof(void*)*3);
+x_3 = (uint8_t)((x_2 << 24) >> 61);
+return x_3;
+}
+case 7:
+{
+uint64_t x_4; uint8_t x_5; 
+x_4 = lean_ctor_get_uint64(x_1, sizeof(void*)*3);
+x_5 = (uint8_t)((x_4 << 24) >> 61);
+return x_5;
+}
+default: 
+{
+uint8_t x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; uint8_t x_10; 
+x_6 = l_Lean_BinderInfo_inhabited;
+x_7 = l_Lean_Expr_bindingInfo_x21___closed__1;
+x_8 = lean_box(x_6);
+x_9 = lean_panic_fn(x_8, x_7);
+x_10 = lean_unbox(x_9);
+lean_dec(x_9);
+return x_10;
+}
+}
+}
+}
+lean_object* l_Lean_Expr_bindingInfo_x21___boxed(lean_object* x_1) {
+_start:
+{
+uint8_t x_2; lean_object* x_3; 
+x_2 = l_Lean_Expr_bindingInfo_x21(x_1);
+lean_dec(x_1);
+x_3 = lean_box(x_2);
+return x_3;
+}
+}
 lean_object* _init_l_Lean_Expr_letName_x21___closed__1() {
 _start:
 {
@@ -6389,7 +6454,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(556u);
+x_2 = lean_unsigned_to_nat(561u);
 x_3 = lean_unsigned_to_nat(20u);
 x_4 = l_Lean_Expr_letName_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -6500,6 +6565,101 @@ x_4 = lean_box(x_3);
 return x_4;
 }
 }
+uint8_t l_Lean_Expr_hasLooseBVarInExplicitDomain___main(lean_object* x_1, lean_object* x_2, uint8_t x_3) {
+_start:
+{
+if (lean_obj_tag(x_1) == 7)
+{
+lean_object* x_4; lean_object* x_5; uint64_t x_6; uint8_t x_7; uint8_t x_8; 
+x_4 = lean_ctor_get(x_1, 1);
+x_5 = lean_ctor_get(x_1, 2);
+x_6 = lean_ctor_get_uint64(x_1, sizeof(void*)*3);
+x_7 = (uint8_t)((x_6 << 24) >> 61);
+x_8 = l_Lean_BinderInfo_isExplicit(x_7);
+if (x_8 == 0)
+{
+lean_object* x_9; lean_object* x_10; 
+x_9 = lean_unsigned_to_nat(1u);
+x_10 = lean_nat_add(x_2, x_9);
+lean_dec(x_2);
+x_1 = x_5;
+x_2 = x_10;
+goto _start;
+}
+else
+{
+uint8_t x_12; 
+x_12 = lean_expr_has_loose_bvar(x_4, x_2);
+if (x_12 == 0)
+{
+lean_object* x_13; lean_object* x_14; 
+x_13 = lean_unsigned_to_nat(1u);
+x_14 = lean_nat_add(x_2, x_13);
+lean_dec(x_2);
+x_1 = x_5;
+x_2 = x_14;
+goto _start;
+}
+else
+{
+uint8_t x_16; 
+lean_dec(x_2);
+x_16 = 1;
+return x_16;
+}
+}
+}
+else
+{
+if (x_3 == 0)
+{
+uint8_t x_17; 
+lean_dec(x_2);
+x_17 = 0;
+return x_17;
+}
+else
+{
+uint8_t x_18; 
+x_18 = lean_expr_has_loose_bvar(x_1, x_2);
+lean_dec(x_2);
+return x_18;
+}
+}
+}
+}
+lean_object* l_Lean_Expr_hasLooseBVarInExplicitDomain___main___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+_start:
+{
+uint8_t x_4; uint8_t x_5; lean_object* x_6; 
+x_4 = lean_unbox(x_3);
+lean_dec(x_3);
+x_5 = l_Lean_Expr_hasLooseBVarInExplicitDomain___main(x_1, x_2, x_4);
+lean_dec(x_1);
+x_6 = lean_box(x_5);
+return x_6;
+}
+}
+uint8_t l_Lean_Expr_hasLooseBVarInExplicitDomain(lean_object* x_1, lean_object* x_2, uint8_t x_3) {
+_start:
+{
+uint8_t x_4; 
+x_4 = l_Lean_Expr_hasLooseBVarInExplicitDomain___main(x_1, x_2, x_3);
+return x_4;
+}
+}
+lean_object* l_Lean_Expr_hasLooseBVarInExplicitDomain___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+_start:
+{
+uint8_t x_4; uint8_t x_5; lean_object* x_6; 
+x_4 = lean_unbox(x_3);
+lean_dec(x_3);
+x_5 = l_Lean_Expr_hasLooseBVarInExplicitDomain(x_1, x_2, x_4);
+lean_dec(x_1);
+x_6 = lean_box(x_5);
+return x_6;
+}
+}
 lean_object* l_Lean_Expr_lowerLooseBVars___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
 _start:
 {
@@ -6522,6 +6682,103 @@ lean_dec(x_1);
 return x_4;
 }
 }
+lean_object* l_Lean_Expr_inferImplicit___main(lean_object* x_1, lean_object* x_2, uint8_t x_3) {
+_start:
+{
+if (lean_obj_tag(x_1) == 7)
+{
+lean_object* x_4; lean_object* x_5; lean_object* x_6; uint64_t x_7; lean_object* x_8; uint8_t x_9; 
+x_4 = lean_ctor_get(x_1, 0);
+lean_inc(x_4);
+x_5 = lean_ctor_get(x_1, 1);
+lean_inc(x_5);
+x_6 = lean_ctor_get(x_1, 2);
+lean_inc(x_6);
+x_7 = lean_ctor_get_uint64(x_1, sizeof(void*)*3);
+x_8 = lean_unsigned_to_nat(0u);
+x_9 = lean_nat_dec_eq(x_2, x_8);
+if (x_9 == 0)
+{
+lean_object* x_10; lean_object* x_11; lean_object* x_12; uint8_t x_13; uint8_t x_14; 
+lean_dec(x_1);
+x_10 = lean_unsigned_to_nat(1u);
+x_11 = lean_nat_sub(x_2, x_10);
+x_12 = l_Lean_Expr_inferImplicit___main(x_6, x_11, x_3);
+lean_dec(x_11);
+x_13 = (uint8_t)((x_7 << 24) >> 61);
+x_14 = l_Lean_BinderInfo_isExplicit(x_13);
+if (x_14 == 0)
+{
+lean_object* x_15; 
+x_15 = l_Lean_mkForall(x_4, x_13, x_5, x_12);
+lean_dec(x_4);
+return x_15;
+}
+else
+{
+uint8_t x_16; 
+x_16 = l_Lean_Expr_hasLooseBVarInExplicitDomain___main(x_12, x_8, x_3);
+if (x_16 == 0)
+{
+lean_object* x_17; 
+x_17 = l_Lean_mkForall(x_4, x_13, x_5, x_12);
+lean_dec(x_4);
+return x_17;
+}
+else
+{
+uint8_t x_18; lean_object* x_19; 
+x_18 = 1;
+x_19 = l_Lean_mkForall(x_4, x_18, x_5, x_12);
+lean_dec(x_4);
+return x_19;
+}
+}
+}
+else
+{
+lean_dec(x_6);
+lean_dec(x_5);
+lean_dec(x_4);
+return x_1;
+}
+}
+else
+{
+return x_1;
+}
+}
+}
+lean_object* l_Lean_Expr_inferImplicit___main___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+_start:
+{
+uint8_t x_4; lean_object* x_5; 
+x_4 = lean_unbox(x_3);
+lean_dec(x_3);
+x_5 = l_Lean_Expr_inferImplicit___main(x_1, x_2, x_4);
+lean_dec(x_2);
+return x_5;
+}
+}
+lean_object* l_Lean_Expr_inferImplicit(lean_object* x_1, lean_object* x_2, uint8_t x_3) {
+_start:
+{
+lean_object* x_4; 
+x_4 = l_Lean_Expr_inferImplicit___main(x_1, x_2, x_3);
+return x_4;
+}
+}
+lean_object* l_Lean_Expr_inferImplicit___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+_start:
+{
+uint8_t x_4; lean_object* x_5; 
+x_4 = lean_unbox(x_3);
+lean_dec(x_3);
+x_5 = l_Lean_Expr_inferImplicit(x_1, x_2, x_4);
+lean_dec(x_2);
+return x_5;
+}
+}
 lean_object* l_Lean_Expr_instantiate___boxed(lean_object* x_1, lean_object* x_2) {
 _start:
 {
@@ -7784,7 +8041,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(797u);
+x_2 = lean_unsigned_to_nat(823u);
 x_3 = lean_unsigned_to_nat(18u);
 x_4 = l_Lean_Expr_appFn_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -7826,7 +8083,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(806u);
+x_2 = lean_unsigned_to_nat(832u);
 x_3 = lean_unsigned_to_nat(18u);
 x_4 = l_Lean_Expr_constName_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -7875,7 +8132,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(815u);
+x_2 = lean_unsigned_to_nat(841u);
 x_3 = lean_unsigned_to_nat(14u);
 x_4 = l_Lean_Expr_updateSort_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -7932,7 +8189,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(832u);
+x_2 = lean_unsigned_to_nat(858u);
 x_3 = lean_unsigned_to_nat(17u);
 x_4 = l_Lean_Expr_updateMData_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -7973,7 +8230,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(837u);
+x_2 = lean_unsigned_to_nat(863u);
 x_3 = lean_unsigned_to_nat(18u);
 x_4 = l_Lean_Expr_updateProj_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -8024,7 +8281,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(846u);
+x_2 = lean_unsigned_to_nat(872u);
 x_3 = lean_unsigned_to_nat(21u);
 x_4 = l_Lean_Expr_updateForall_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -8068,7 +8325,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(851u);
+x_2 = lean_unsigned_to_nat(877u);
 x_3 = lean_unsigned_to_nat(21u);
 x_4 = l_Lean_Expr_updateForall_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -8122,7 +8379,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(860u);
+x_2 = lean_unsigned_to_nat(886u);
 x_3 = lean_unsigned_to_nat(17u);
 x_4 = l_Lean_Expr_updateLambda_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -8166,7 +8423,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(865u);
+x_2 = lean_unsigned_to_nat(891u);
 x_3 = lean_unsigned_to_nat(17u);
 x_4 = l_Lean_Expr_updateLambda_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -8210,7 +8467,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l___private_Lean_Expr_1__Expr_mkDataCore___closed__1;
-x_2 = lean_unsigned_to_nat(874u);
+x_2 = lean_unsigned_to_nat(900u);
 x_3 = lean_unsigned_to_nat(20u);
 x_4 = l_Lean_Expr_letName_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -10222,6 +10479,8 @@ l_Lean_Expr_bindingDomain_x21___closed__1 = _init_l_Lean_Expr_bindingDomain_x21_
 lean_mark_persistent(l_Lean_Expr_bindingDomain_x21___closed__1);
 l_Lean_Expr_bindingBody_x21___closed__1 = _init_l_Lean_Expr_bindingBody_x21___closed__1();
 lean_mark_persistent(l_Lean_Expr_bindingBody_x21___closed__1);
+l_Lean_Expr_bindingInfo_x21___closed__1 = _init_l_Lean_Expr_bindingInfo_x21___closed__1();
+lean_mark_persistent(l_Lean_Expr_bindingInfo_x21___closed__1);
 l_Lean_Expr_letName_x21___closed__1 = _init_l_Lean_Expr_letName_x21___closed__1();
 lean_mark_persistent(l_Lean_Expr_letName_x21___closed__1);
 l_Lean_Expr_letName_x21___closed__2 = _init_l_Lean_Expr_letName_x21___closed__2();

stage0/stdlib/Lean/Level.c

@@ -191,6 +191,7 @@ lean_object* l___private_Lean_Level_5__mkMaxAux___main(lean_object*, lean_object
 lean_object* l_Lean_Level_normLt___boxed(lean_object*, lean_object*);
 lean_object* l___private_Lean_Level_3__getMaxArgsAux___main___at_Lean_Level_normalize___main___spec__1___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* lean_panic_fn(lean_object*, lean_object*);
+lean_object* l_Lean_Level_mkNaryMax(lean_object*);
 lean_object* l_Lean_Level_Data_depth___boxed(lean_object*);
 uint32_t l_USize_toUInt32(size_t);
 lean_object* l_Lean_Level_normalize(lean_object*);
@@ -238,6 +239,7 @@ lean_object* l_Lean_Level_updateSucc_x21___closed__1;
 uint64_t l_UInt64_shiftRight(uint64_t, uint64_t);
 lean_object* l_Lean_Name_toStringWithSep___main(lean_object*, lean_object*);
 uint8_t l_Lean_Level_Data_hasBeq(uint64_t, uint64_t);
+lean_object* l_Lean_Level_mkNaryMax___main(lean_object*);
 lean_object* l_Lean_mkLevelParam(lean_object*);
 lean_object* l_Lean_levelOne;
 lean_object* l_Lean_Level_Lean_HasFormat___closed__1;
@@ -4007,7 +4009,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l_Lean_Level_mkData___closed__2;
-x_2 = lean_unsigned_to_nat(435u);
+x_2 = lean_unsigned_to_nat(436u);
 x_3 = lean_unsigned_to_nat(16u);
 x_4 = l_Lean_Level_updateSucc_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -4056,7 +4058,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l_Lean_Level_mkData___closed__2;
-x_2 = lean_unsigned_to_nat(444u);
+x_2 = lean_unsigned_to_nat(445u);
 x_3 = lean_unsigned_to_nat(19u);
 x_4 = l_Lean_Level_updateMax_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -4106,7 +4108,7 @@ _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; lean_object* x_4; lean_object* x_5; 
 x_1 = l_Lean_Level_mkData___closed__2;
-x_2 = lean_unsigned_to_nat(453u);
+x_2 = lean_unsigned_to_nat(454u);
 x_3 = lean_unsigned_to_nat(20u);
 x_4 = l_Lean_Level_updateIMax_x21___closed__1;
 x_5 = l___private_Init_Util_1__mkPanicMessage(x_1, x_2, x_3, x_4);
@@ -4135,6 +4137,49 @@ return x_7;
 }
 }
 }
+lean_object* l_Lean_Level_mkNaryMax___main(lean_object* x_1) {
+_start:
+{
+if (lean_obj_tag(x_1) == 0)
+{
+lean_object* x_2; 
+x_2 = l_Lean_levelZero;
+return x_2;
+}
+else
+{
+lean_object* x_3; 
+x_3 = lean_ctor_get(x_1, 1);
+lean_inc(x_3);
+if (lean_obj_tag(x_3) == 0)
+{
+lean_object* x_4; 
+x_4 = lean_ctor_get(x_1, 0);
+lean_inc(x_4);
+lean_dec(x_1);
+return x_4;
+}
+else
+{
+lean_object* x_5; lean_object* x_6; lean_object* x_7; 
+x_5 = lean_ctor_get(x_1, 0);
+lean_inc(x_5);
+lean_dec(x_1);
+x_6 = l_Lean_Level_mkNaryMax___main(x_3);
+x_7 = l_Lean_mkLevelMax(x_5, x_6);
+return x_7;
+}
+}
+}
+}
+lean_object* l_Lean_Level_mkNaryMax(lean_object* x_1) {
+_start:
+{
+lean_object* x_2; 
+x_2 = l_Lean_Level_mkNaryMax___main(x_1);
+return x_2;
+}
+}
 lean_object* l_Lean_Level_instantiateParams___main(lean_object* x_1, lean_object* x_2) {
 _start:
 {

stage0/stdlib/Lean/Meta/AppBuilder.c

@@ -38,6 +38,7 @@ lean_object* l_Lean_Meta_mkEqRec(lean_object*, lean_object*, lean_object*, lean_
 lean_object* l_Lean_Expr_appFn_x21(lean_object*);
 uint8_t l_Lean_Expr_isAppOf(lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_AppBuilder_1__infer(lean_object*, lean_object*, lean_object*);
+extern lean_object* l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 lean_object* lean_array_push(lean_object*, lean_object*);
 lean_object* lean_array_get_size(lean_object*);
 lean_object* l_Lean_Expr_getAppFn___main(lean_object*);
@@ -149,7 +150,6 @@ lean_object* l_Lean_Meta_mkFreshLevelMVar___rarg(lean_object*);
 extern lean_object* l_Lean_mkOptionalNode___closed__2;
 lean_object* l_Lean_Meta_mkHEq(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_mkHEqTrans___closed__1;
-extern lean_object* l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
 lean_object* l_Array_iterateMAux___main___at_Lean_mkAppN___spec__1(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_AppBuilder_4__mkFun___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_mkHEqRefl(lean_object*, lean_object*, lean_object*);
@@ -5655,7 +5655,7 @@ lean_object* _init_l_Lean_Meta_mkAppM___closed__1() {
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l_Lean_Meta_Exception_toTraceMessageData___closed__68;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;

stage0/stdlib/Lean/Meta/Check.c

@@ -26,6 +26,7 @@ lean_object* l_Lean_Meta_isExprDefEqAux(lean_object*, lean_object*, lean_object*
 uint8_t l_Lean_checkTraceOption(lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Check_2__checkLambdaLet___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_forMAux___main___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
+extern lean_object* l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 lean_object* lean_array_get_size(lean_object*);
 lean_object* l___private_Lean_Meta_Check_2__checkLambdaLet___lambda__2___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_forallTelescope___rarg(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -77,7 +78,6 @@ lean_object* l___private_Lean_Meta_Check_7__regTraceClasses(lean_object*);
 lean_object* l___private_Lean_Meta_Check_3__checkForall___at___private_Lean_Meta_Check_6__checkAux___main___spec__4___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Check_2__checkLambdaLet___at___private_Lean_Meta_Check_6__checkAux___main___spec__2___lambda__1(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_Exception_toTraceMessageData(lean_object*);
-extern lean_object* l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
 lean_object* l___private_Lean_Util_Trace_2__addNode___at_Lean_Meta_check___spec__2___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Check_3__checkForall___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 extern lean_object* l_Lean_MetavarContext_MkBinding_mkBinding___closed__1;
@@ -2682,7 +2682,7 @@ lean_object* _init_l_Lean_Meta_check___closed__2() {
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l_Lean_Meta_check___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;
@@ -4291,7 +4291,7 @@ lean_object* _init_l_Lean_Meta_isTypeCorrect___closed__2() {
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l_Lean_Meta_isTypeCorrect___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;

stage0/stdlib/Lean/Meta/InferType.c

@@ -19,14 +19,12 @@ lean_object* l_Lean_Level_normalize___main(lean_object*);
 uint8_t l___private_Lean_Meta_InferType_11__isAlwaysZero(lean_object*);
 lean_object* l___private_Lean_Meta_InferType_5__inferLambdaType(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_mkSort(lean_object*);
-lean_object* l_Lean_Meta_isTypeFormerAux___main___lambda__1(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_unreachable_x21___rarg(lean_object*);
 lean_object* l___private_Lean_Expr_3__getAppArgsAux___main(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_12__isArrowProp___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_16__isArrowType(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Nat_foldMAux___main___at___private_Lean_Meta_InferType_3__inferProjType___spec__1(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_4__inferForallType___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
-lean_object* l_Lean_Meta_isTypeFormerAux(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_mkForall(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_13__isPropQuickApp(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_11__isAlwaysZero___main___boxed(lean_object*);
@@ -83,6 +81,7 @@ lean_object* l___private_Lean_Meta_InferType_8__inferFVarType(lean_object*, lean
 lean_object* l___private_Lean_Meta_InferType_4__inferForallType___closed__1;
 lean_object* l_Lean_Meta_inferTypeImpl(lean_object*, lean_object*, lean_object*);
 lean_object* l_Std_PersistentHashMap_findAtAux___main___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__3___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Meta_isTypeFormerType___main(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_9__checkInferTypeCache(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Std_PersistentHashMap_find_x3f___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__1___boxed(lean_object*, lean_object*);
 lean_object* l_Std_PersistentHashMap_findAux___main___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__2___boxed(lean_object*, lean_object*, lean_object*);
@@ -92,6 +91,7 @@ lean_object* l_Lean_Meta_isProof(lean_object*, lean_object*, lean_object*);
 size_t l_USize_mul(size_t, size_t);
 lean_object* l_Lean_Meta_setInferTypeRef___closed__1;
 lean_object* l_Lean_Meta_whnf(lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Meta_isTypeFormerType(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_mkFVar(lean_object*);
 uint8_t l_Lean_Expr_Data_binderInfo(uint64_t);
 lean_object* l_Std_PersistentHashMap_insertAtCollisionNodeAux___main___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__6(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -124,7 +124,6 @@ lean_object* l___private_Lean_Meta_InferType_7__inferMVarType___boxed(lean_objec
 lean_object* l_Nat_foldMAux___main___at___private_Lean_Meta_InferType_1__inferAppType___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_12__isArrowProp(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Expr_2__mkAppRangeAux___main(lean_object*, lean_object*, lean_object*, lean_object*);
-lean_object* l_Lean_Meta_isTypeFormerAux___main___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_inferType(lean_object*, lean_object*, lean_object*);
 lean_object* lean_io_ref_set(lean_object*, lean_object*, lean_object*);
 uint8_t l_Lean_Expr_hasLooseBVars(lean_object*);
@@ -137,6 +136,7 @@ lean_object* l___private_Lean_Meta_InferType_13__isPropQuickApp___main(lean_obje
 lean_object* l_Lean_Meta_mkFreshLevelMVar___rarg(lean_object*);
 extern lean_object* l_Lean_Meta_isClassQuick___main___closed__1;
 lean_object* l_Lean_Meta_isReadOnlyOrSyntheticOpaqueExprMVar(lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Meta_isTypeFormerType___main___lambda__1(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Std_PersistentHashMap_insert___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__4(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_2__inferConstType___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* lean_local_ctx_find(lean_object*, lean_object*);
@@ -149,7 +149,7 @@ lean_object* l_Lean_Meta_isProp(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_15__isProofQuickApp___main(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Nat_foldMAux___main___at___private_Lean_Meta_InferType_3__inferProjType___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_InferType_1__inferAppType(lean_object*, lean_object*, lean_object*, lean_object*);
-lean_object* l_Lean_Meta_isTypeFormerAux___main(lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Meta_isTypeFormerType___main___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_mkConst(lean_object*, lean_object*);
 lean_object* l_Lean_Meta_isType(lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at___private_Lean_Meta_InferType_9__checkInferTypeCache___spec__7(size_t, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
@@ -7698,16 +7698,16 @@ return x_56;
 }
 }
 }
-lean_object* l_Lean_Meta_isTypeFormerAux___main___lambda__1(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+lean_object* l_Lean_Meta_isTypeFormerType___main___lambda__1(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
 _start:
 {
 lean_object* x_5; lean_object* x_6; 
 x_5 = lean_expr_instantiate1(x_1, x_2);
-x_6 = l_Lean_Meta_isTypeFormerAux___main(x_5, x_3, x_4);
+x_6 = l_Lean_Meta_isTypeFormerType___main(x_5, x_3, x_4);
 return x_6;
 }
 }
-lean_object* l_Lean_Meta_isTypeFormerAux___main(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+lean_object* l_Lean_Meta_isTypeFormerType___main(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
 _start:
 {
 lean_object* x_4; 
@@ -7764,7 +7764,7 @@ lean_inc(x_17);
 x_18 = lean_ctor_get_uint64(x_5, sizeof(void*)*3);
 lean_dec(x_5);
 x_19 = (uint8_t)((x_18 << 24) >> 61);
-x_20 = lean_alloc_closure((void*)(l_Lean_Meta_isTypeFormerAux___main___lambda__1___boxed), 4, 1);
+x_20 = lean_alloc_closure((void*)(l_Lean_Meta_isTypeFormerType___main___lambda__1___boxed), 4, 1);
 lean_closure_set(x_20, 0, x_17);
 x_21 = l_Lean_Meta_withLocalDecl___rarg(x_15, x_16, x_19, x_20, x_2, x_14);
 return x_21;
@@ -7826,21 +7826,21 @@ return x_33;
 }
 }
 }
-lean_object* l_Lean_Meta_isTypeFormerAux___main___lambda__1___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+lean_object* l_Lean_Meta_isTypeFormerType___main___lambda__1___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
 _start:
 {
 lean_object* x_5; 
-x_5 = l_Lean_Meta_isTypeFormerAux___main___lambda__1(x_1, x_2, x_3, x_4);
+x_5 = l_Lean_Meta_isTypeFormerType___main___lambda__1(x_1, x_2, x_3, x_4);
 lean_dec(x_2);
 lean_dec(x_1);
 return x_5;
 }
 }
-lean_object* l_Lean_Meta_isTypeFormerAux(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
+lean_object* l_Lean_Meta_isTypeFormerType(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
 _start:
 {
 lean_object* x_4; 
-x_4 = l_Lean_Meta_isTypeFormerAux___main(x_1, x_2, x_3);
+x_4 = l_Lean_Meta_isTypeFormerType___main(x_1, x_2, x_3);
 return x_4;
 }
 }
@@ -7858,7 +7858,7 @@ lean_inc(x_5);
 x_6 = lean_ctor_get(x_4, 1);
 lean_inc(x_6);
 lean_dec(x_4);
-x_7 = l_Lean_Meta_isTypeFormerAux___main(x_5, x_2, x_6);
+x_7 = l_Lean_Meta_isTypeFormerType___main(x_5, x_2, x_6);
 return x_7;
 }
 else

stage0/stdlib/Lean/Meta/LevelDefEq.c

@@ -44,6 +44,7 @@ lean_object* l_Lean_Meta_instantiateLevelMVars(lean_object*, lean_object*, lean_
 lean_object* l___private_Lean_Meta_LevelDefEq_10__processPostponedStep___closed__3;
 lean_object* l_Lean_Meta_isLevelDefEq___closed__3;
 lean_object* l___private_Lean_Meta_LevelDefEq_12__processPostponed(lean_object*, lean_object*);
+extern lean_object* l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 lean_object* l_Lean_Meta_isExprDefEq___closed__1;
 lean_object* lean_array_get_size(lean_object*);
 lean_object* l_Lean_Meta_isLevelDefEqAux___main___closed__5;
@@ -139,7 +140,6 @@ lean_object* l_Lean_Meta_isLevelDefEq___closed__2;
 lean_object* l___private_Lean_Meta_LevelDefEq_4__mkMaxArgsDiff___main___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_LevelDefEq_1__decAux_x3f(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_restore___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
-extern lean_object* l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
 lean_object* l_Lean_Meta_commitWhen___at_Lean_Meta_isLevelDefEq___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_LevelDefEq_1__decAux_x3f___main(lean_object*, lean_object*, lean_object*);
 lean_object* l_Std_PersistentArray_foldlMAux___main___at___private_Lean_Meta_LevelDefEq_10__processPostponedStep___spec__2___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -1520,7 +1520,7 @@ lean_object* _init_l_Lean_Meta_isLevelDefEqAux___main___closed__2() {
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l_Lean_Meta_isLevelDefEqAux___main___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;
@@ -11166,7 +11166,7 @@ lean_object* _init_l_Lean_Meta_isExprDefEq___closed__2() {
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l_Lean_Meta_isExprDefEq___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;

stage0/stdlib/Lean/Meta/Tactic/Apply.c

@@ -24,7 +24,6 @@ extern lean_object* l_Lean_MessageData_ofList___closed__3;
 uint8_t lean_name_eq(lean_object*, lean_object*);
 lean_object* l_Lean_Meta_withLocalContext___rarg(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* lean_array_fswap(lean_object*, lean_object*, lean_object*);
-extern lean_object* l_Array_empty___closed__1;
 lean_object* l_Lean_Meta_getMVarTag(lean_object*, lean_object*, lean_object*);
 lean_object* l_List_append___rarg(lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Tactic_Apply_3__throwApplyError___rarg___closed__5;
@@ -55,13 +54,13 @@ lean_object* l_Lean_Meta_apply___boxed(lean_object*, lean_object*, lean_object*,
 lean_object* lean_array_get(lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___spec__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___boxed(lean_object*, lean_object*, lean_object*);
-lean_object* l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1;
 lean_object* l_Lean_Meta_renameMVar(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_FindMVar_main___main___at___private_Lean_Meta_Tactic_Apply_4__dependsOnOthers___spec__1___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_apply___lambda__1(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_FindMVar_main___main___at___private_Lean_Meta_Tactic_Apply_4__dependsOnOthers___spec__1(lean_object*, lean_object*, lean_object*);
 lean_object* lean_name_mk_string(lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Tactic_Apply_3__throwApplyError___rarg(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
+extern lean_object* l_Lean_importModules___closed__1;
 uint8_t l_Lean_BinderInfo_isInstImplicit(uint8_t);
 lean_object* l___private_Lean_Meta_Tactic_Apply_1__getExpectedNumArgsAux___lambda__1___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Tactic_Apply_2__getExpectedNumArgs(lean_object*, lean_object*, lean_object*);
@@ -1640,23 +1639,12 @@ return x_47;
 }
 }
 }
-lean_object* _init_l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1() {
-_start:
-{
-lean_object* x_1; lean_object* x_2; 
-x_1 = l_Array_empty___closed__1;
-x_2 = lean_alloc_ctor(0, 2, 0);
-lean_ctor_set(x_2, 0, x_1);
-lean_ctor_set(x_2, 1, x_1);
-return x_2;
-}
-}
 lean_object* l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst(lean_object* x_1, lean_object* x_2, lean_object* x_3) {
 _start:
 {
 lean_object* x_4; lean_object* x_5; lean_object* x_6; 
 x_4 = lean_unsigned_to_nat(0u);
-x_5 = l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1;
+x_5 = l_Lean_importModules___closed__1;
 x_6 = l_Array_iterateMAux___main___at___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___spec__1(x_1, x_1, x_4, x_5, x_2, x_3);
 if (lean_obj_tag(x_6) == 0)
 {
@@ -2590,8 +2578,6 @@ l_Nat_forMAux___main___at_Lean_Meta_synthAppInstances___spec__1___closed__2 = _i
 lean_mark_persistent(l_Nat_forMAux___main___at_Lean_Meta_synthAppInstances___spec__1___closed__2);
 l_Nat_forMAux___main___at_Lean_Meta_synthAppInstances___spec__1___closed__3 = _init_l_Nat_forMAux___main___at_Lean_Meta_synthAppInstances___spec__1___closed__3();
 lean_mark_persistent(l_Nat_forMAux___main___at_Lean_Meta_synthAppInstances___spec__1___closed__3);
-l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1 = _init_l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1();
-lean_mark_persistent(l___private_Lean_Meta_Tactic_Apply_5__reorderNonDependentFirst___closed__1);
 return lean_mk_io_result(lean_box(0));
 }
 #ifdef __cplusplus

stage0/stdlib/Lean/Meta/Tactic/Cases.c

@@ -82,6 +82,7 @@ lean_object* l_Nat_anyAux___main___at___private_Lean_Meta_Tactic_Cases_5__hasInd
 lean_object* l_Array_umapMAux___main___at___private_Lean_Meta_Tactic_Cases_8__unifyEqsAux___main___spec__2(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_MetavarContext_8__dep___main___at___private_Lean_Meta_Tactic_Cases_5__hasIndepIndices___spec__36(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Expr_appFn_x21(lean_object*);
+extern lean_object* l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 lean_object* l_Std_PersistentArray_anyMAux___main___at___private_Lean_Meta_Tactic_Cases_5__hasIndepIndices___spec__14___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* lean_array_push(lean_object*, lean_object*);
 lean_object* lean_array_get_size(lean_object*);
@@ -287,7 +288,6 @@ lean_object* l_Array_anyRangeMAux___main___at___private_Lean_Meta_Tactic_Cases_5
 lean_object* l_Array_umapMAux___main___at___private_Lean_Meta_Tactic_Cases_8__unifyEqsAux___main___spec__10(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_MetavarContext_getDecl(lean_object*, lean_object*);
 lean_object* l_List_toArrayAux___main___rarg(lean_object*, lean_object*);
-extern lean_object* l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
 lean_object* l_unsafeCast(lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_iterateMAux___main___at_Lean_mkAppN___spec__1(lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Array_anyRangeMAux___main___at___private_Lean_Meta_Tactic_Cases_5__hasIndepIndices___spec__41___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
@@ -12697,7 +12697,7 @@ lean_object* _init_l___private_Lean_Meta_Tactic_Cases_8__unifyEqsAux___main___cl
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l___private_Lean_Meta_Tactic_Cases_8__unifyEqsAux___main___lambda__1___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;

stage0/stdlib/Lean/Meta/Tactic/Util.c

@@ -24,6 +24,7 @@ lean_object* l_Lean_Meta_getMVarTag(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_checkNotAssigned___closed__2;
 lean_object* l_Lean_Meta_Meta_hasOrelse___closed__1;
 lean_object* l_Lean_Meta_orelse(lean_object*);
+extern lean_object* l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 lean_object* l_Lean_MetavarContext_setMVarUserName(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_throwTacticEx___rarg___boxed(lean_object*, lean_object*, lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_checkNotAssigned___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -41,7 +42,6 @@ lean_object* l_Lean_Meta_Meta_hasOrelse(lean_object*);
 lean_object* l_Lean_Meta_getMVarDecl(lean_object*, lean_object*, lean_object*);
 lean_object* l___private_Lean_Meta_Tactic_Util_1__regTraceClasses___closed__2;
 lean_object* l_Lean_Meta_mkFreshExprSyntheticOpaqueMVar(lean_object*, lean_object*, lean_object*, lean_object*);
-extern lean_object* l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
 lean_object* l___private_Lean_Meta_Tactic_Util_1__regTraceClasses___closed__1;
 lean_object* l_Lean_Meta_getMVarTag___boxed(lean_object*, lean_object*, lean_object*);
 lean_object* l_Lean_Meta_setMVarTag(lean_object*, lean_object*, lean_object*, lean_object*);
@@ -458,7 +458,7 @@ lean_object* _init_l___private_Lean_Meta_Tactic_Util_1__regTraceClasses___closed
 _start:
 {
 lean_object* x_1; lean_object* x_2; lean_object* x_3; 
-x_1 = l___private_Lean_Meta_Basic_10__regTraceClasses___closed__2;
+x_1 = l___private_Lean_Meta_Basic_11__regTraceClasses___closed__2;
 x_2 = l___private_Lean_Meta_Tactic_Util_1__regTraceClasses___closed__1;
 x_3 = lean_name_mk_string(x_1, x_2);
 return x_3;

stage0/stdlib/Lean/MetavarContext.c

@@ -42785,12 +42785,11 @@ return x_4;
 lean_object* l_Lean_MetavarContext_levelMVarToParam(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4, lean_object* x_5) {
 _start:
 {
-lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; 
+lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; 
 x_6 = lean_alloc_ctor(0, 2, 0);
 lean_ctor_set(x_6, 0, x_4);
 lean_ctor_set(x_6, 1, x_2);
 x_7 = l_Array_empty___closed__1;
-lean_inc(x_1);
 x_8 = lean_alloc_ctor(0, 3, 0);
 lean_ctor_set(x_8, 0, x_1);
 lean_ctor_set(x_8, 1, x_7);
@@ -42801,17 +42800,19 @@ lean_inc(x_10);
 x_11 = lean_ctor_get(x_9, 0);
 lean_inc(x_11);
 lean_dec(x_9);
-x_12 = lean_ctor_get(x_10, 1);
+x_12 = lean_ctor_get(x_10, 0);
 lean_inc(x_12);
-x_13 = lean_ctor_get(x_10, 2);
+x_13 = lean_ctor_get(x_10, 1);
 lean_inc(x_13);
+x_14 = lean_ctor_get(x_10, 2);
+lean_inc(x_14);
 lean_dec(x_10);
-x_14 = lean_alloc_ctor(0, 4, 0);
-lean_ctor_set(x_14, 0, x_1);
-lean_ctor_set(x_14, 1, x_12);
-lean_ctor_set(x_14, 2, x_13);
-lean_ctor_set(x_14, 3, x_11);
-return x_14;
+x_15 = lean_alloc_ctor(0, 4, 0);
+lean_ctor_set(x_15, 0, x_12);
+lean_ctor_set(x_15, 1, x_13);
+lean_ctor_set(x_15, 2, x_14);
+lean_ctor_set(x_15, 3, x_11);
+return x_15;
 }
 }
 lean_object* initialize_Init(lean_object*);

stage0/stdlib/Lean/Util.c

@@ -1,6 +1,6 @@
 // Lean compiler output
 // Module: Lean.Util
-// Imports: Init Lean.Util.CollectFVars Lean.Util.CollectLevelParams Lean.Util.CollectMVars Lean.Util.FindMVar Lean.Util.MonadCache Lean.Util.PPExt Lean.Util.PPGoal Lean.Util.Path Lean.Util.Profile Lean.Util.RecDepth Lean.Util.Sorry Lean.Util.Trace Lean.Util.WHNF Lean.Util.FindExpr Lean.Util.ReplaceExpr Lean.Util.FoldConsts
+// Imports: Init Lean.Util.CollectFVars Lean.Util.CollectLevelParams Lean.Util.CollectMVars Lean.Util.FindMVar Lean.Util.MonadCache Lean.Util.PPExt Lean.Util.PPGoal Lean.Util.Path Lean.Util.Profile Lean.Util.RecDepth Lean.Util.Sorry Lean.Util.Trace Lean.Util.WHNF Lean.Util.FindExpr Lean.Util.ReplaceExpr Lean.Util.ReplaceLevel Lean.Util.FoldConsts Lean.Util.Constructions
 #include <lean/lean.h>
 #if defined(__clang__)
 #pragma clang diagnostic ignored "-Wunused-parameter"
@@ -29,7 +29,9 @@ lean_object* initialize_Lean_Util_Trace(lean_object*);
 lean_object* initialize_Lean_Util_WHNF(lean_object*);
 lean_object* initialize_Lean_Util_FindExpr(lean_object*);
 lean_object* initialize_Lean_Util_ReplaceExpr(lean_object*);
+lean_object* initialize_Lean_Util_ReplaceLevel(lean_object*);
 lean_object* initialize_Lean_Util_FoldConsts(lean_object*);
+lean_object* initialize_Lean_Util_Constructions(lean_object*);
 static bool _G_initialized = false;
 lean_object* initialize_Lean_Util(lean_object* w) {
 lean_object * res;
@@ -83,9 +85,15 @@ lean_dec_ref(res);
 res = initialize_Lean_Util_ReplaceExpr(lean_io_mk_world());
 if (lean_io_result_is_error(res)) return res;
 lean_dec_ref(res);
+res = initialize_Lean_Util_ReplaceLevel(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
 res = initialize_Lean_Util_FoldConsts(lean_io_mk_world());
 if (lean_io_result_is_error(res)) return res;
 lean_dec_ref(res);
+res = initialize_Lean_Util_Constructions(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
 return lean_mk_io_result(lean_box(0));
 }
 #ifdef __cplusplus

stage0/stdlib/Lean/Util/Constructions.c

@@ -0,0 +1,110 @@
+// Lean compiler output
+// Module: Lean.Util.Constructions
+// Imports: Init Lean.Environment
+#include <lean/lean.h>
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#pragma clang diagnostic ignored "-Wunused-label"
+#elif defined(__GNUC__) && !defined(__CLANG__)
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#pragma GCC diagnostic ignored "-Wunused-label"
+#pragma GCC diagnostic ignored "-Wunused-but-set-variable"
+#endif
+#ifdef __cplusplus
+extern "C" {
+#endif
+lean_object* lean_mk_cases_on(lean_object*, lean_object*);
+lean_object* l_Lean_mkRecOn___boxed(lean_object*, lean_object*);
+lean_object* lean_mk_ibelow(lean_object*, lean_object*);
+lean_object* lean_mk_below(lean_object*, lean_object*);
+lean_object* lean_mk_brec_on(lean_object*, lean_object*);
+lean_object* l_Lean_mkNoConfusion___boxed(lean_object*, lean_object*);
+lean_object* lean_mk_no_confusion(lean_object*, lean_object*);
+lean_object* l_Lean_mkIBelow___boxed(lean_object*, lean_object*);
+lean_object* lean_mk_binduction_on(lean_object*, lean_object*);
+lean_object* l_Lean_mkBelow___boxed(lean_object*, lean_object*);
+lean_object* l_Lean_mkCasesOn___boxed(lean_object*, lean_object*);
+lean_object* l_Lean_mkBInductionOn___boxed(lean_object*, lean_object*);
+lean_object* lean_mk_rec_on(lean_object*, lean_object*);
+lean_object* l_Lean_mkBRecOn___boxed(lean_object*, lean_object*);
+lean_object* l_Lean_mkCasesOn___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_cases_on(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkRecOn___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_rec_on(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkNoConfusion___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_no_confusion(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkBelow___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_below(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkIBelow___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_ibelow(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkBRecOn___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_brec_on(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_mkBInductionOn___boxed(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = lean_mk_binduction_on(x_1, x_2);
+lean_dec(x_2);
+return x_3;
+}
+}
+lean_object* initialize_Init(lean_object*);
+lean_object* initialize_Lean_Environment(lean_object*);
+static bool _G_initialized = false;
+lean_object* initialize_Lean_Util_Constructions(lean_object* w) {
+lean_object * res;
+if (_G_initialized) return lean_mk_io_result(lean_box(0));
+_G_initialized = true;
+res = initialize_Init(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+res = initialize_Lean_Environment(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+return lean_mk_io_result(lean_box(0));
+}
+#ifdef __cplusplus
+}
+#endif

stage0/stdlib/Lean/Util/ReplaceLevel.c

@@ -0,0 +1,959 @@
+// Lean compiler output
+// Module: Lean.Util.ReplaceLevel
+// Imports: Init Lean.Expr
+#include <lean/lean.h>
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#pragma clang diagnostic ignored "-Wunused-label"
+#elif defined(__GNUC__) && !defined(__CLANG__)
+#pragma GCC diagnostic ignored "-Wunused-parameter"
+#pragma GCC diagnostic ignored "-Wunused-label"
+#pragma GCC diagnostic ignored "-Wunused-but-set-variable"
+#endif
+#ifdef __cplusplus
+extern "C" {
+#endif
+lean_object* lean_expr_update_forall(lean_object*, uint8_t, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(lean_object*, size_t, lean_object*, lean_object*);
+lean_object* l_unreachable_x21___rarg(lean_object*);
+uint8_t l_USize_decEq(size_t, size_t);
+lean_object* lean_array_uget(lean_object*, size_t);
+lean_object* lean_expr_update_mdata(lean_object*, lean_object*);
+lean_object* lean_array_uset(lean_object*, size_t, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3;
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_cache(size_t, lean_object*, lean_object*, lean_object*);
+lean_object* l_List_map___main___rarg(lean_object*, lean_object*);
+size_t l_Lean_Expr_ReplaceLevelImpl_cacheSize;
+extern lean_object* l_Id_monad;
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1;
+lean_object* l_Lean_mkLevelIMax(lean_object*, lean_object*);
+extern lean_object* l_Lean_Expr_Inhabited___closed__1;
+lean_object* l_Lean_mkLevelMax(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafe(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1;
+lean_object* l_Lean_Expr_replaceLevel___main(lean_object*, lean_object*);
+lean_object* lean_expr_update_let(lean_object*, lean_object*, lean_object*, lean_object*);
+uint8_t l_Lean_Expr_Data_binderInfo(uint64_t);
+lean_object* lean_expr_update_proj(lean_object*, lean_object*);
+lean_object* l_Lean_Level_replace(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_cache___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
+size_t l_USize_mod(size_t, size_t);
+size_t lean_ptr_addr(lean_object*);
+lean_object* l_Lean_Expr_replaceLevel(lean_object*, lean_object*);
+lean_object* l_Lean_mkLevelSucc(lean_object*);
+lean_object* lean_expr_update_sort(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM(lean_object*, size_t, lean_object*, lean_object*);
+lean_object* l_StateT_Monad___rarg(lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_initCache;
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___boxed(lean_object*, lean_object*, lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2;
+lean_object* lean_expr_update_lambda(lean_object*, uint8_t, lean_object*, lean_object*);
+lean_object* l_List_map___main___at_Lean_Expr_replaceLevel___main___spec__1(lean_object*, lean_object*);
+extern lean_object* l_Lean_Expr_Inhabited;
+lean_object* lean_mk_array(lean_object*, lean_object*);
+lean_object* l_Lean_Level_replace___main(lean_object*, lean_object*);
+lean_object* l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2;
+lean_object* lean_expr_update_app(lean_object*, lean_object*, lean_object*);
+lean_object* lean_expr_update_const(lean_object*, lean_object*);
+lean_object* l_monadInhabited___rarg(lean_object*, lean_object*);
+lean_object* l_Lean_Level_replace___main(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+lean_inc(x_1);
+lean_inc(x_2);
+x_3 = lean_apply_1(x_1, x_2);
+if (lean_obj_tag(x_3) == 0)
+{
+switch (lean_obj_tag(x_2)) {
+case 1:
+{
+lean_object* x_4; lean_object* x_5; lean_object* x_6; 
+x_4 = lean_ctor_get(x_2, 0);
+lean_inc(x_4);
+lean_dec(x_2);
+x_5 = l_Lean_Level_replace___main(x_1, x_4);
+x_6 = l_Lean_mkLevelSucc(x_5);
+return x_6;
+}
+case 2:
+{
+lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; lean_object* x_11; 
+x_7 = lean_ctor_get(x_2, 0);
+lean_inc(x_7);
+x_8 = lean_ctor_get(x_2, 1);
+lean_inc(x_8);
+lean_dec(x_2);
+lean_inc(x_1);
+x_9 = l_Lean_Level_replace___main(x_1, x_7);
+x_10 = l_Lean_Level_replace___main(x_1, x_8);
+x_11 = l_Lean_mkLevelMax(x_9, x_10);
+return x_11;
+}
+case 3:
+{
+lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; lean_object* x_16; 
+x_12 = lean_ctor_get(x_2, 0);
+lean_inc(x_12);
+x_13 = lean_ctor_get(x_2, 1);
+lean_inc(x_13);
+lean_dec(x_2);
+lean_inc(x_1);
+x_14 = l_Lean_Level_replace___main(x_1, x_12);
+x_15 = l_Lean_Level_replace___main(x_1, x_13);
+x_16 = l_Lean_mkLevelIMax(x_14, x_15);
+return x_16;
+}
+default: 
+{
+lean_dec(x_1);
+return x_2;
+}
+}
+}
+else
+{
+lean_object* x_17; 
+lean_dec(x_2);
+lean_dec(x_1);
+x_17 = lean_ctor_get(x_3, 0);
+lean_inc(x_17);
+lean_dec(x_3);
+return x_17;
+}
+}
+}
+lean_object* l_Lean_Level_replace(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = l_Lean_Level_replace___main(x_1, x_2);
+return x_3;
+}
+}
+size_t _init_l_Lean_Expr_ReplaceLevelImpl_cacheSize() {
+_start:
+{
+size_t x_1; 
+x_1 = 8192;
+return x_1;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_cache(size_t x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; lean_object* x_9; lean_object* x_10; 
+x_5 = lean_ctor_get(x_4, 0);
+lean_inc(x_5);
+x_6 = lean_array_uset(x_5, x_1, x_2);
+x_7 = lean_ctor_get(x_4, 1);
+lean_inc(x_7);
+lean_dec(x_4);
+lean_inc(x_3);
+x_8 = lean_array_uset(x_7, x_1, x_3);
+x_9 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_9, 0, x_6);
+lean_ctor_set(x_9, 1, x_8);
+x_10 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_10, 0, x_3);
+lean_ctor_set(x_10, 1, x_9);
+return x_10;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_cache___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+size_t x_5; lean_object* x_6; 
+x_5 = lean_unbox_usize(x_1);
+lean_dec(x_1);
+x_6 = l_Lean_Expr_ReplaceLevelImpl_cache(x_5, x_2, x_3, x_4);
+return x_6;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; 
+x_1 = l_Id_monad;
+x_2 = l_StateT_Monad___rarg(x_1);
+return x_2;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; 
+x_1 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1;
+x_2 = l_Lean_Expr_Inhabited;
+x_3 = l_monadInhabited___rarg(x_1, x_2);
+return x_3;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(lean_object* x_1, size_t x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+size_t x_5; size_t x_6; lean_object* x_7; lean_object* x_8; size_t x_9; uint8_t x_10; 
+x_5 = lean_ptr_addr(x_3);
+x_6 = x_2 == 0 ? 0 : x_5 % x_2;
+x_7 = lean_ctor_get(x_4, 0);
+lean_inc(x_7);
+x_8 = lean_array_uget(x_7, x_6);
+x_9 = lean_ptr_addr(x_8);
+lean_dec(x_8);
+x_10 = x_9 == x_5;
+if (x_10 == 0)
+{
+switch (lean_obj_tag(x_3)) {
+case 3:
+{
+lean_object* x_11; lean_object* x_12; lean_object* x_13; lean_object* x_14; lean_object* x_15; lean_object* x_16; lean_object* x_17; lean_object* x_18; 
+x_11 = lean_ctor_get(x_3, 0);
+lean_inc(x_11);
+x_12 = l_Lean_Level_replace___main(x_1, x_11);
+lean_inc(x_3);
+x_13 = lean_expr_update_sort(x_3, x_12);
+x_14 = lean_array_uset(x_7, x_6, x_3);
+x_15 = lean_ctor_get(x_4, 1);
+lean_inc(x_15);
+lean_dec(x_4);
+lean_inc(x_13);
+x_16 = lean_array_uset(x_15, x_6, x_13);
+x_17 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_17, 0, x_14);
+lean_ctor_set(x_17, 1, x_16);
+x_18 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_18, 0, x_13);
+lean_ctor_set(x_18, 1, x_17);
+return x_18;
+}
+case 4:
+{
+lean_object* x_19; lean_object* x_20; lean_object* x_21; lean_object* x_22; lean_object* x_23; lean_object* x_24; lean_object* x_25; lean_object* x_26; lean_object* x_27; 
+x_19 = lean_ctor_get(x_3, 1);
+lean_inc(x_19);
+x_20 = lean_alloc_closure((void*)(l_Lean_Level_replace), 2, 1);
+lean_closure_set(x_20, 0, x_1);
+x_21 = l_List_map___main___rarg(x_20, x_19);
+lean_inc(x_3);
+x_22 = lean_expr_update_const(x_3, x_21);
+x_23 = lean_array_uset(x_7, x_6, x_3);
+x_24 = lean_ctor_get(x_4, 1);
+lean_inc(x_24);
+lean_dec(x_4);
+lean_inc(x_22);
+x_25 = lean_array_uset(x_24, x_6, x_22);
+x_26 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_26, 0, x_23);
+lean_ctor_set(x_26, 1, x_25);
+x_27 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_27, 0, x_22);
+lean_ctor_set(x_27, 1, x_26);
+return x_27;
+}
+case 5:
+{
+lean_object* x_28; lean_object* x_29; lean_object* x_30; lean_object* x_31; lean_object* x_32; lean_object* x_33; uint8_t x_34; 
+lean_dec(x_7);
+x_28 = lean_ctor_get(x_3, 0);
+lean_inc(x_28);
+x_29 = lean_ctor_get(x_3, 1);
+lean_inc(x_29);
+lean_inc(x_1);
+x_30 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_28, x_4);
+x_31 = lean_ctor_get(x_30, 0);
+lean_inc(x_31);
+x_32 = lean_ctor_get(x_30, 1);
+lean_inc(x_32);
+lean_dec(x_30);
+x_33 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_29, x_32);
+x_34 = !lean_is_exclusive(x_33);
+if (x_34 == 0)
+{
+lean_object* x_35; lean_object* x_36; lean_object* x_37; lean_object* x_38; lean_object* x_39; lean_object* x_40; lean_object* x_41; lean_object* x_42; 
+x_35 = lean_ctor_get(x_33, 0);
+x_36 = lean_ctor_get(x_33, 1);
+x_37 = lean_ctor_get(x_36, 0);
+lean_inc(x_37);
+lean_inc(x_3);
+x_38 = lean_array_uset(x_37, x_6, x_3);
+x_39 = lean_ctor_get(x_36, 1);
+lean_inc(x_39);
+lean_dec(x_36);
+x_40 = lean_expr_update_app(x_3, x_31, x_35);
+lean_inc(x_40);
+x_41 = lean_array_uset(x_39, x_6, x_40);
+x_42 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_42, 0, x_38);
+lean_ctor_set(x_42, 1, x_41);
+lean_ctor_set(x_33, 1, x_42);
+lean_ctor_set(x_33, 0, x_40);
+return x_33;
+}
+else
+{
+lean_object* x_43; lean_object* x_44; lean_object* x_45; lean_object* x_46; lean_object* x_47; lean_object* x_48; lean_object* x_49; lean_object* x_50; lean_object* x_51; 
+x_43 = lean_ctor_get(x_33, 0);
+x_44 = lean_ctor_get(x_33, 1);
+lean_inc(x_44);
+lean_inc(x_43);
+lean_dec(x_33);
+x_45 = lean_ctor_get(x_44, 0);
+lean_inc(x_45);
+lean_inc(x_3);
+x_46 = lean_array_uset(x_45, x_6, x_3);
+x_47 = lean_ctor_get(x_44, 1);
+lean_inc(x_47);
+lean_dec(x_44);
+x_48 = lean_expr_update_app(x_3, x_31, x_43);
+lean_inc(x_48);
+x_49 = lean_array_uset(x_47, x_6, x_48);
+x_50 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_50, 0, x_46);
+lean_ctor_set(x_50, 1, x_49);
+x_51 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_51, 0, x_48);
+lean_ctor_set(x_51, 1, x_50);
+return x_51;
+}
+}
+case 6:
+{
+lean_object* x_52; lean_object* x_53; uint64_t x_54; lean_object* x_55; lean_object* x_56; lean_object* x_57; lean_object* x_58; uint8_t x_59; 
+lean_dec(x_7);
+x_52 = lean_ctor_get(x_3, 1);
+lean_inc(x_52);
+x_53 = lean_ctor_get(x_3, 2);
+lean_inc(x_53);
+x_54 = lean_ctor_get_uint64(x_3, sizeof(void*)*3);
+lean_inc(x_1);
+x_55 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_52, x_4);
+x_56 = lean_ctor_get(x_55, 0);
+lean_inc(x_56);
+x_57 = lean_ctor_get(x_55, 1);
+lean_inc(x_57);
+lean_dec(x_55);
+x_58 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_53, x_57);
+x_59 = !lean_is_exclusive(x_58);
+if (x_59 == 0)
+{
+lean_object* x_60; lean_object* x_61; lean_object* x_62; lean_object* x_63; lean_object* x_64; uint8_t x_65; lean_object* x_66; lean_object* x_67; lean_object* x_68; 
+x_60 = lean_ctor_get(x_58, 0);
+x_61 = lean_ctor_get(x_58, 1);
+x_62 = lean_ctor_get(x_61, 0);
+lean_inc(x_62);
+lean_inc(x_3);
+x_63 = lean_array_uset(x_62, x_6, x_3);
+x_64 = lean_ctor_get(x_61, 1);
+lean_inc(x_64);
+lean_dec(x_61);
+x_65 = (uint8_t)((x_54 << 24) >> 61);
+x_66 = lean_expr_update_lambda(x_3, x_65, x_56, x_60);
+lean_inc(x_66);
+x_67 = lean_array_uset(x_64, x_6, x_66);
+x_68 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_68, 0, x_63);
+lean_ctor_set(x_68, 1, x_67);
+lean_ctor_set(x_58, 1, x_68);
+lean_ctor_set(x_58, 0, x_66);
+return x_58;
+}
+else
+{
+lean_object* x_69; lean_object* x_70; lean_object* x_71; lean_object* x_72; lean_object* x_73; uint8_t x_74; lean_object* x_75; lean_object* x_76; lean_object* x_77; lean_object* x_78; 
+x_69 = lean_ctor_get(x_58, 0);
+x_70 = lean_ctor_get(x_58, 1);
+lean_inc(x_70);
+lean_inc(x_69);
+lean_dec(x_58);
+x_71 = lean_ctor_get(x_70, 0);
+lean_inc(x_71);
+lean_inc(x_3);
+x_72 = lean_array_uset(x_71, x_6, x_3);
+x_73 = lean_ctor_get(x_70, 1);
+lean_inc(x_73);
+lean_dec(x_70);
+x_74 = (uint8_t)((x_54 << 24) >> 61);
+x_75 = lean_expr_update_lambda(x_3, x_74, x_56, x_69);
+lean_inc(x_75);
+x_76 = lean_array_uset(x_73, x_6, x_75);
+x_77 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_77, 0, x_72);
+lean_ctor_set(x_77, 1, x_76);
+x_78 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_78, 0, x_75);
+lean_ctor_set(x_78, 1, x_77);
+return x_78;
+}
+}
+case 7:
+{
+lean_object* x_79; lean_object* x_80; uint64_t x_81; lean_object* x_82; lean_object* x_83; lean_object* x_84; lean_object* x_85; uint8_t x_86; 
+lean_dec(x_7);
+x_79 = lean_ctor_get(x_3, 1);
+lean_inc(x_79);
+x_80 = lean_ctor_get(x_3, 2);
+lean_inc(x_80);
+x_81 = lean_ctor_get_uint64(x_3, sizeof(void*)*3);
+lean_inc(x_1);
+x_82 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_79, x_4);
+x_83 = lean_ctor_get(x_82, 0);
+lean_inc(x_83);
+x_84 = lean_ctor_get(x_82, 1);
+lean_inc(x_84);
+lean_dec(x_82);
+x_85 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_80, x_84);
+x_86 = !lean_is_exclusive(x_85);
+if (x_86 == 0)
+{
+lean_object* x_87; lean_object* x_88; lean_object* x_89; lean_object* x_90; lean_object* x_91; uint8_t x_92; lean_object* x_93; lean_object* x_94; lean_object* x_95; 
+x_87 = lean_ctor_get(x_85, 0);
+x_88 = lean_ctor_get(x_85, 1);
+x_89 = lean_ctor_get(x_88, 0);
+lean_inc(x_89);
+lean_inc(x_3);
+x_90 = lean_array_uset(x_89, x_6, x_3);
+x_91 = lean_ctor_get(x_88, 1);
+lean_inc(x_91);
+lean_dec(x_88);
+x_92 = (uint8_t)((x_81 << 24) >> 61);
+x_93 = lean_expr_update_forall(x_3, x_92, x_83, x_87);
+lean_inc(x_93);
+x_94 = lean_array_uset(x_91, x_6, x_93);
+x_95 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_95, 0, x_90);
+lean_ctor_set(x_95, 1, x_94);
+lean_ctor_set(x_85, 1, x_95);
+lean_ctor_set(x_85, 0, x_93);
+return x_85;
+}
+else
+{
+lean_object* x_96; lean_object* x_97; lean_object* x_98; lean_object* x_99; lean_object* x_100; uint8_t x_101; lean_object* x_102; lean_object* x_103; lean_object* x_104; lean_object* x_105; 
+x_96 = lean_ctor_get(x_85, 0);
+x_97 = lean_ctor_get(x_85, 1);
+lean_inc(x_97);
+lean_inc(x_96);
+lean_dec(x_85);
+x_98 = lean_ctor_get(x_97, 0);
+lean_inc(x_98);
+lean_inc(x_3);
+x_99 = lean_array_uset(x_98, x_6, x_3);
+x_100 = lean_ctor_get(x_97, 1);
+lean_inc(x_100);
+lean_dec(x_97);
+x_101 = (uint8_t)((x_81 << 24) >> 61);
+x_102 = lean_expr_update_forall(x_3, x_101, x_83, x_96);
+lean_inc(x_102);
+x_103 = lean_array_uset(x_100, x_6, x_102);
+x_104 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_104, 0, x_99);
+lean_ctor_set(x_104, 1, x_103);
+x_105 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_105, 0, x_102);
+lean_ctor_set(x_105, 1, x_104);
+return x_105;
+}
+}
+case 8:
+{
+lean_object* x_106; lean_object* x_107; lean_object* x_108; lean_object* x_109; lean_object* x_110; lean_object* x_111; lean_object* x_112; lean_object* x_113; lean_object* x_114; lean_object* x_115; uint8_t x_116; 
+lean_dec(x_7);
+x_106 = lean_ctor_get(x_3, 1);
+lean_inc(x_106);
+x_107 = lean_ctor_get(x_3, 2);
+lean_inc(x_107);
+x_108 = lean_ctor_get(x_3, 3);
+lean_inc(x_108);
+lean_inc(x_1);
+x_109 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_106, x_4);
+x_110 = lean_ctor_get(x_109, 0);
+lean_inc(x_110);
+x_111 = lean_ctor_get(x_109, 1);
+lean_inc(x_111);
+lean_dec(x_109);
+lean_inc(x_1);
+x_112 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_107, x_111);
+x_113 = lean_ctor_get(x_112, 0);
+lean_inc(x_113);
+x_114 = lean_ctor_get(x_112, 1);
+lean_inc(x_114);
+lean_dec(x_112);
+x_115 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_108, x_114);
+x_116 = !lean_is_exclusive(x_115);
+if (x_116 == 0)
+{
+lean_object* x_117; lean_object* x_118; lean_object* x_119; lean_object* x_120; lean_object* x_121; lean_object* x_122; lean_object* x_123; lean_object* x_124; 
+x_117 = lean_ctor_get(x_115, 0);
+x_118 = lean_ctor_get(x_115, 1);
+x_119 = lean_ctor_get(x_118, 0);
+lean_inc(x_119);
+lean_inc(x_3);
+x_120 = lean_array_uset(x_119, x_6, x_3);
+x_121 = lean_ctor_get(x_118, 1);
+lean_inc(x_121);
+lean_dec(x_118);
+x_122 = lean_expr_update_let(x_3, x_110, x_113, x_117);
+lean_inc(x_122);
+x_123 = lean_array_uset(x_121, x_6, x_122);
+x_124 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_124, 0, x_120);
+lean_ctor_set(x_124, 1, x_123);
+lean_ctor_set(x_115, 1, x_124);
+lean_ctor_set(x_115, 0, x_122);
+return x_115;
+}
+else
+{
+lean_object* x_125; lean_object* x_126; lean_object* x_127; lean_object* x_128; lean_object* x_129; lean_object* x_130; lean_object* x_131; lean_object* x_132; lean_object* x_133; 
+x_125 = lean_ctor_get(x_115, 0);
+x_126 = lean_ctor_get(x_115, 1);
+lean_inc(x_126);
+lean_inc(x_125);
+lean_dec(x_115);
+x_127 = lean_ctor_get(x_126, 0);
+lean_inc(x_127);
+lean_inc(x_3);
+x_128 = lean_array_uset(x_127, x_6, x_3);
+x_129 = lean_ctor_get(x_126, 1);
+lean_inc(x_129);
+lean_dec(x_126);
+x_130 = lean_expr_update_let(x_3, x_110, x_113, x_125);
+lean_inc(x_130);
+x_131 = lean_array_uset(x_129, x_6, x_130);
+x_132 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_132, 0, x_128);
+lean_ctor_set(x_132, 1, x_131);
+x_133 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_133, 0, x_130);
+lean_ctor_set(x_133, 1, x_132);
+return x_133;
+}
+}
+case 10:
+{
+lean_object* x_134; lean_object* x_135; uint8_t x_136; 
+lean_dec(x_7);
+x_134 = lean_ctor_get(x_3, 1);
+lean_inc(x_134);
+x_135 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_134, x_4);
+x_136 = !lean_is_exclusive(x_135);
+if (x_136 == 0)
+{
+lean_object* x_137; lean_object* x_138; lean_object* x_139; lean_object* x_140; lean_object* x_141; lean_object* x_142; lean_object* x_143; lean_object* x_144; 
+x_137 = lean_ctor_get(x_135, 0);
+x_138 = lean_ctor_get(x_135, 1);
+x_139 = lean_ctor_get(x_138, 0);
+lean_inc(x_139);
+lean_inc(x_3);
+x_140 = lean_array_uset(x_139, x_6, x_3);
+x_141 = lean_ctor_get(x_138, 1);
+lean_inc(x_141);
+lean_dec(x_138);
+x_142 = lean_expr_update_mdata(x_3, x_137);
+lean_inc(x_142);
+x_143 = lean_array_uset(x_141, x_6, x_142);
+x_144 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_144, 0, x_140);
+lean_ctor_set(x_144, 1, x_143);
+lean_ctor_set(x_135, 1, x_144);
+lean_ctor_set(x_135, 0, x_142);
+return x_135;
+}
+else
+{
+lean_object* x_145; lean_object* x_146; lean_object* x_147; lean_object* x_148; lean_object* x_149; lean_object* x_150; lean_object* x_151; lean_object* x_152; lean_object* x_153; 
+x_145 = lean_ctor_get(x_135, 0);
+x_146 = lean_ctor_get(x_135, 1);
+lean_inc(x_146);
+lean_inc(x_145);
+lean_dec(x_135);
+x_147 = lean_ctor_get(x_146, 0);
+lean_inc(x_147);
+lean_inc(x_3);
+x_148 = lean_array_uset(x_147, x_6, x_3);
+x_149 = lean_ctor_get(x_146, 1);
+lean_inc(x_149);
+lean_dec(x_146);
+x_150 = lean_expr_update_mdata(x_3, x_145);
+lean_inc(x_150);
+x_151 = lean_array_uset(x_149, x_6, x_150);
+x_152 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_152, 0, x_148);
+lean_ctor_set(x_152, 1, x_151);
+x_153 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_153, 0, x_150);
+lean_ctor_set(x_153, 1, x_152);
+return x_153;
+}
+}
+case 11:
+{
+lean_object* x_154; lean_object* x_155; uint8_t x_156; 
+lean_dec(x_7);
+x_154 = lean_ctor_get(x_3, 2);
+lean_inc(x_154);
+x_155 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_154, x_4);
+x_156 = !lean_is_exclusive(x_155);
+if (x_156 == 0)
+{
+lean_object* x_157; lean_object* x_158; lean_object* x_159; lean_object* x_160; lean_object* x_161; lean_object* x_162; lean_object* x_163; lean_object* x_164; 
+x_157 = lean_ctor_get(x_155, 0);
+x_158 = lean_ctor_get(x_155, 1);
+x_159 = lean_ctor_get(x_158, 0);
+lean_inc(x_159);
+lean_inc(x_3);
+x_160 = lean_array_uset(x_159, x_6, x_3);
+x_161 = lean_ctor_get(x_158, 1);
+lean_inc(x_161);
+lean_dec(x_158);
+x_162 = lean_expr_update_proj(x_3, x_157);
+lean_inc(x_162);
+x_163 = lean_array_uset(x_161, x_6, x_162);
+x_164 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_164, 0, x_160);
+lean_ctor_set(x_164, 1, x_163);
+lean_ctor_set(x_155, 1, x_164);
+lean_ctor_set(x_155, 0, x_162);
+return x_155;
+}
+else
+{
+lean_object* x_165; lean_object* x_166; lean_object* x_167; lean_object* x_168; lean_object* x_169; lean_object* x_170; lean_object* x_171; lean_object* x_172; lean_object* x_173; 
+x_165 = lean_ctor_get(x_155, 0);
+x_166 = lean_ctor_get(x_155, 1);
+lean_inc(x_166);
+lean_inc(x_165);
+lean_dec(x_155);
+x_167 = lean_ctor_get(x_166, 0);
+lean_inc(x_167);
+lean_inc(x_3);
+x_168 = lean_array_uset(x_167, x_6, x_3);
+x_169 = lean_ctor_get(x_166, 1);
+lean_inc(x_169);
+lean_dec(x_166);
+x_170 = lean_expr_update_proj(x_3, x_165);
+lean_inc(x_170);
+x_171 = lean_array_uset(x_169, x_6, x_170);
+x_172 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_172, 0, x_168);
+lean_ctor_set(x_172, 1, x_171);
+x_173 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_173, 0, x_170);
+lean_ctor_set(x_173, 1, x_172);
+return x_173;
+}
+}
+case 12:
+{
+lean_object* x_174; lean_object* x_175; lean_object* x_176; 
+lean_dec(x_7);
+lean_dec(x_3);
+lean_dec(x_1);
+x_174 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2;
+x_175 = l_unreachable_x21___rarg(x_174);
+x_176 = lean_apply_1(x_175, x_4);
+return x_176;
+}
+default: 
+{
+lean_object* x_177; 
+lean_dec(x_7);
+lean_dec(x_1);
+x_177 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_177, 0, x_3);
+lean_ctor_set(x_177, 1, x_4);
+return x_177;
+}
+}
+}
+else
+{
+lean_object* x_178; lean_object* x_179; lean_object* x_180; 
+lean_dec(x_7);
+lean_dec(x_3);
+lean_dec(x_1);
+x_178 = lean_ctor_get(x_4, 1);
+lean_inc(x_178);
+x_179 = lean_array_uget(x_178, x_6);
+lean_dec(x_178);
+x_180 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_180, 0, x_179);
+lean_ctor_set(x_180, 1, x_4);
+return x_180;
+}
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+size_t x_5; lean_object* x_6; 
+x_5 = lean_unbox_usize(x_2);
+lean_dec(x_2);
+x_6 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_5, x_3, x_4);
+return x_6;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM(lean_object* x_1, size_t x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+lean_object* x_5; 
+x_5 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_2, x_3, x_4);
+return x_5;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___boxed(lean_object* x_1, lean_object* x_2, lean_object* x_3, lean_object* x_4) {
+_start:
+{
+size_t x_5; lean_object* x_6; 
+x_5 = lean_unbox_usize(x_2);
+lean_dec(x_2);
+x_6 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM(x_1, x_5, x_3, x_4);
+return x_6;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; 
+x_1 = lean_unsigned_to_nat(8192u);
+x_2 = lean_box(0);
+x_3 = lean_mk_array(x_1, x_2);
+return x_3;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; 
+x_1 = lean_unsigned_to_nat(8192u);
+x_2 = l_Lean_Expr_Inhabited___closed__1;
+x_3 = lean_mk_array(x_1, x_2);
+return x_3;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3() {
+_start:
+{
+lean_object* x_1; lean_object* x_2; lean_object* x_3; 
+x_1 = l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1;
+x_2 = l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2;
+x_3 = lean_alloc_ctor(0, 2, 0);
+lean_ctor_set(x_3, 0, x_1);
+lean_ctor_set(x_3, 1, x_2);
+return x_3;
+}
+}
+lean_object* _init_l_Lean_Expr_ReplaceLevelImpl_initCache() {
+_start:
+{
+lean_object* x_1; 
+x_1 = l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3;
+return x_1;
+}
+}
+lean_object* l_Lean_Expr_ReplaceLevelImpl_replaceUnsafe(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+size_t x_3; lean_object* x_4; lean_object* x_5; lean_object* x_6; 
+x_3 = 8192;
+x_4 = l_Lean_Expr_ReplaceLevelImpl_initCache;
+x_5 = l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main(x_1, x_3, x_2, x_4);
+x_6 = lean_ctor_get(x_5, 0);
+lean_inc(x_6);
+lean_dec(x_5);
+return x_6;
+}
+}
+lean_object* l_List_map___main___at_Lean_Expr_replaceLevel___main___spec__1(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+if (lean_obj_tag(x_2) == 0)
+{
+lean_object* x_3; 
+lean_dec(x_1);
+x_3 = lean_box(0);
+return x_3;
+}
+else
+{
+uint8_t x_4; 
+x_4 = !lean_is_exclusive(x_2);
+if (x_4 == 0)
+{
+lean_object* x_5; lean_object* x_6; lean_object* x_7; lean_object* x_8; 
+x_5 = lean_ctor_get(x_2, 0);
+x_6 = lean_ctor_get(x_2, 1);
+lean_inc(x_1);
+x_7 = l_Lean_Level_replace___main(x_1, x_5);
+x_8 = l_List_map___main___at_Lean_Expr_replaceLevel___main___spec__1(x_1, x_6);
+lean_ctor_set(x_2, 1, x_8);
+lean_ctor_set(x_2, 0, x_7);
+return x_2;
+}
+else
+{
+lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; 
+x_9 = lean_ctor_get(x_2, 0);
+x_10 = lean_ctor_get(x_2, 1);
+lean_inc(x_10);
+lean_inc(x_9);
+lean_dec(x_2);
+lean_inc(x_1);
+x_11 = l_Lean_Level_replace___main(x_1, x_9);
+x_12 = l_List_map___main___at_Lean_Expr_replaceLevel___main___spec__1(x_1, x_10);
+x_13 = lean_alloc_ctor(1, 2, 0);
+lean_ctor_set(x_13, 0, x_11);
+lean_ctor_set(x_13, 1, x_12);
+return x_13;
+}
+}
+}
+}
+lean_object* l_Lean_Expr_replaceLevel___main(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+switch (lean_obj_tag(x_2)) {
+case 3:
+{
+lean_object* x_3; lean_object* x_4; lean_object* x_5; 
+x_3 = lean_ctor_get(x_2, 0);
+lean_inc(x_3);
+x_4 = l_Lean_Level_replace___main(x_1, x_3);
+x_5 = lean_expr_update_sort(x_2, x_4);
+return x_5;
+}
+case 4:
+{
+lean_object* x_6; lean_object* x_7; lean_object* x_8; 
+x_6 = lean_ctor_get(x_2, 1);
+lean_inc(x_6);
+x_7 = l_List_map___main___at_Lean_Expr_replaceLevel___main___spec__1(x_1, x_6);
+x_8 = lean_expr_update_const(x_2, x_7);
+return x_8;
+}
+case 5:
+{
+lean_object* x_9; lean_object* x_10; lean_object* x_11; lean_object* x_12; lean_object* x_13; 
+x_9 = lean_ctor_get(x_2, 0);
+lean_inc(x_9);
+x_10 = lean_ctor_get(x_2, 1);
+lean_inc(x_10);
+lean_inc(x_1);
+x_11 = l_Lean_Expr_replaceLevel___main(x_1, x_9);
+x_12 = l_Lean_Expr_replaceLevel___main(x_1, x_10);
+x_13 = lean_expr_update_app(x_2, x_11, x_12);
+return x_13;
+}
+case 6:
+{
+lean_object* x_14; lean_object* x_15; uint64_t x_16; lean_object* x_17; lean_object* x_18; uint8_t x_19; lean_object* x_20; 
+x_14 = lean_ctor_get(x_2, 1);
+lean_inc(x_14);
+x_15 = lean_ctor_get(x_2, 2);
+lean_inc(x_15);
+x_16 = lean_ctor_get_uint64(x_2, sizeof(void*)*3);
+lean_inc(x_1);
+x_17 = l_Lean_Expr_replaceLevel___main(x_1, x_14);
+x_18 = l_Lean_Expr_replaceLevel___main(x_1, x_15);
+x_19 = (uint8_t)((x_16 << 24) >> 61);
+x_20 = lean_expr_update_lambda(x_2, x_19, x_17, x_18);
+return x_20;
+}
+case 7:
+{
+lean_object* x_21; lean_object* x_22; uint64_t x_23; lean_object* x_24; lean_object* x_25; uint8_t x_26; lean_object* x_27; 
+x_21 = lean_ctor_get(x_2, 1);
+lean_inc(x_21);
+x_22 = lean_ctor_get(x_2, 2);
+lean_inc(x_22);
+x_23 = lean_ctor_get_uint64(x_2, sizeof(void*)*3);
+lean_inc(x_1);
+x_24 = l_Lean_Expr_replaceLevel___main(x_1, x_21);
+x_25 = l_Lean_Expr_replaceLevel___main(x_1, x_22);
+x_26 = (uint8_t)((x_23 << 24) >> 61);
+x_27 = lean_expr_update_forall(x_2, x_26, x_24, x_25);
+return x_27;
+}
+case 8:
+{
+lean_object* x_28; lean_object* x_29; lean_object* x_30; lean_object* x_31; lean_object* x_32; lean_object* x_33; lean_object* x_34; 
+x_28 = lean_ctor_get(x_2, 1);
+lean_inc(x_28);
+x_29 = lean_ctor_get(x_2, 2);
+lean_inc(x_29);
+x_30 = lean_ctor_get(x_2, 3);
+lean_inc(x_30);
+lean_inc(x_1);
+x_31 = l_Lean_Expr_replaceLevel___main(x_1, x_28);
+lean_inc(x_1);
+x_32 = l_Lean_Expr_replaceLevel___main(x_1, x_29);
+x_33 = l_Lean_Expr_replaceLevel___main(x_1, x_30);
+x_34 = lean_expr_update_let(x_2, x_31, x_32, x_33);
+return x_34;
+}
+case 10:
+{
+lean_object* x_35; lean_object* x_36; lean_object* x_37; 
+x_35 = lean_ctor_get(x_2, 1);
+lean_inc(x_35);
+x_36 = l_Lean_Expr_replaceLevel___main(x_1, x_35);
+x_37 = lean_expr_update_mdata(x_2, x_36);
+return x_37;
+}
+case 11:
+{
+lean_object* x_38; lean_object* x_39; lean_object* x_40; 
+x_38 = lean_ctor_get(x_2, 2);
+lean_inc(x_38);
+x_39 = l_Lean_Expr_replaceLevel___main(x_1, x_38);
+x_40 = lean_expr_update_proj(x_2, x_39);
+return x_40;
+}
+default: 
+{
+lean_dec(x_1);
+return x_2;
+}
+}
+}
+}
+lean_object* l_Lean_Expr_replaceLevel(lean_object* x_1, lean_object* x_2) {
+_start:
+{
+lean_object* x_3; 
+x_3 = l_Lean_Expr_replaceLevel___main(x_1, x_2);
+return x_3;
+}
+}
+lean_object* initialize_Init(lean_object*);
+lean_object* initialize_Lean_Expr(lean_object*);
+static bool _G_initialized = false;
+lean_object* initialize_Lean_Util_ReplaceLevel(lean_object* w) {
+lean_object * res;
+if (_G_initialized) return lean_mk_io_result(lean_box(0));
+_G_initialized = true;
+res = initialize_Init(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+res = initialize_Lean_Expr(lean_io_mk_world());
+if (lean_io_result_is_error(res)) return res;
+lean_dec_ref(res);
+l_Lean_Expr_ReplaceLevelImpl_cacheSize = _init_l_Lean_Expr_ReplaceLevelImpl_cacheSize();
+l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1 = _init_l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__1);
+l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2 = _init_l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_replaceUnsafeM___main___closed__2);
+l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1 = _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_initCache___closed__1);
+l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2 = _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_initCache___closed__2);
+l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3 = _init_l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_initCache___closed__3);
+l_Lean_Expr_ReplaceLevelImpl_initCache = _init_l_Lean_Expr_ReplaceLevelImpl_initCache();
+lean_mark_persistent(l_Lean_Expr_ReplaceLevelImpl_initCache);
+return lean_mk_io_result(lean_box(0));
+}
+#ifdef __cplusplus
+}
+#endif