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/reducibility/cnf.ma".
17 (* CONTEXT-SENSITIVE PARALLEL COMPUTATION ON TERMS **************************)
19 (* Basic_1: includes: pr3_pr2 *)
20 definition cprs: lenv → relation term ≝
23 interpretation "context-sensitive parallel computation (term)"
24 'PRedStar L T1 T2 = (cprs L T1 T2).
26 (* Basic eliminators ********************************************************)
28 lemma cprs_ind: ∀L,T1. ∀R:predicate term. R T1 →
29 (∀T,T2. L ⊢ T1 ➡* T → L ⊢ T ➡ T2 → R T → R T2) →
30 ∀T2. L ⊢ T1 ➡* T2 → R T2.
31 #L #T1 #R #HT1 #IHT1 #T2 #HT12
32 @(TC_star_ind … HT1 IHT1 … HT12) //
35 lemma cprs_ind_dx: ∀L,T2. ∀R:predicate term. R T2 →
36 (∀T1,T. L ⊢ T1 ➡ T → L ⊢ T ➡* T2 → R T → R T1) →
37 ∀T1. L ⊢ T1 ➡* T2 → R T1.
38 #L #T2 #R #HT2 #IHT2 #T1 #HT12
39 @(TC_star_ind_dx … HT2 IHT2 … HT12) //
42 (* Basic properties *********************************************************)
44 (* Basic_1: was: pr3_refl *)
45 lemma cprs_refl: ∀L,T. L ⊢ T ➡* T.
48 lemma cprs_strap1: ∀L,T1,T,T2.
49 L ⊢ T1 ➡* T → L ⊢ T ➡ T2 → L ⊢ T1 ➡* T2.
52 (* Basic_1: was: pr3_step *)
53 lemma cprs_strap2: ∀L,T1,T,T2.
54 L ⊢ T1 ➡ T → L ⊢ T ➡* T2 → L ⊢ T1 ➡* T2.
57 (* Note: it does not hold replacing |L1| with |L2| *)
58 lemma cprs_lsubs_conf: ∀L1,T1,T2. L1 ⊢ T1 ➡* T2 →
59 ∀L2. L1 [0, |L1|] ≼ L2 → L2 ⊢ T1 ➡* T2.
63 (* Basic_1: was only: pr3_thin_dx *)
64 lemma cprs_flat_dx: ∀I,L,V1,V2. L ⊢ V1 ➡ V2 → ∀T1,T2. L ⊢ T1 ➡* T2 →
65 L ⊢ ⓕ{I} V1. T1 ➡* ⓕ{I} V2. T2.
66 #I #L #V1 #V2 #HV12 #T1 #T2 #HT12 @(cprs_ind … HT12) -T2 /3 width=1/
68 @(cprs_strap1 … IHT2) -IHT2 /2 width=1/
71 (* Basic inversion lemmas ***************************************************)
73 (* Basic_1: was: pr3_gen_sort *)
74 lemma cprs_inv_sort1: ∀L,U2,k. L ⊢ ⋆k ➡* U2 → U2 = ⋆k.
75 #L #U2 #k #H @(cprs_ind … H) -U2 //
76 #U2 #U #_ #HU2 #IHU2 destruct
77 >(cpr_inv_sort1 … HU2) -HU2 //
80 (* Basic_1: was: pr3_gen_cast *)
81 lemma cprs_inv_cast1: ∀L,W1,T1,U2. L ⊢ ⓣW1.T1 ➡* U2 → L ⊢ T1 ➡* U2 ∨
82 ∃∃W2,T2. L ⊢ W1 ➡* W2 & L ⊢ T1 ➡* T2 & U2 = ⓣW2.T2.
83 #L #W1 #T1 #U2 #H @(cprs_ind … H) -U2 /3 width=5/
84 #U2 #U #_ #HU2 * /3 width=3/ *
85 #W #T #HW1 #HT1 #H destruct
86 elim (cpr_inv_cast1 … HU2) -HU2 /3 width=3/ *
87 #W2 #T2 #HW2 #HT2 #H destruct /4 width=5/
90 (* Basic_1: was: nf2_pr3_unfold *)
91 lemma cprs_inv_cnf1: ∀L,T,U. L ⊢ T ➡* U → L ⊢ 𝐍[T] → T = U.
92 #L #T #U #H @(cprs_ind_dx … H) -T //
93 #T0 #T #H1T0 #_ #IHT #H2T0
94 lapply (H2T0 … H1T0) -H1T0 #H destruct /2 width=1/
97 (* Basic_1: removed theorems 10:
98 clear_pr3_trans pr3_cflat pr3_gen_bind
99 pr3_head_1 pr3_head_2 pr3_head_21 pr3_head_12
100 pr3_iso_appl_bind pr3_iso_appls_appl_bind pr3_iso_appls_bind