Documentation

LeanSce.SCE.LinkingLaws

theorem S_Sem.sel_merge_disjoint {v₁ v₂ w : SCE.Exp} {B : SCE.Typ} {l : String} {ce₂ : Core.Exp} (hv₂ : SCE.Value v₂) (helab₂ : elabExp SCE.Typ.top v₂ B ce₂) (hnotin : ¬SCE.LabelIn l B) :
Sel (v₁.mrg v₂) l w ↔ Sel v₁ l w

Law C prerequisite. Selection is unaffected by a merge extension whose labels it avoids. Without disjointness Sel genuinely relates both sides.

theorem S_Sem.interface_abstraction {Γ A B P₁ P₂ : SCE.Typ} {l : String} {ρ e p₁ p₂ vl w : SCE.Exp} {ec ρc pc₁ pc₂ : Core.Exp} (he : elabExp Γ e ((SCE.Typ.rcd l A).marr B) ec) (hρ : elabExp SCE.Typ.top ρ Γ ρc) (hρv : SCE.Value ρ) (hp₁v : SCE.Value p₁) (hp₂v : SCE.Value p₂) (hp₁ : elabExp SCE.Typ.top p₁ P₁ pc₁) (hp₂ : elabExp SCE.Typ.top p₂ P₂ pc₂) (hl₁ : SCE.SRLookup P₁ l A) (hl₂ : SCE.SRLookup P₂ l A) (hs₁ : Sel p₁ l vl) (hs₂ : Sel p₂ l vl) :
BStep ρ (p₁.mlink e) (p₁.mrg w) ↔ BStep ρ (p₂.mlink e) (p₂.mrg w)

Interface abstraction (the paper's Theorem thm:interface-abstraction). Two well-typed provider values that select the same value at the client's import label l drive the client to the same exports.