]
qed.
+lemma loop_p_true :
+ ∀A,k,f,p,a.p a = true → loop A (S k) f p a = Some ? a.
+#A #k #f #p #a #Ha normalize >Ha %
+qed.
+
lemma loop_Some :
∀A,k,f,p,a,b.loop A k f p a = Some ? b → p b = true.
#A #k #f #p elim k
loopM sig M i (initc sig M t) = Some ? outc ∧
(cstate ?? outc = acc → Rtrue t (ctape ?? outc)) ∧
(cstate ?? outc ≠ acc → Rfalse t (ctape ?? outc)).
+
+notation "M ⊨ [q: R1,R2]" non associative with precedence 45 for @{ 'cmodels $M $q $R1 $R2}.
+interpretation "conditional realizability" 'cmodels M q R1 R2 = (accRealize ? M q R1 R2).
(******************************** NOP Machine *********************************)
notation "a · b" non associative with precedence 65 for @{ 'middot $a $b}.
interpretation "sequential composition" 'middot a b = (seq ? a b).
-definition Rcomp ≝ λA.λR1,R2:relation A.λa1,a2.
- ∃am.R1 a1 am ∧ R2 am a2.
-
-interpretation "relation composition" 'compose R1 R2 = (Rcomp ? R1 R2).
-
definition lift_confL ≝
λsig,S1,S2,c.match c with
[ mk_config s t ⇒ mk_config sig (FinSum S1 S2) (inl … s) t ].