∀L,k. NF … (RR L) RS (⋆k).
definition CP2 ≝ λRR:lenv→relation term. λRS:relation term.
- â\88\80L,K,W,i. â\87\93[0,i] L ≡ K. 𝕓{Abst} W → NF … (RR L) RS (#i).
+ â\88\80L,K,W,i. â\87©[0,i] L ≡ K. 𝕓{Abst} W → NF … (RR L) RS (#i).
definition CP3 ≝ λRR:lenv→relation term. λRP:lenv→predicate term.
∀L,V,k. RP L (𝕔{Appl}⋆k.V) → RP L V.
definition CP4 ≝ λRR:lenv→relation term. λRS:relation term.
∀L0,L,T,T0,d,e. NF … (RR L) RS T →
- â\87\93[d,e] L0 â\89¡ L â\86\92 â\87\91[d, e] T ≡ T0 → NF … (RR L0) RS T0.
+ â\87©[d,e] L0 â\89¡ L â\86\92 â\87§[d, e] T ≡ T0 → NF … (RR L0) RS T0.
definition CP4s ≝ λRR:lenv→relation term. λRS:relation term.
- â\88\80L0,L,des. â\87\93[des] L0 ≡ L →
- â\88\80T,T0. â\87\91[des] T ≡ T0 →
+ â\88\80L0,L,des. â\87©*[des] L0 ≡ L →
+ â\88\80T,T0. â\87§*[des] T ≡ T0 →
NF … (RR L) RS T → NF … (RR L0) RS T0.
(* requirements for abstract computation properties *)