]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/lambdadelta/basic_2/computation/fleq.ma
- lambdadelta: tentative definition of lazy equivalence for closures +
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / computation / fleq.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_2/notation/relations/fleq_8.ma".
16 include "basic_2/computation/lpxs.ma".
17
18 (* EQUIVALENT "BIG TREE" NORMAL FORMS ***************************************)
19
20 (* Note: this definition works but is not symmetric nor decidable *)
21 definition fleq: ∀h. sd h → tri_relation genv lenv term ≝
22                  λh,g,G1,L1,T1,G2,L2,T2.
23                  ∧∧ G1 = G2 & ⦃G1, L1⦄ ⊢ ➡*[h, g] L2 & T1 = T2.
24
25 interpretation
26    "equivalent 'big tree' normal forms (closure)"
27    'FLEq h g G1 L1 T1 G2 L2 T2 = (fleq h g G1 L1 T1 G2 L2 T2).
28
29 (* Basic_properties *********************************************************)
30
31 lemma fleq_refl: ∀h,g. tri_reflexive … (fleq h g).
32 /2 width=1 by and3_intro/ qed.