fact: Definition Q_step (Q : list (bsm_instr 4)) offset i v : option (bsm_state 4) := match nth_error Q i with | None => None | Some (bsm_pop x p' q') => Some ( match vec_pos v x with | [] => (q', v) | false :: l => (p', vec_change v x l) | true :: l => ((S i) + offset, vec_change v x l) end) | Some (bsm_push x b) => Some ((S i) + offset, vec_change v x (b :: vec_pos v x)) end.
imports: Undecidability.StackMachines(BSM BSM.bsm_defs) Undecidability.TM(SBTM Util.SBTM_facts) Undecidability.Shared.Libs.DLW(vec subcode sss) PeanoNat List Lia ssreflect ssrbool ssrfun