(* UNITARY "BIG TREE" PROPER PARALLEL COMPUTATION FOR CLOSURES **************)
inductive fpbu (h) (g) (G1) (L1) (T1): relation3 genv lenv term ≝
-| fpbu_fqup: â\88\80G2,L2,T2. â¦\83G1, L1, T1â¦\84 â\8a\83+ ⦃G2, L2, T2⦄ → fpbu h g G1 L1 T1 G2 L2 T2
+| fpbu_fqup: â\88\80G2,L2,T2. â¦\83G1, L1, T1â¦\84 â\8a\90+ ⦃G2, L2, T2⦄ → fpbu h g G1 L1 T1 G2 L2 T2
| fpbu_cpxs: ∀T2. ⦃G1, L1⦄ ⊢ T1 ➡*[h, g] T2 → (T1 = T2 → ⊥) → fpbu h g G1 L1 T1 G1 L1 T2
-| fpbu_lpxs: â\88\80L2. â¦\83G1, L1â¦\84 â\8a¢ â\9e¡*[h, g] L2 â\86\92 (L1 â\8b\95[T1, 0] L2 → ⊥) → fpbu h g G1 L1 T1 G1 L2 T1
+| fpbu_lpxs: â\88\80L2. â¦\83G1, L1â¦\84 â\8a¢ â\9e¡*[h, g] L2 â\86\92 (L1 â\89¡[T1, 0] L2 → ⊥) → fpbu h g G1 L1 T1 G1 L2 T1
.
interpretation
⦃G, L, T1⦄ ≻[h, g] ⦃G, L, T2⦄.
/3 width=1 by fpbu_cpxs, cprs_cpxs/ qed.
-lemma lprs_fpbu: â\88\80h,g,G,L1,L2,T. â¦\83G, L1â¦\84 â\8a¢ â\9e¡* L2 â\86\92 (L1 â\8b\95[T, 0] L2 → ⊥) →
+lemma lprs_fpbu: â\88\80h,g,G,L1,L2,T. â¦\83G, L1â¦\84 â\8a¢ â\9e¡* L2 â\86\92 (L1 â\89¡[T, 0] L2 → ⊥) →
⦃G, L1, T⦄ ≻[h, g] ⦃G, L2, T⦄.
/3 width=1 by fpbu_lpxs, lprs_lpxs/ qed.