Code background grey, use special code-block for GHCi

VL1/content/VL1_arithmetic_and_co.tex

@@ -1,9 +1,8 @@
-GHCi:
-\begin{haskellcode}
+\begin{haskellcode*}{bgcolor=mygrey,frame=single,numbers=none,label=GHCi}
 > 3 + 5
 > (3 :: Integer) + (5 :: Int)
 > 6 * 5.0
 > "Hello" ++ " world"
 > "Haskell" > "C++"
 > True && False
-\end{haskellcode}
+\end{haskellcode*}

VL1/content/VL1_lists2.tex

@@ -1,5 +1,5 @@
 Let's check on a few very common list operations:
-\begin{haskellcode}
+\begin{haskellcode*}{bgcolor=mygrey,frame=single,numbers=none,label=GHCi}
 > [1, 2] ++ [4, 5]  -- append two lists
 > head [1, 2, 3]    -- first element
 > tail [1, 2, 3]    -- everything after the head
@@ -8,12 +8,12 @@ Let's check on a few very common list operations:
 > drop 2 [1, 2, 3]  -- drop the first two elements
 > sum [1, 2, 3]
 > elem 7 [1, 2, 3]  -- is there a 7 in the list?
-\end{haskellcode}
+\end{haskellcode*}
 \pause
 A String in haskell is just a list of Chars!
-\begin{haskellcode}
+\begin{haskellcode*}{bgcolor=mygrey,frame=single,numbers=none,label=GHCi}
 > ['a', 'b', 'c']
 > 'a' : []
 > head "abc"
 > 'a' ++ 'c'
-\end{haskellcode}
+\end{haskellcode*}

VL1/content/VL1_lists4.tex

@@ -7,13 +7,13 @@ $S = \{2 \times x\ |\ x \in \mathbb{N},\ x \leq 10\}$
 \\
 How does this look in haskell?
 \pause
-\begin{haskellcode}
+\begin{haskellcode*}{bgcolor=mygrey,frame=single,numbers=none,label=GHCi}
 > [ 2 * x | x <- [1..10]]
-\end{haskellcode}
+\end{haskellcode*}
 \pause
 Now let's say we want all numbers between 50 and 100 that have the remainder 0 when divided by 12:
 \pause
-\begin{haskellcode}
+\begin{haskellcode*}{bgcolor=mygrey,frame=single,numbers=none,label=GHCi}
 > [x | x <- [50..100], mod x 12 == 0]
-\end{haskellcode}
+\end{haskellcode*}
 \code{x <- [50..100]} is the binding, while \code{mod x 12 == 0} is the predicate, separated by a comma. We can have multiple predicates.