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 notation "hvbox( h ⊢ break ⦃ L1, break T1 ⦄ • ⥸ break [ g ] break ⦃ L2 , break T2 ⦄ )"
16 non associative with precedence 45
17 for @{ 'YPRed $h $g $L1 $T1 $L2 $T2 }.
19 include "basic_2/substitution/csup.ma".
20 include "basic_2/reducibility/xpr.ma".
22 (* HYPER PARALLEL REDUCTION ON CLOSURES *************************************)
24 inductive ypr (h) (g) (L1) (T1): relation2 lenv term ≝
25 | ypr_cpr : ∀T2. L1 ⊢ T1 ➡ T2 → ypr h g L1 T1 L1 T2
26 | ypr_ssta: ∀T2,l. ⦃h, L1⦄ ⊢ T1 •[g, l + 1] T2 → ypr h g L1 T1 L1 T2
27 | ypr_csup: ∀L2,T2. ⦃L1, T1⦄ > ⦃L2, T2⦄ → ypr h g L1 T1 L2 T2
31 "hyper parallel reduction (closure)"
32 'YPRed h g L1 T1 L2 T2 = (ypr h g L1 T1 L2 T2).
34 (* Basic properties *********************************************************)
36 lemma ypr_refl: ∀h,g. bi_reflexive … (ypr h g).
39 lemma xpr_ypr: ∀h,g,L,T1,T2. ⦃h, L⦄ ⊢ T1 •➡[g] T2 → h ⊢ ⦃L, T1⦄ •⥸[g] ⦃L, T2⦄.
40 #h #g #L #T1 #T2 * /2 width=1/ /2 width=2/