@[reducible, inline]

abbrev Lean.IR.UniqueIds.M (α : Type) : Type

Equations

• Lean.IR.UniqueIds.M = StateT Lean.IR.IndexSet Id

def Lean.IR.UniqueIds.checkId (id : Lean.IR.Index) : Lean.IR.UniqueIds.M Bool

Equations

• Lean.IR.UniqueIds.checkId id = modifyGet fun (s : Lean.IR.IndexSet) => if Lean.RBTree.contains s id = true then (false, s) else (true, Lean.RBTree.insert s id)

def Lean.IR.UniqueIds.checkParams (ps : Array Lean.IR.Param) : Lean.IR.UniqueIds.M Bool

Equations

• Lean.IR.UniqueIds.checkParams ps = Array.allM (fun (p : Lean.IR.Param) => Lean.IR.UniqueIds.checkId p.x.idx) ps

partial def Lean.IR.UniqueIds.checkFnBody : Lean.IR.FnBody → Lean.IR.UniqueIds.M Bool

def Lean.IR.UniqueIds.checkDecl : Lean.IR.Decl → Lean.IR.UniqueIds.M Bool

def Lean.IR.Decl.uniqueIds (d : Lean.IR.Decl) : Bool

Return true if variable, parameter and join point ids are unique

Equations

• d.uniqueIds = StateT.run' (Lean.IR.UniqueIds.checkDecl d) ∅

@[reducible, inline]

abbrev Lean.IR.NormalizeIds.M (α : Type) : Type

Equations

• Lean.IR.NormalizeIds.M = ReaderT Lean.IR.IndexRenaming Id

Instances For

• Lean.IR.NormalizeIds.instMonadLiftMN

def Lean.IR.NormalizeIds.normIndex (x : Lean.IR.Index) : Lean.IR.NormalizeIds.M Lean.IR.Index

def Lean.IR.NormalizeIds.normVar (x : Lean.IR.VarId) : Lean.IR.NormalizeIds.M Lean.IR.VarId

def Lean.IR.NormalizeIds.normJP (x : Lean.IR.JoinPointId) : Lean.IR.NormalizeIds.M Lean.IR.JoinPointId

Equations

• Lean.IR.NormalizeIds.normJP x = Lean.IR.JoinPointId.mk <$> Lean.IR.NormalizeIds.normIndex x.idx

def Lean.IR.NormalizeIds.normArg : Lean.IR.Arg → Lean.IR.NormalizeIds.M Lean.IR.Arg

Equations

• Lean.IR.NormalizeIds.normArg (Lean.IR.Arg.var x_1) = Lean.IR.Arg.var <$> Lean.IR.NormalizeIds.normVar x_1
• Lean.IR.NormalizeIds.normArg x = pure x

def Lean.IR.NormalizeIds.normArgs (as : Array Lean.IR.Arg) : Lean.IR.NormalizeIds.M (Array Lean.IR.Arg)

def Lean.IR.NormalizeIds.normExpr : Lean.IR.Expr → Lean.IR.NormalizeIds.M Lean.IR.Expr

@[reducible, inline]

abbrev Lean.IR.NormalizeIds.N (α : Type) : Type

Equations

• Lean.IR.NormalizeIds.N = ReaderT Lean.IR.IndexRenaming (StateM Nat)

Instances For

• Lean.IR.NormalizeIds.instMonadLiftMN

@[inline]

def Lean.IR.NormalizeIds.withVar {α : Type} (x : Lean.IR.VarId) (k : Lean.IR.VarId → Lean.IR.NormalizeIds.N α) : Lean.IR.NormalizeIds.N α

Equations

• Lean.IR.NormalizeIds.withVar x k m = do let n ← getModify fun (n : Nat) => n + 1 k { idx := n } (Lean.RBMap.insert m x.idx n)

@[inline]

def Lean.IR.NormalizeIds.withJP {α : Type} (x : Lean.IR.JoinPointId) (k : Lean.IR.JoinPointId → Lean.IR.NormalizeIds.N α) : Lean.IR.NormalizeIds.N α

@[inline]

def Lean.IR.NormalizeIds.withParams {α : Type} (ps : Array Lean.IR.Param) (k : Array Lean.IR.Param → Lean.IR.NormalizeIds.N α) : Lean.IR.NormalizeIds.N α

Equations

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

instance Lean.IR.NormalizeIds.instMonadLiftMN : MonadLift Lean.IR.NormalizeIds.M Lean.IR.NormalizeIds.N

partial def Lean.IR.NormalizeIds.normFnBody : Lean.IR.FnBody → Lean.IR.NormalizeIds.N Lean.IR.FnBody

def Lean.IR.NormalizeIds.normDecl (d : Lean.IR.Decl) : Lean.IR.NormalizeIds.N Lean.IR.Decl

Equations

• One or more equations did not get rendered due to their size.
• Lean.IR.NormalizeIds.normDecl d = pure d

def Lean.IR.Decl.normalizeIds (d : Lean.IR.Decl) : Lean.IR.Decl

Create a declaration equivalent to d s.t. d.normalizeIds.uniqueIds == true

Apply a function f : VarId → VarId to variable occurrences. The following functions assume the IR code does not have variable shadowing.

@[inline]

def Lean.IR.MapVars.mapArg (f : Lean.IR.VarId → Lean.IR.VarId) : Lean.IR.Arg → Lean.IR.Arg

def Lean.IR.MapVars.mapArgs (f : Lean.IR.VarId → Lean.IR.VarId) (as : Array Lean.IR.Arg) : Array Lean.IR.Arg

def Lean.IR.MapVars.mapExpr (f : Lean.IR.VarId → Lean.IR.VarId) : Lean.IR.Expr → Lean.IR.Expr

Equations

• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.ctor c ys) = Lean.IR.Expr.ctor c (Lean.IR.MapVars.mapArgs f ys)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.reset n x_1) = Lean.IR.Expr.reset n (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.reuse x_1 c u ys) = Lean.IR.Expr.reuse (f x_1) c u (Lean.IR.MapVars.mapArgs f ys)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.proj i x_1) = Lean.IR.Expr.proj i (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.uproj i x_1) = Lean.IR.Expr.uproj i (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.sproj n o x_1) = Lean.IR.Expr.sproj n o (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.fap c ys) = Lean.IR.Expr.fap c (Lean.IR.MapVars.mapArgs f ys)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.pap c ys) = Lean.IR.Expr.pap c (Lean.IR.MapVars.mapArgs f ys)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.ap x_1 ys) = Lean.IR.Expr.ap (f x_1) (Lean.IR.MapVars.mapArgs f ys)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.box t x_1) = Lean.IR.Expr.box t (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.unbox x_1) = Lean.IR.Expr.unbox (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.isShared x_1) = Lean.IR.Expr.isShared (f x_1)
• Lean.IR.MapVars.mapExpr f (Lean.IR.Expr.lit v) = Lean.IR.Expr.lit v

partial def Lean.IR.MapVars.mapFnBody (f : Lean.IR.VarId → Lean.IR.VarId) : Lean.IR.FnBody → Lean.IR.FnBody

@[inline]

def Lean.IR.FnBody.mapVars (f : Lean.IR.VarId → Lean.IR.VarId) (b : Lean.IR.FnBody) : Lean.IR.FnBody

Equations

• Lean.IR.FnBody.mapVars f b = Lean.IR.MapVars.mapFnBody f b

def Lean.IR.FnBody.replaceVar (x y : Lean.IR.VarId) (b : Lean.IR.FnBody) : Lean.IR.FnBody

Replace x with y in b. This function assumes b does not shadow x

Equations

• Lean.IR.FnBody.replaceVar x y b = Lean.IR.FnBody.mapVars (fun (z : Lean.IR.VarId) => if (x == z) = true then y else z) b