Let's try to make the "let rec" construct infer its arguments.

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

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index 3d1279133e7c956d82f4051e67fa63a23aab8e70..9e47c3e1e5b6b99ab0677a9344799b14e44bb4f1 100644 (file)
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -12,12 +12,12 @@ inductive int: Set \def
 
 inductive empty : Set \def .
 
-let rec pos2nat (x:pos) : nat  \def 
+let rec pos2nat x \def 
   match x with  
   [ one \Rightarrow (S O)
   | (next z) \Rightarrow S (pos2nat z)].
 
-let rec nat2int (x:nat) :int \def
+let rec nat2int x \def
   match x with
   [ O \Rightarrow positive O
   | (S z) \Rightarrow positive (S z)].
@@ -26,7 +26,7 @@ coercion pos2nat.
 
 coercion nat2int.
 
-let rec plus x y : int \def
+let rec plus x y \def
   match x with
   [ (positive n) \Rightarrow x
   | (negative z) \Rightarrow y].