proposition: Lemma cast_cast {n m} {E : n = m} {X} (v : Vector.t X n) (E2 : m = n) : cast (cast v E) E2 = v.
proof: Proof. destruct E. now rewrite !cast_eq_refl. Qed.
imports: Undecidability.MinskyMachines(MM_computable MM_sss mm_utils) Undecidability.StackMachines(BSM_computable) Undecidability.Shared.Libs.DLW(vec pos sss subcode) Lia Vector Nat Arith List Undecidability.MinskyMachines.MM(mm_defs mm_utils mm_comp_strong)