fact: Definition bsm_instr_compile lnk i ii := match ii with | PUSH s Zero => mm_push_Zero (reg s) tmp1 tmp2 (lnk i) | PUSH s One => mm_push_One (reg s) tmp1 tmp2 (lnk i) | POP s j k => mm_pop (reg s) tmp1 tmp2 (lnk i) (lnk j) (lnk (1+i)) (lnk k) end.
imports: List Arith Lia Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss compiler_correction) Undecidability.StackMachines.BSM(bsm_defs) Undecidability.MinskyMachines.MM(mm_defs mm_utils)