-\r
-data List a = Nil | Cons a (List a)\r
-\r
-first :: List Integer -> Integer\r
-//first Nil = 0 :: Integer\r
-first (Cons x _) = x\r
-\r
-reverse :: List a -> List a\r
-reverse l = reverseAux Nil l \r
- where\r
- reverseAux accum Nil = accum\r
- reverseAux accum (Cons h t) = reverseAux (Cons h accum) t \r
-\r
-main :: Integer\r
-main = first (reverse l) \r
- where\r
- l = Cons (1 :: Integer) (Cons (2 :: Integer) (Cons (3 :: Integer) Nil))\r
---\r
+
+data List a = Nil | Cons a (List a)
+
+first :: List Integer -> Integer
+//first Nil = 0 :: Integer
+first (Cons x _) = x
+
+reverse :: List a -> List a
+reverse l = reverseAux Nil l
+ where
+ reverseAux accum Nil = accum
+ reverseAux accum (Cons h t) = reverseAux (Cons h accum) t
+
+main :: Integer
+main = first (reverse l)
+ where
+ l = Cons (1 :: Integer) (Cons (2 :: Integer) (Cons (3 :: Integer) Nil))
+--