ocaml 3.09 transition

[helm.git] / helm / matita / tests / match_inference.ma

diff --git a/helm/matita/tests/match_inference.ma b/helm/matita/tests/match_inference.ma
index 5cfa19cc9d326b9fb82715f9962b6eaa934704bf..0e27ce4098d58eeee7276da93673e292b443d7df 100644 (file)
--- a/helm/matita/tests/match_inference.ma
+++ b/helm/matita/tests/match_inference.ma
@@ -1,3 +1,17 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||M||                                                             *)
+(*      ||A||       A project by Andrea Asperti                           *)
+(*      ||T||                                                             *)
+(*      ||I||       Developers:                                           *)
+(*      ||T||         The HELM team.                                      *)
+(*      ||A||         http://helm.cs.unibo.it                             *)
+(*      \   /                                                             *)
+(*       \ /        This file is distributed under the terms of the       *)
+(*        v         GNU General Public License Version 2                  *)
+(*                                                                        *)
+(**************************************************************************)
+
 set "baseuri" "cic:/matita/tests/match_inference/".
 
 inductive pos: Set \def
@@ -29,3 +43,10 @@ definition r : True \def
  match (le_n O) with
   [ le_n \Rightarrow I
   | (le_S y p') \Rightarrow I ].
+
+inductive Prod (A,B:Set): Set \def
+pair : A \to B \to Prod A B.
+
+definition fst : \forall A,B:Set. (Prod A B) \to A \def
+\lambda A,B:Set. \lambda p:(Prod A B). match p with
+[(pair a b) \Rightarrow a].