fact: Fixpoint pop_many (k : nat) (i : nat) : list (bsm_instr n) := match k with | 0 => nil | S k => POP x (i + 1) (S (k + i)) :: pop_many k (S i) end.
imports: List Arith Lia Bool Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss) Undecidability.StackMachines.BSM(tiles_solvable bsm_defs)