removed "tilde_expand" hack: for the moment it is not needed (we can use $HOME)

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

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index ae69759bf4c083fe6ccaf5c4acb2325631d5e69d..20b15cd2650d8a7f7840d68696da39423af2248c 100644 (file)
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -13,7 +13,7 @@
 (**************************************************************************)
 
 set "baseuri" "cic:/matita/tests/coercions/".
-include "coq.ma".
+include "legacy/coq.ma".
 
 inductive pos: Set \def
 | one : pos
@@ -36,12 +36,29 @@ let rec pos2nat x \def
 
 definition nat2int \def \lambda x. positive x.
 
-coercion pos2nat.
+coercion cic:/matita/tests/coercions/pos2nat.con.
 
-coercion nat2int.
+coercion cic:/matita/tests/coercions/nat2int.con.
 
 definition fst \def \lambda x,y:int.x.
 
 theorem a: fst O one = fst (positive O) (next one).
 reflexivity.
 qed.
+
+definition double: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (nat2int x).
+  
+definition double1: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (pos2nat x).
+
+definition double2: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (nat2int (pos2nat x)).
+  
+