matita/matita/contribs/lambdadelta/basic_2A/computation/scpds.ma

   1 (**************************************************************************)
   2 (*       ___                                                              *)
   3 (*      ||M||                                                             *)
   4 (*      ||A||       A project by Andrea Asperti                           *)
   5 (*      ||T||                                                             *)
   6 (*      ||I||       Developers:                                           *)
   7 (*      ||T||         The HELM team.                                      *)
   8 (*      ||A||         http://helm.cs.unibo.it                             *)
   9 (*      \   /                                                             *)
  10 (*       \ /        This file is distributed under the terms of the       *)
  11 (*        v         GNU General Public License Version 2                  *)
  12 (*                                                                        *)
  13 (**************************************************************************)
  14
  15 include "basic_2A/notation/relations/dpredstar_7.ma".
  16 include "basic_2A/static/da.ma".
  17 include "basic_2A/computation/cprs.ma".
  18
  19 (* STRATIFIED DECOMPOSED PARALLEL COMPUTATION ON TERMS **********************)
  20
  21 definition scpds: ∀h. sd h → nat → relation4 genv lenv term term ≝
  22                   λh,g,d2,G,L,T1,T2.
  23                   ∃∃T,d1. d2 ≤ d1 & ⦃G, L⦄ ⊢ T1 ▪[h, g] d1 & ⦃G, L⦄ ⊢ T1 •*[h, d2] T & ⦃G, L⦄ ⊢ T ➡* T2.
  24
  25 interpretation "stratified decomposed parallel computation (term)"
  26    'DPRedStar h g d G L T1 T2 = (scpds h g d G L T1 T2).
  27
  28 (* Basic properties *********************************************************)
  29
  30 lemma sta_cprs_scpds: ∀h,g,G,L,T1,T,T2,d. ⦃G, L⦄ ⊢ T1 ▪[h, g] d+1 → ⦃G, L⦄ ⊢ T1 •*[h, 1] T →
  31                       ⦃G, L⦄ ⊢ T ➡* T2 → ⦃G, L⦄ ⊢ T1 •*➡*[h, g, 1] T2.
  32 /2 width=6 by ex4_2_intro/ qed.
  33
  34 lemma lstas_scpds: ∀h,g,G,L,T1,T2,d1. ⦃G, L⦄ ⊢ T1 ▪[h, g] d1 →
  35                    ∀d2. d2 ≤ d1 → ⦃G, L⦄ ⊢ T1 •*[h, d2] T2 → ⦃G, L⦄ ⊢ T1 •*➡*[h, g, d2] T2.
  36 /2 width=6 by ex4_2_intro/ qed.
  37
  38 lemma scpds_strap1: ∀h,g,G,L,T1,T,T2,d.
  39                     ⦃G, L⦄ ⊢ T1 •*➡*[h, g, d] T → ⦃G, L⦄ ⊢ T ➡ T2 → ⦃G, L⦄ ⊢ T1 •*➡*[h, g, d] T2.
  40 #h #g #G #L #T1 #T #T2 #d * /3 width=8 by cprs_strap1, ex4_2_intro/
  41 qed.
  42
  43 (* Basic forward lemmas *****************************************************)
  44
  45 lemma scpds_fwd_cprs: ∀h,g,G,L,T1,T2. ⦃G, L⦄ ⊢ T1 •*➡*[h, g, 0] T2 →
  46                       ⦃G, L⦄ ⊢ T1 ➡* T2.
  47 #h #g #G #L #T1 #T2 * /3 width=3 by cprs_strap2, lstas_cpr/
  48 qed-.