From 3ef7797ef6fc605dfafb32523261fe1b023aeecb Mon Sep 17 00:00:00 2001 From: Samuel Mimram Date: Fri, 28 Apr 2006 14:59:16 +0000 Subject: Imported Upstream version 8.0pl3+8.1alpha --- test-suite/success/mutual_ind.v | 45 +++++++++++++++++++++-------------------- 1 file changed, 23 insertions(+), 22 deletions(-) (limited to 'test-suite/success/mutual_ind.v') diff --git a/test-suite/success/mutual_ind.v b/test-suite/success/mutual_ind.v index e932f50c..463efed3 100644 --- a/test-suite/success/mutual_ind.v +++ b/test-suite/success/mutual_ind.v @@ -7,35 +7,36 @@ (************************************************************************) (* Definition mutuellement inductive et dependante *) -Require Export PolyList. +Require Export List. - Record signature : Type := { - sort : Set; - sort_beq : sort->sort->bool; - sort_beq_refl : (f:sort)true=(sort_beq f f); - sort_beq_eq : (f1,f2:sort)true=(sort_beq f1 f2)->f1=f2; + Record signature : Type := + {sort : Set; + sort_beq : sort -> sort -> bool; + sort_beq_refl : forall f : sort, true = sort_beq f f; + sort_beq_eq : forall f1 f2 : sort, true = sort_beq f1 f2 -> f1 = f2; fsym :> Set; - fsym_type : fsym->(list sort)*sort; - fsym_beq : fsym->fsym->bool; - fsym_beq_refl : (f:fsym)true=(fsym_beq f f); - fsym_beq_eq : (f1,f2:fsym)true=(fsym_beq f1 f2)->f1=f2 - }. + fsym_type : fsym -> list sort * sort; + fsym_beq : fsym -> fsym -> bool; + fsym_beq_refl : forall f : fsym, true = fsym_beq f f; + fsym_beq_eq : forall f1 f2 : fsym, true = fsym_beq f1 f2 -> f1 = f2}. Variable F : signature. - Definition vsym := (sort F)*nat. + Definition vsym := (sort F * nat)%type. - Definition vsym_sort := (fst (sort F) nat). - Definition vsym_nat := (snd (sort F) nat). + Definition vsym_sort := fst (A:=sort F) (B:=nat). + Definition vsym_nat := snd (A:=sort F) (B:=nat). - Mutual Inductive term : (sort F)->Set := - | term_var : (v:vsym)(term (vsym_sort v)) - | term_app : (f:F)(list_term (Fst (fsym_type F f))) - ->(term (Snd (fsym_type F f))) - with list_term : (list (sort F)) -> Set := - | term_nil : (list_term (nil (sort F))) - | term_cons : (s:(sort F);l:(list (sort F))) - (term s)->(list_term l)->(list_term (cons s l)). + Inductive term : sort F -> Set := + | term_var : forall v : vsym, term (vsym_sort v) + | term_app : + forall f : F, + list_term (fst (fsym_type F f)) -> term (snd (fsym_type F f)) +with list_term : list (sort F) -> Set := + | term_nil : list_term nil + | term_cons : + forall (s : sort F) (l : list (sort F)), + term s -> list_term l -> list_term (s :: l). -- cgit v1.2.3