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/dynamic/nta.ma".
17 (* HIGHER ORDER NATIVE TYPE ASSIGNMENT ON TERMS *****************************)
19 definition ntas: sh → lenv → relation term ≝
20 λh,L. star … (nta h L).
22 interpretation "higher order native type assignment (term)"
23 'NativeTypeStar h L T U = (ntas h L T U).
25 (* Basic eliminators ********************************************************)
27 lemma cprs_ind: ∀L,T1. ∀R:predicate term. R T1 →
28 (∀T,T2. L ⊢ T1 ➡* T → L ⊢ T ➡ T2 → R T → R T2) →
29 ∀T2. L ⊢ T1 ➡* T2 → R T2.
30 #L #T1 #R #HT1 #IHT1 #T2 #HT12
31 @(TC_star_ind … HT1 IHT1 … HT12) //
34 axiom ntas_ind_dx: ∀h,L,T2. ∀R:predicate term. R T2 →
35 (∀T1,T. ⦃h, L⦄ ⊢ T1 : T → ⦃h, L⦄ ⊢ T :* T2 → R T → R T1) →
36 ∀T1. ⦃h, L⦄ ⊢ T1 :* T2 → R T1.
38 #h #L #T2 #R #HT2 #IHT2 #T1 #HT12
39 @(star_ind_dx … HT2 IHT2 … HT12) //
42 (* Basic properties *********************************************************)
44 lemma ntas_refl: ∀h,L,T. ⦃h, L⦄ ⊢ T :* T.
47 lemma ntas_strap1: ∀h,L,T1,T,T2.
48 ⦃h, L⦄ ⊢ T1 :* T → ⦃h, L⦄ ⊢ T : T2 → ⦃h, L⦄ ⊢ T1 :* T2.
51 lemma ntas_strap2: ∀h,L,T1,T,T2.
52 ⦃h, L⦄ ⊢ T1 : T → ⦃h, L⦄ ⊢ T :* T2 → ⦃h, L⦄ ⊢ T1 :* T2.