Target interface
The target is the parameterized calculus 𝖬𝖾𝗍[T], not METL and not the earlier contextual-modal calculus. Its signature is Γ⊢𝐷:𝖤𝖿𝖿,𝐷≡T𝐷′,𝐸⪯𝖾𝐹,Γ⊢𝐴≡𝖬𝖾𝗍𝐵,Γ⊢𝜇⇒𝜈@𝐹,Ω∣Γ⊢𝑀:𝐴@𝐸,(𝑀;Ω)⟶(𝑁;Ω′). The two validity assumptions are 𝐸⪯𝖾∅⇒𝐸=∅,ℓ⪯𝖾ℓ′,𝐸∧ℓ≠ℓ′⇒ℓ⪯𝖾𝐸. Under these assumptions, the imported target endpoints are progress and subject reduction for 𝖬𝖾𝗍[T]. Progress permits a normal unhandled request exactly when its label occurs in the displayed ambient effect context. Empty-effect safety is the corollary at 𝐸 =∅; termination is not a conclusion.
System 𝐹𝜀 encoding interface
The source judgments are Γ ⊢𝑣𝑉 :𝐴 and Γ ⊢𝑐𝑀 :𝐴!𝐸. The translation target is 𝖬𝖾𝗍[Rsc], where scoped-row equivalence preserves multiplicity. The theorem interface is Γ⊢𝑐𝑀:𝐴!𝐸⇓⟨⟨Γ⟩⟩𝗋⊢⟨⟨𝑀⟩⟩𝗋:⟨⟨𝐴⟩⟩𝗋@⟨⟨𝐸⟩⟩𝗋,𝑀⟶𝑁⟹⟨⟨𝑀⟩⟩𝗋⟶∗⟨⟨𝑁⟩⟩𝗋. The second conclusion is a forward multi-step simulation for one typed source step. It is not reflection, full abstraction, adequacy, or an inverse.
System 𝐶 encoding interface
The source judgments distinguish values, blocks, and computations. The target is 𝖬𝖾𝗍[S], and the proof is simultaneous over Γ⊢𝑣𝑉:𝐴,Γ⊢𝑏𝑃:𝑇∣𝐶,Γ⊢𝑐𝑀:𝐴∣𝐶. The computation endpoint is Γ⊢𝑐𝑀:𝐴∣𝐶⟹⟨⟨Γ⟩⟩𝖼⊢⟨⟨𝑀⟩⟩𝖼:⟨⟨𝐴⟩⟩𝖼@⟨⟨𝐶⟩⟩𝖼. For a well-typed source configuration step, (𝑀;Ω)⟶(𝑁;Ω′)⟹(⟨⟨𝑀⟩⟩𝖼;⟨⟨Ω⟩⟩𝖼)⟶∗(⟨⟨𝑁⟩⟩𝖼;⟨⟨Ω′⟩⟩𝖼). Fresh local-label generation and the block/capability substitution lemma are part of this endpoint. It neither proves a theorem about the full Effekt implementation nor removes System 𝐶’s second-class restriction.
Evidence ledger
| card |
source status |
exact conclusion |
excluded transfer |
| Met safety |
imported from Tang–Lindley, target metatheory |
progress and subject reduction under validity |
no termination or METL-implementation theorem |
| row encoding |
imported type and semantics preservation |
typed 𝐹𝜀 terms and steps map to typed Met terms and steps |
no direct row-to-capability map |
| capability encoding |
imported simultaneous type preservation and configuration simulation |
typed System 𝐶 values, blocks, computations, and steps map to Met |
no inverse, full abstraction, or implementation theorem |
| METL artifact |
finite checker/interpreter example evidence |
retained examples execute in the surface implementation |
implements neither source encoding |
| Kappa companion |
finite Appendix-E observation model |
eight cases and three frozen mutation failures |
proves none of the imported theorems |
The exact imported endpoints are Theorems 3.7–3.8 (§3.7, p. 18), Theorems 4.1–4.2 (§4.2, p. 20), and Theorems 5.1–5.2 (§5.2, p. 23) of Tang and Lindley [TL26]; the target-design and METL-artifact boundary is Tang et al. [TWD^+25]. The two imported encoding proofs are independent. Their common target is a span, not a triangle or an equivalence.