Fix two doctests in GHC-8.2

Author: christiaanb

src/CLaSH/Sized/Vector.hs

@@ -1680,15 +1680,15 @@ lazyV = lazyV' (repeat undefined)
 -- >>> let append' xs ys = foldr (:>) ys xs
 -- <BLANKLINE>
 -- <interactive>:...
---     • Occurs check: cannot construct the infinite type: t ~ t + 1
---       Expected type: a -> Vec t a -> Vec t a
---         Actual type: a -> Vec t a -> Vec (t + 1) a
+--     • Occurs check: cannot construct the infinite type: ... ~ ... + 1
+--       Expected type: a -> Vec ... a -> Vec ... a
+--         Actual type: a -> Vec ... a -> Vec (... + 1) a
 --     • In the first argument of ‘foldr’, namely ‘(:>)’
 --       In the expression: foldr (:>) ys xs
 --       In an equation for ‘append'’: append' xs ys = foldr (:>) ys xs
 --     • Relevant bindings include
---         ys :: Vec t a (bound at ...)
---         append' :: Vec n a -> Vec t a -> Vec t a
+--         ys :: Vec ... a (bound at ...)
+--         append' :: Vec n a -> Vec ... a -> Vec ... a
 --           (bound at ...)
 --
 -- The reason is that the type of 'foldr' is:

src/CLaSH/Tutorial.hs

@@ -84,9 +84,14 @@ import Data.Default
 {- $setup
 >>> :set -XTemplateHaskell
 >>> :set -XDataKinds
->>> let ma acc (x,y) = acc + x * y
 >>> :{
-let macT acc (x,y) = (acc',o)
+let ma :: Num a => a -> (a, a) -> a
+    ma acc (x,y) = acc + x * y
+:}
+
+>>> :{
+let macT :: Num a => a -> (a,a) -> (a,a)
+    macT acc (x,y) = (acc',o)
        where
          acc' = ma acc (x,y)
          o    = acc
@@ -427,7 +432,7 @@ Going back to the original specification we note the following:
 When we examine the type of 'macT' we see that is still completely combinational:
 
 >>> :t macT
-macT :: Num t => t -> (t, t) -> (t, t)
+macT :: Num a => a -> (a, a) -> (a, a)
 
 The "CLaSH.Prelude" library contains a function that creates a sequential
 circuit from a combinational circuit that has the same Mealy machine type /