RSAPredict Helpers

Low-level expression utilities, MetaBounds interval arithmetic, and enum extraction used across the RSAPredict tactic submodules.

def Linglib.Tactics.RSAPredict.getOfNat? (e : Lean.Expr) : Option ℕ

Extract a natural number from @OfNat.ofNat T n inst.

Equations

• Linglib.Tactics.RSAPredict.getOfNat? e = do guard (e.isAppOfArity `OfNat.ofNat 3 = true) e.appFn!.appArg!.rawNatLit?

def Linglib.Tactics.RSAPredict.getNatCast? (e : Lean.Expr) : Option ℕ

Extract a natural number from @Nat.cast T inst n.

Equations

• Linglib.Tactics.RSAPredict.getNatCast? e = do guard (e.isAppOfArity `Nat.cast 3 = true) e.getAppArgs[2]!.rawNatLit?

def Linglib.Tactics.RSAPredict.getNat? (e : Lean.Expr) : Option ℕ

Equations

• Linglib.Tactics.RSAPredict.getNat? e = (e.rawNatLit? <|> Linglib.Tactics.RSAPredict.getOfNat? e <|> Linglib.Tactics.RSAPredict.getNatCast? e)

def Linglib.Tactics.RSAPredict.isAppOfMin (e : Lean.Expr) (name : Lean.Name) (minArgs : ℕ) : Bool

Equations

• Linglib.Tactics.RSAPredict.isAppOfMin e name minArgs = (e.getAppFn.isConstOf name && decide (e.getAppNumArgs ≥ minArgs))

def Linglib.Tactics.RSAPredict.resolveNat? (e : Lean.Expr) : Lean.MetaM (Option ℕ)

Try to extract a natural number, unfolding/reducing as needed.

Equations

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

structure Linglib.Tactics.RSAPredict.MetaBounds : Type

Meta-level interval bounds for early checks.

• lo : ℚ
• hi : ℚ

def Linglib.Tactics.RSAPredict.instInhabitedMetaBounds.default : MetaBounds

Equations

• Linglib.Tactics.RSAPredict.instInhabitedMetaBounds.default = { lo := default, hi := default }

instance Linglib.Tactics.RSAPredict.instInhabitedMetaBounds : Inhabited MetaBounds

Equations

• Linglib.Tactics.RSAPredict.instInhabitedMetaBounds = { default := Linglib.Tactics.RSAPredict.instInhabitedMetaBounds.default }

def Linglib.Tactics.RSAPredict.metaEvalMul (a b : MetaBounds) : MetaBounds

Equations

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

def Linglib.Tactics.RSAPredict.roundDownBin (q : ℚ) (bits : ℕ) : ℚ

Round a nonneg ℚ down to bits binary digits: floor(q · 2^bits) / 2^bits. The result has a power-of-2 denominator, preventing denominator blowup.

Equations

• Linglib.Tactics.RSAPredict.roundDownBin q bits = ↑(q.num.toNat * 2 ^ bits / q.den) / ↑(2 ^ bits)

def Linglib.Tactics.RSAPredict.roundUpBin (q : ℚ) (bits : ℕ) : ℚ

Round a nonneg ℚ up to bits binary digits: ceil(q · 2^bits) / 2^bits.

Equations

• Linglib.Tactics.RSAPredict.roundUpBin q bits = ↑((q.num.toNat * 2 ^ bits + q.den - 1) / q.den) / ↑(2 ^ bits)

def Linglib.Tactics.RSAPredict.roundBounds (b : MetaBounds) (bits : ℕ := 48) : MetaBounds

Round MetaBounds outward (lo down, hi up) to bits binary digits. Maintains soundness: the rounded interval contains the original. Assumes both bounds are nonneg (always true for RSA scores).

Equations

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

def Linglib.Tactics.RSAPredict.metaQIAdd (a b : MetaBounds) : MetaBounds

Equations

• Linglib.Tactics.RSAPredict.metaQIAdd a b = { lo := a.lo + b.lo, hi := a.hi + b.hi }

def Linglib.Tactics.RSAPredict.metaQISumMap (scores : Array MetaBounds) : MetaBounds

Equations

• Linglib.Tactics.RSAPredict.metaQISumMap scores = Array.foldl Linglib.Tactics.RSAPredict.metaQIAdd { lo := 0, hi := 0 } scores

def Linglib.Tactics.RSAPredict.metaQIDivPosSafe (num denom : MetaBounds) : MetaBounds

Equations

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

def Linglib.Tactics.RSAPredict.metaQINormalize (scores : Array MetaBounds) (targetIdx : ℕ) : MetaBounds

Equations

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

def Linglib.Tactics.RSAPredict.metaL1Score (nL nW nU : ℕ) (s1Bounds : Array MetaBounds) (wpValues lpValues : Array ℚ) (uIdx wIdx : ℕ) : MetaBounds

Compute L1 unnormalized score at meta level using MetaBounds. L1(u,w) = worldPrior(w) · Σ_l latentPrior(w,l) · S1_policy(l,w,u) where S1_policy(l,w,u) = S1(l,w,u) / Σ_{u'} S1(l,w,u'). lpValues is indexed as lpValues[wIdx * nL + lIdx].

Equations

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

def Linglib.Tactics.RSAPredict.metaL1LatentScore (nL nW nU : ℕ) (s1Bounds : Array MetaBounds) (wpValues lpValues : Array ℚ) (uIdx lIdx : ℕ) : MetaBounds

Compute latent inference score at meta level: latent_score(l) = Σ_w worldPrior(w) · latentPrior(w,l) · S1_policy(l,w,u) where S1_policy(l,w,u) = S1(l,w,u) / Σ_{u'} S1(l,w,u'). lpValues is indexed as lpValues[wIdx * nL + lIdx].

Equations

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

def Linglib.Tactics.RSAPredict.metaL1Policy (nL nW nU : ℕ) (s1Bounds : Array MetaBounds) (wpValues lpValues : Array ℚ) (uIdx : ℕ) (allWIndices : Array ℕ) (targetWIdx : ℕ) : MetaBounds

Compute L1 policy bounds at meta level (score / total). Used for cross-utterance comparisons where denominators differ.

Equations

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

def Linglib.Tactics.RSAPredict.metaS2Score (nL nW nU : ℕ) (s1Bounds : Array MetaBounds) (wpValues lpValues : Array ℚ) (allUIndices : Array ℕ) (targetUIdx wIdx : ℕ) : MetaBounds

Compute S2 policy bounds at meta level (cross-world comparison). S2(u|w) = L1(u,w) / Σ_{u'} L1(u',w), where L1 is the normalized posterior. S2agent.score(w,u) = cfg.L1(u,w) = L1agent.policy(u,w).

Equations

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

def Linglib.Tactics.RSAPredict.findElemIdx (elems : Array Lean.Expr) (target : Lean.Expr) : Lean.MetaM ℕ

Find the index of target in elems by definitional equality.

Equations

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

def Linglib.Tactics.RSAPredict.extractList (e : Lean.Expr) : Lean.MetaM (Array Lean.Expr)

Extract a concrete List from a Lean Expr, extracting cons cells.

Equations

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

partial def Linglib.Tactics.RSAPredict.getFiniteElems (T : Lean.Expr) : Lean.MetaM (Lean.Expr × Array Lean.Expr)

Get all elements of a finite type as a List, represented as Lean Exprs. Returns (listExpr, elemExprs) where listExpr : Expr of type List T and elemExprs are the individual elements.

def Linglib.Tactics.RSAPredict.mkRatExpr (q : ℚ) : Lean.MetaM Lean.Expr

Build a Lean Expr for a ℚ literal.

Equations

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

@[implemented_by _private.Linglib.Tactics.RSAPredict.Helpers.0.Linglib.Tactics.RSAPredict.tryEvalBoolUnsafe]

opaque Linglib.Tactics.RSAPredict.tryEvalBool (e : Lean.Expr) : Lean.MetaM (Option Bool)