proposition: Lemma AppR_typing Gamma L s T B: Gamma ⊢₊ T : L -> Gamma ⊢ s : Arr (rev L) B -> Gamma ⊢ AppR s T : B.
proof: Proof. induction 1 in s, B |-*; cbn; (eauto 1); rewrite Arr_app; cbn; (eauto 3). Qed.
imports: List Arith Lia Morphisms FinFun Undecidability.HOU(std.std) Undecidability.HOU.calculus(prelim terms syntax semantics equivalence typing order confluence)