Determinism of SCE evaluation, proved through elaboration: the elaboration hypothesis rules out ambiguous label selection.
theorem
sel_deterministic
{v v₁ v₂ : SCE.Exp}
{vc : Core.Exp}
{A B : SCE.Typ}
{l : String}
(hval : SCE.Value v)
(helab : elabExp SCE.Typ.top v A vc)
(hlookup : SCE.SRLookup A l B)
(hsel₁ : S_Sem.Sel v l v₁)
(hsel₂ : S_Sem.Sel v l v₂)
:
theorem
bigstep_deterministic_gen
{Γ A : SCE.Typ}
{e ρ v₁ v₂ : SCE.Exp}
{ec ρc : Core.Exp}
(helab : elabExp Γ e A ec)
(henv : elabExp SCE.Typ.top ρ Γ ρc)
(henv_val : SCE.Value ρ)
(heval₁ : S_Sem.BStep ρ e v₁)
(heval₂ : S_Sem.BStep ρ e v₂)
:
theorem
bigstep_deterministic
{A : SCE.Typ}
{e v₁ v₂ : SCE.Exp}
(helab : ∃ (ec : Core.Exp), elabExp SCE.Typ.top e A ec)
(heval₁ : S_Sem.BStep SCE.Exp.unit e v₁)
(heval₂ : S_Sem.BStep SCE.Exp.unit e v₂)
: