Fω weak-CBV erasure into the existing full-beta term model

TheoremErasure of an Fω evaluation step is a beta conversion#✓fully proved

Every actual Fω CBV step preserves beta conversion of arbitrary closing instances.

theorem erasure_step {Δ : List Kind} {m : Nat} {t t' : Tm Δ m}
    (hs : Step t t') (σ : Fin m → SystemF.Model) :
    SystemF.BetaEq (Tm.close σ t) (Tm.close σ t')
Uses 21 · Used by 1

TheoremErasure of multistep Fω evaluation is a beta conversion#✓fully proved

Finite Fω evaluation preserves beta conversion of the closing instances.

theorem erasure_steps {Δ : List Kind} {m : Nat} {t t' : Tm Δ m}
    (hs : Relation.ReflTransGen Step t t') (σ : Fin m → SystemF.Model) :
    SystemF.BetaEq (Tm.close σ t) (Tm.close σ t')
Uses 9
2 fully proved

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.