Code review after the initial prove commit found and fixed:
1. Calls inside table/list literals were silently dropped — a function
with side-effectful cells lowered to "no ops" and claimed purity in
Lean. lower_expr's fallback now rejects with proof.unsupported
(author must bind the call to a variable first).
2. Same-callee call sites with different arities (optional params)
shared one Op whose ctor declared the first-seen arity, emitting
uncompilable Lean. register_op now suffixes `/N` per arity.
3. proof.name_shadow fired once per walked function (N functions → N
duplicates) and checked params of claim-free functions. Predicate
check runs once per module; param check only for functions that
carry claims.
4. 长度(轨迹) = 2 emitted mqEq (Nat) (Val) — type-mismatched Lean.
Nat-context detection renders trace-length comparisons natively;
untranslatable shapes become comments instead of broken Lean.
Hardening: lean_ident reserves 轨迹₀ / h_前提 (theorem binder
collision); emit_theorems dedups repeated claim ids.
Tests: +4 integration regressions (p2_a..p2_d), 23 prove tests total;
full suite green except the documented env-limited failures (one
host::foreign_session flake passes standalone).
Business validation (doc §12): e-commerce order-approval SKILL with 3
theorems cross-checked against the real interpreter — 5000 → auto
(1-step trace), 20000/60000 → manual ticket T-20000/T-60000
(需人工→创建, exactly 2 steps); corrupted claim tables hit
check --proof codes while staying default-off; double emit
byte-identical.