Update my answers in ch5

Author: dwayne

ch5/DetermineTheType.hs

@@ -0,0 +1,7 @@
+{-# LANGUAGE NoMonomorphismRestriction #-}
+-- Toggle to see how the type of example changes
+
+module DetermineTheType where
+
+-- simple example
+example = 1

ch5/doesItCompile.hs

@@ -1,3 +1,5 @@
+-- N.B. Yes = it squawks, No = it doesn't squawk i.e. it works
+
 -- 1
 bigNum = (^) 5 $ 10
 -- wahoo = bigNum $ 10

ch5/ex1.txt

@@ -1,3 +1,5 @@
+Exercises: Type Matching
+
 1.
 
 a) not :: Bool -> Bool            ; c)

ch5/ex2.txt

@@ -1,3 +1,5 @@
+Exercises: Type Arguments
+
 1. a)
 
 let f :: a -> a -> a -> a; f = undefined

ch5/ex3.txt

@@ -3,7 +3,7 @@
 id :: a -> a
 id x = x
 
-We cannot do anything to x because it's not constrained to anything.
+I don't know anything about x so all I can do is return it.
 
 2. Given type a -> a -> a, we can define
 
@@ -25,4 +25,4 @@ snd x y = y
 There is only one possible implementation.
 
 If we know more about a and b then the behaviour can change because we may be
-about to use more operations on them to return something different.
+able to use more operations on them to return something different.

ch5/ex4.txt

@@ -1,3 +1,5 @@
+Exercises: Apply Yourself
+
 1.
 
 myConcat :: [Char]