From: Claudio Sacerdoti Coen <claudio.sacerdoticoen@unibo.it>
Date: Wed, 31 Jan 2007 18:29:53 +0000 (+0000)
Subject: New test for mutual recursive definitions.
X-Git-Tag: 0.4.95@7852~638
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=d32606924ee81fe309d016df7704f2612ebdc05e;p=helm.git

New test for mutual recursive definitions.
---

diff --git a/matita/tests/letrecand.ma b/matita/tests/letrecand.ma
new file mode 100644
index 000000000..017c2ae89
--- /dev/null
+++ b/matita/tests/letrecand.ma
@@ -0,0 +1,74 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||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/test/letrecand".
+
+include "nat/nat.ma".
+
+let rec pari n : Prop :=
+ match n with
+  [ O ⇒ True
+  | S n ⇒ dispari n
+  ]
+and dispari n : Prop :=
+ match n with
+  [ O => False
+  | S n => pari n
+  ].
+  
+definition pari2 ≝
+let rec pari n : Prop :=
+ match n with
+  [ O ⇒ True
+  | S n ⇒ dispari n
+  ]
+and dispari n : Prop :=
+ match n with
+  [ O => False
+  | S n => pari n
+  ]
+in pari.
+
+definition dispari2 ≝
+let rec pari n : Prop :=
+ match n with
+  [ O ⇒ True
+  | S n ⇒ dispari n
+  ]
+and dispari n : Prop :=
+ match n with
+  [ O => False
+  | S n => pari n
+  ]
+in dispari.
+
+lemma test_pari: pari (S (S O)).
+simplify.
+constructor 1.
+qed.
+
+lemma test_pari2: pari2 (S (S O)).
+simplify.
+constructor 1.
+qed.
+
+lemma test_dispari: dispari (S O).
+simplify.
+constructor 1.
+qed.
+
+lemma test_dispari2: dispari2 (S O).
+simplify.
+constructor 1.
+qed.
\ No newline at end of file