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/computation/cprs_cprs.ma".
16 include "basic_2/computation/lprs.ma".
18 (* SN PARALLEL COMPUTATION ON LOCAL ENVIRONMENTS ****************************)
20 (* alternative definition *)
21 definition lprsa: relation lenv ≝ lpx_sn … cprs.
23 interpretation "parallel computation (local environment, sn variant) alternative"
24 'PRedSnStarAlt L1 L2 = (lprsa L1 L2).
26 (* Main properties on the alternative definition ****************************)
28 theorem lprsa_lprs: ∀L1,L2. L1 ⊢ ➡➡* L2 → L1 ⊢ ➡* L2.
29 /2 width=1 by lpx_sn_LTC_TC_lpx_sn/ qed-.
31 (* Main inversion lemmas on the alternative definition **********************)
33 theorem lprs_inv_lprsa: ∀L1,L2. L1 ⊢ ➡* L2 → L1 ⊢ ➡➡* L2.
34 /3 width=3 by TC_lpx_sn_inv_lpx_sn_LTC, lpr_cprs_trans/ qed-.
36 (* Alternative eliminators **************************************************)
38 lemma lprs_ind_alt: ∀R:relation lenv.
41 K1 ⊢ ➡* K2 → K1 ⊢ V1 ➡* V2 →
42 R K1 K2 → R (K1.ⓑ{I}V1) (K2.ⓑ{I}V2)
44 ∀L1,L2. L1 ⊢ ➡* L2 → R L1 L2.
45 /3 width=4 by TC_lpx_sn_ind, lpr_cprs_trans/ qed-.