1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 include "basic_2/notation/relations/btpredstarproper_8.ma".
16 include "basic_2/reduction/fpbc.ma".
17 include "basic_2/computation/fpbs.ma".
19 (* GENEARAL "BIG TREE" PROPER PARALLEL COMPUTATION FOR CLOSURES *************)
21 (* Note: this is not transitive *)
22 inductive fpbg (h) (g) (G1) (L1) (T1): relation3 genv lenv term ≝
23 | fpbg_cpxs: ∀L2,T2. ⦃G1, L1⦄ ⊢ T1 ➡*[h, g] T2 → (T1 = T2 → ⊥) → ⦃G1, L1⦄ ⊢ ➡*[h, g] L2 →
24 fpbg h g G1 L1 T1 G1 L2 T2
25 | fpbg_fqup: ∀G2,L,L2,T,T2. ⦃G1, L1⦄ ⊢ T1 ➡*[h, g] T → ⦃G1, L1, T⦄ ⊃+ ⦃G2, L, T2⦄ → ⦃G2, L⦄ ⊢ ➡*[h, g] L2 →
26 fpbg h g G1 L1 T1 G2 L2 T2
29 interpretation "'big tree' proper parallel computation (closure)"
30 'BTPRedStarProper h g G1 L1 T1 G2 L2 T2 = (fpbg h g G1 L1 T1 G2 L2 T2).
32 (* Basic properties *********************************************************)
34 lemma fpbc_fpbg: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ →
35 ⦃G1, L1, T1⦄ >[h, g] ⦃G2, L2, T2⦄.
36 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
37 /3 width=5 by fpbg_cpxs, fpbg_fqup, fqu_fqup, cpx_cpxs/