new grammar and adapted renamer

sample-programs/basic-1

@@ -1,2 +1,2 @@
-f : _Int -> _Int ;
+f : Int -> Int ;
 f = \x. x+1 ;

sample-programs/basic-2

@@ -1,5 +1,5 @@
-add : _Int -> _Int -> _Int ;
+add : Int -> Int -> Int ;
 add x = \y. x+y;
 
-main : _Int ;
+main : Int ;
 main = (\z. z+z) ((add 4) 6) ;

sample-programs/basic-3

@@ -1,2 +1,2 @@
-main : _Int ;
+main : Int ;
 main = (\x. x+x+3) ((\x. x) 2) ;

sample-programs/basic-4

@@ -1,2 +1,2 @@
-f : _Int -> _Int ;
+f : Int -> Int ;
 f x = let g = (\y. y+1) in g (g x)

sample-programs/basic-5

@@ -1,8 +1,8 @@
-double : _Int -> _Int ;
+double : Int -> Int ;
 double n = n + n;
 
-id : 'a -> 'a ;
+id : forall a. a -> a ;
 id x = x ;
 
-main : _Int ;
+main : Int ;
 main = id double 5;

sample-programs/basic-6

@@ -3,7 +3,7 @@ data Bool () where {
     False : Bool ()
 };
 
-main : Bool () -> _Int ;
+main : Bool () -> Int ;
 main b = case b of {
     False => 0;
     True => 0

sample-programs/basic-7

@@ -3,7 +3,7 @@ data Bool () where {
     False : Bool ()
 };
 
-ifThenElse : Bool () -> 'a -> 'a -> 'a;
+ifThenElse : forall a. Bool () -> a -> a -> a;
 ifThenElse b if else = case b of {
         True => if;
         False => else

sample-programs/basic-8

@@ -1,22 +1,22 @@
-data Maybe ('a) where {
-    Nothing : Maybe ('a)
-    Just : 'a -> Maybe ('a)
+data Maybe (a) where {
+    Nothing : Maybe (a)
+    Just : forall a. a -> Maybe (a)
 };
 
-fromJust : Maybe ('a) -> 'a ;
+fromJust : Maybe (a) -> a ;
 fromJust a =
     case a of {
         Just a => a
     };
 
-fromMaybe : 'a -> Maybe ('a) -> 'a ;
+fromMaybe : a -> Maybe (a) -> a ;
 fromMaybe a b =
     case b of {
         Just a => a;
         Nothing => a
     };
 
-maybe : 'b -> ('a -> 'b) -> Maybe ('a) -> 'b;
+maybe : b -> (a -> b) -> Maybe (a) -> b;
 maybe b f ma =
     case ma of {
         Just a => f a;