proposition: Theorem mma_auto_compiler : compiler_t (@mma_sss n) (@mma_sss n) eq.
proof: Proof. apply generic_compiler with (icomp := mma_instr_compile) (ilen := mma_instr_compile_length); auto. + apply mma_sss_total_ni. + apply mma_sss_fun. Qed.
imports: List Arith Lia Undecidability.Shared.Libs.DLW(utils pos vec subcode sss compiler_correction) Undecidability.MinskyMachines.MMA(mma_defs mma_utils)